Data Structures and Algorithms Annotated Reference with Examples
This book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most imperative programming language. Topics covered includes: Data Structures, Linked Lists, Binary Search Tree, Heap, Sets, Queues, Algorithms, Sorting, Sorting.
Author(s): Granville Barnett, and Luca Del Tongo
112 Pages 
Advanced Algorithms by Anupam Gupta
These all are very extensive notes on fairly advanced topics in algorithms—both theoretical and practical. Here we deal with discrete algorithms for minimum spanning trees, arborescences (directed spanning trees), dynamic algorithms for problems in graph connectivity, and the shortest path. Other topics discussed in the paper are the combinatorial, algebraic algorithms for graph matching techniques and their corresponding challenges developed within high-dimensional spaces via the technique of dimension reduction and streaming algorithms. Other topics but not triangulated within include the approximate max-flows, online learning, and interior-point methods. The notes thus present a framework in its totality for learning and analyzing super advanced algorithms and thus become a good source to glean insights for an ocean of problems in computer science.
Author(s): Anupam Gupta
309 Pages
Design And Analysis Of Algorithms by Herbert Edelsbrunner
Design and Analysis of Algorithms is a book by Herbert Edelsbrunner that gives a detailed description of the basic principles and techniques of algorithms. The book offers basic data structures and some graph algorithms, making it one of the best platforms to understand how to design and analyze algorithms. It emphasizes the developers developing a good and efficient algorithm, followed by the analysis of complexity. It contains basic data structures such as trees, graphs, and several strategies of algorithmic problem-solving. Edelsbrunner's approach in the text marries theoretical insights with the practical details that are absolutely necessary to implement his algorithms. So, his book will be of great use to students, researchers, and practitioners concerned with algorithms in computer science. The book will help the readers to incite strong skills in algorithmic techniques and their applications and create an overview necessary for a deeper understanding of computational efficiency and problem solving.
Author(s): Herbert Edelsbrunner
95 Pages
Advanced Algorithms by Prof. Michel Goemans
Advanced Algorithms" by Prof. Michel Goemans is an advanced-level text focused on sophisticated algorithmic methods for doctoral students and researchers. Advanced subjects like Fibonacci heaps, network flows, and dynamic trees are explained in detail, together with linear programming-the Goldberg-Tarjan min-cost circulation algorithm, approximation algorithms, max-cut problems, and conic programming. Goemans explains such advanced concepts in great detail, merging theory and practice. This text will be useful for anyone interested in deeply understanding modern algorithms and how they may be implemented and includes a conceptual framework for rigorous solutions to complex computational problems.
Author(s): Prof. Michel Goemans
NA Pages
Data Structures And Algorithms by Sugih Jamin
The book Data Structures and Algorithms by Sugih Jamin covers all the basic concepts of Computer Science in a very balanced way. It involves topics such as linked lists, stacks, and queues to more advanced topics such as binary search trees, heaps, and balanced search trees. Jama's text emphasizes an implementation perspective and algorithmic patterns, which will facilitate a more effective way of understanding and applying the concepts presented. This book will be very useful for the students and professionals who want to establish a sound foundation in data structures and algorithms by providing a solid theoretical background supported by practical examples that explain how problems are solved.
Author(s): Sugih Jamin
NA Pages
Distributed Algorithms Lecture Notes
Prof. Nancy Lynch's Distributed Algorithms Lecture Notes has a great amount of detail concerning algorithms designed for distributed systems within which important aspects are that of multiple processors executing without centralized control. This paper investigates the model assumptions and organization strategies tasked with the two basic timing models. It also looks at synchronous, asynchronous, and partially synchronous models and synchronous networks. They discuss various models, thus enable the researchers to understand what one is actually up against and what strategies one can use in order to design algorithms working effectively in distributed environments. Hence, Lynch's notes are a must-have for any researcher who aims to know how to manage communication and coordination in distributed systems. Therefore, ideal for use by students and professionals dealing with distributed computing and networked systems.
Author(s): Prof. Nancy Lynch
NA Pages
The lecture notes on Approximation Algorithms by Shuchi Chawla focus on techniques of designing algorithms that produce near-optimal solutions to complex optimization problems for which finding an exact solution is computationally infeasible. These lecture notes cover general underlying techniques of approximation algorithms, comprising basic building blocks and the foundation needed to deal with problems which are difficult to solve exactly due to computational complexity. These notes by Chawla provide an outline of various methods for approaching different optimization problems and ways of solving them when exact algorithms are not practical. Further, this resource is likely to be extremely helpful with respect to devising and applying approximation algorithms returning good solutions within a reasonable amount of time; hence, this is a must for scholars and practitioners faced with hard optimization problems.
Author(s): Shuchi Chawla
NA Pages
