Advertisement
Lecture Notes on Design and Analysis of Algorithms
This note describes the following topics: Greedy methods, Dynamic programming, Backtracking, Branch and bound.
Author(s): Annamalai University
96 Pages
Distributed Algorithms Lecture Notes
Distributed algorithms are algorithms designed to run on multiple processors, without tight centralized control. Topics covered includes: Variations in model assumptions, Top-level organization is by the timing model, Synchronous model, Asynchronous model, Partially synchronous model, Synchronous networks.
Author(s): Prof. Nancy Lynch
NA Pages
Advanced Algorithms Lectures and Resources
This note will cover classic and modern algorithmic ideas that are central to many areas of Computer Science. The focus is on most powerful paradigms and techniques of how to design algorithms, and measure their efficiency. The topics will include hashing, sketching, dimension reduction, linear programming, spectral graph theory, gradient descent, multiplicative weights, compressed sensing, and others.
Author(s): Alex Andon
NA Pages
Design And Analysis Of Algorithms by Herbert Edelsbrunner
This book focuses on fundamental data structures and graph algorithms. The emphasis will be on algorithm design and on algorithm analysis.
Author(s): Herbert Edelsbrunner
95 Pages
In computer science, an algorithm is a self-contained step-by-step set of operations to be performed. Topics covered includes: Algorithmic Primitives for Graphs, Greedy Algorithms, Divide and Conquer, Dynamic Programming, Network Flow, NP and Computational Intractability, PSPACE, Approximation Algorithms, Local Search, Randomized Algorithms.
Author(s): Jon Kleinberg and Eva Tardos
459 Pages
Lecture Notes on Data Structures
This note covers the following topics: Algorithms and Data Structures, Introduction to Java, Software Development, Writing Classes, Writing Classes in Java, Unit Testing, Building Large Java Applications, Inheritance and Polymorphism, Interfaces, A Math Review, Algorithm Analysis, Data Types versus Data Structures, Collections, Stacks ,Queues, Lists, Recursion, Sorting, Trees, Oriented Trees, Ordered Trees, Binary Trees, Sets and Dictionaries, Search Trees, Binary Search Trees, Red-Black Trees.
Author(s): Ray Toal
NA Pages
Applied Algorithms Lecture Slides
This note covers the following topics: Introduction, Stable Matching, Graph Algorithms, Greedy Algorithms, Minimum Spanning Trees, Recurrences, Dynamic programming, Network Flow and Network Flow Applications.
Author(s): Richard Anderson
NA Pages
Lecture Notes Introduction to Computer Algorithms
This course note provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.
Author(s): Prof. Erik Demaine, Prof. Ronald Rivest and Prof. Srinivas Devadas
NA Pages
This note covers the following topics: Mathematics for Algorithmic, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Amortized Analysis, Hash Table, Binary Search Tree, Graph Algorithms, String Matching, Sorting and Approximate Algorithms
Author(s): Rashid Bin Muhammad
NA Pages
Information Retrieval (C.J. van Rijsgergen)
The material of this book is aimed at advanced undergraduate information (or computer) science students, postgraduate library science students, and research workers in the field of IR. Some of the chapters, particular chapter 6, make simple use of a little advanced mathematics.
Author(s): C.J. van Rijsgergen
NA PagesAdvertisement
