Purely Functional Data Structures

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

Fundamentals of Algorithms with Applications

This note explains the following topics: Growth of functions, Basic data structures, Sorting and Selection, Fundamental techniques, Dynamic programming and Graphs, Graph algorithms, NP-Completeness and approximation algorithms, Randomized Algorithms.

Author(s): Michael T. Goodrich

NA Pages

Introduction to Algorithms Lecture Notes

This note concentrates on the design of algorithms and the rigorous 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, design of online algorithms and competitive analysis.

Author(s): Michael Dinitz

NA Pages

Design and Analysis of Algorithms

This is an intermediate algorithms course note with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

Author(s): Prof. Erik Demaine, Prof. Srinivas Devadas and Prof. Nancy Lynch

NA Pages

Introduction to Algorithms

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

Introduction to the Design and Analysis of Algorithms

This note introduces a number of important algorithm design techniques as well as basic algorithms that are interesting both from a theoretical and also practical point of view. Topics covered are: Introduction to Algorithms, Asymptotic Analysis, Recurrence Equations, Sorting Algorithms, Search Trees, Randomized Algorithms and Quicksort, Selection Algorithms, Number Theory and Cryptography Algorithms, Graph algorithms, Greedy Algorithms and External Memory Algorithms.

Author(s): Department of Computer Science at Duke University

NA Pages

Skiena's Algorithms Lectures

This note covers the following topics: Introduction to Algorithms, Asymptotic Notation, Modeling or Logarithms, Elementary Data Structures, Dictionary data structures, Sorting, Heapsort or Priority Queues, Recurrence Relations, Introduction to NP-completeness, Reductions, Cook's Theorem or Harder Reduction, NP-completeness challenge, Approximation Algorithms and Heuristic Methods.

Author(s): Steven Skiena

NA 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

Data Structures and Algorithms The Basic Toolbox

This book is a concise introduction to this basic toolbox, intended for students and professionals familiar with programming and basic mathematical language.

Author(s): K. Mehlhorn and P. Sanders

NA 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