Johns Hopkins University published well defined Lecture Notes focuses mainly on the design of various algorithms and analysis of their efficiency. Topics covered includes: the basic definitions of algorithmic complexity, basic
tools such as dynamic programming, sorting, searching, and selection; advanced
data structures and their applications, graph algorithms and searching
techniques such as minimum spanning trees, depth-first search, shortest paths, Online Algorithms, Machine learning Theories, Algorithmic Game Theory, etc.
We aims to provide you all subject book reviews and online ebooks which are free to use in all sense!
Popular Posts
Book Titles
-
▼
2020
(17)
- ► 03/29 - 04/05 (6)
-
▼
03/22 - 03/29
(11)
- Algorithms and data structures Lecture Notes by Th...
- Purely Functional Data Structures By Carnegie Mell...
- Advanced Data Structures By The Institute of Mathe...
- Electronic Lecture Notes on Data Structures and Al...
- Design and Analysis of Algorithms: Course Notes Pr...
- Design and Analysis of Algorithms By Massachusetts...
- Introduction to Algorithms By University of Washin...
- Introduction to Algorithms By Johns Hopkins Univer...
- Approximation Algorithms By The University of Wisc...
- Advanced Algorithms By University of Wisconsin-Mad...
- Distributed Algorithms Lecture Notes By Massachuse...