Advertisement
Data Structures And Algorithms by Sugih Jamin
This note covers the following topics: Algorithm Analysis, algorithmic patterns, Standard I/O and iostream, Foundational Data Structures and Basic Abstract Data Types, Linked-list, Stacks and Queues, PA1 walkthrough, Pointer, Hashing, Recursion and Recurrence Relations, Trees, Binary Search Trees, Range and Multidimensional Searches, Heaps, Tries, Balanced Search Trees, Binary-tree Representations of Multi-way Trees.
Author(s): Sugih Jamin
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
This note covers the following topics: Self adjusting data structures, amortized analysis, self adjusting lists, Splay trees, their performance and related conjectures, Hashing, FKS perfect hashing, Cuckoo hasing, dynamic perfect hashing, Fusion Trees, Fully dynamic connectivity in polylogarithmic time, Dynamic all pairs shortest paths, Linear time construction of Suffix trees and arrays, Succinct Data Structures, External memory data structures, Geometric data structures, Top trees, Retroactive data structures, Online optimal structure for planar point location.
Author(s): Venkatesh Raman
NA Pages
Analysis and Design of Computer Algorithms by Ganesh Kumar
This note covers the following topics: Divide And Conquer Strategy, Greedy Method, Minimum Spanning Trees, Dynamic Programming, Optimal Binary search trees, Backtracking Method, Branch and Bound, Lower bound Theory.
Author(s): Sh. Ganesh Kumar
85 Pages
Data Structures and Algorithm Analysis
This book is designed as a teaching text that covers most standard data structures, but not all. A few data structures that are not widely adopted are included to illustrate important principles.
Author(s): Clifford A. Shaffer
NA Pages
This lecture note explains data structures and algorithms, focusing on advanced topics such as graph theory, randomized algorithms, and combinatorial search.
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
Design and Analysis of Computer Algorithms (PDF 135P)
This lecture note discusses the approaches to designing optimization algorithms, including dynamic programming and greedy algorithms, graph algorithms, minimum spanning trees, shortest paths, and network flows. Also it briefly discusses algorithmic problems arising from geometric settings, that is, computational geometry.
Author(s): David M. Mount
135 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
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 Pages
Dictionary of Algorithms and Data Structures
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
