• Title Algorithms and Data Structures: The Basic Toolbox
• Author(s) Kurt Mehlhorn and Peter Sanders
• Publisher: Springer; 2008 edition (November 19, 2010)
• Paperback 300 pages
• eBook PDF files
• Language: English
• ISBN-10: 3642096824
• ISBN-13: 978-3642096822
• Share This:  

Book Description

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems.

This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization.

The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java.

• Kurt Mehlhorn was appointed a Fellow of the ACM (1999) "for important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms". A Professor of Computer Science at Saarland University since 1975, and a director of the Max-Planck-Institut fur Informatik in Saarbrucken.
• Peter Sanders is a Professor of Computer Science at the University of Karlsruhe. A leading researcher in the area of theoretical and experimental algorithm analysis, in particular related to efficient algorithms for parallel processing and communication in networks, his responsibilities include organizing the European Symposium on Algorithms in Karlsruhe in 2008.

• Amazon

• Algorithms and Data Structures
• The C++ Programming Language
• Introduction to Java, Basic and Core Java

• Algorithms and Data Structures: The Basic Toolbox (Kurt Mehlhorn, et al)
• The Mirror Site (1) - PDF (305 pages, 2.0 MB)
• The Mirror Site (2) - 2007 Edition - PDF (295 pages, 3.0 MB)

• Open Data Structures: An Introduction (Pat Morin)

  This book is an introduction to the field of data structures and algorithms, it covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

• Think Data Structures: Algorithms and Information Retrieval

  This practical book will help you learn and review some of the most important ideas in software engineering - data structures and algorithms - in a way that's clearer, more concise, and more engaging than other materials. Useful in technical interviews too.

• Foundations of Computer Science - Data Structures using C

  This textbook combines the theoretical foundations of computing with essential discrete mathematics. It shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs.

• Data Structures and Algorithms: Reference with Examples

  A key factor of this book and its associated implementations is that all algorithms were designed by authors, using the theory of the algorithm in question as a guideline. It covers the key ideas involved in designing algorithms.

• Purely Functional Data Structures (Chris Okasaki)

  This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. All source code is given in Standard ML and Haskell.

• Algorithms and Data Structures (Niklaus Wirth)

  From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). It includes new material on sequential structure, searching and priority search trees.

• Algorithms and Data Structures: Apps to Graphics and Geometry

  An introductory coverage of algorithms and data structures with application to graphics and geometry aims to show a sample of the intellectual demands required by a computer science curriculum, exercises, many with solutions, are included throughout the book.

• Data Structures and Algorithms Using C (Debdutta Pal, et al.)

  Refine and enhance the innovative approach to algorithms and data structures. Using a C implementation, highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.

• Notes on Data Structures and Programming Techniques in C

  There are two purposes to this book: to teach you to program in the C programming language, and to teach you how to choose, implement, and use data structures and standard programming techniques.

• Data Structures: Fundamental Tools (Wikibooks)

  This book describes data structures from the point of view of programming, with examples, and presents design techniques that allow programmers to develop their own data structures.

• Problem Solving with Algorithms and Data Structures Using Python

  This is a textbook about computer science. It is also about Python. However, there is much more. The tools and techniques that you learn here will be applied over and over as you continue your study of computer science.

• Data Structures and Algorithms in Dart (Jonathan Sande)

  This book is for programmers who are familiar with the Dart language but would like to improve the efficiency of their code and take their skills to the next level. You'll learn how to analyze the efficiency of your code and express that efficiency using Big O notation.

• Swift Algorithms and Data Structures (Wayne Bishop)

  This book blends modern code, illustrations, and computer science to help you build your next app using in the new iOS development language called Swift, provides an introduction to commonly used data structures and algorithms.

• Ruby Data Structures and Algorithms (Christopher Fox)

  This book is a concise introduction to data structures and algorithms in Ruby. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections.

• Data Structures and Algorithm Analysis in C++, 3rd Edition

  A comprehensive treatment focusing on the creation of efficient data structures and algorithms, using C++. This text explains how to select or design the data structure best suited to specific problems.

• Data Structures and Algorithm Analysis in Java, 3rd Edition

  A comprehensive treatment focusing on the creation of efficient data structures and algorithms, using Java. This text explains how to select or design the data structure best suited to specific problems.

• Java Structures: Data Structures in Java for the Programmers

  This book attempts to provide a fresh and focused approach to the design and implementation of classic structures in a manner that meshes well with existing Java packages.

• Go Data Structures and Algorithms (Christopher Fox)

  A concise introduction to data structures and algorithms in Go. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections.

• AI Algorithms, Data Structures, and Idioms in Prolog, Lisp, and Java

  Illustrateing how to program AI algorithms in Lisp, Prolog, and Java. Topics include: simple production-like system based on logic, logic-based learning, and natural language parsing.

• Data Structures Succinctly, Part 1 (Robert Horvick)

  This is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. It also features code samples and vivid diagrams to help you visualize the more abstract structures and algorithms.

• Data Structures Succinctly, Part 2 (Robert Horvick)

  This is your 2nd step to a better understanding of the different types of data structures, focus on lists, hash tables, heaps, priority queues, AVL trees, and B-trees. It explains what each structure's methods and classes are, the algorithms behind them, etc.

• Algorithms and Data Structures in VLSI Design

  This book presents broad and in-depth coverage of the entire field of modern VLSI Design with ordered binary decision diagrams (OBDDs), emphasizes its applications in computer aided circuit design.

• Data Structures and Algorithms with OPP Design Patterns in Python

  It promotes object-oriented design using Python and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Data Structures and Algorithms with OPP Design Patterns in Java

  It promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Data Structures and Algorithms with OPP Design Patterns in C++

  This book presents readers with a modern, object-oriented perspective for looking at data structures and algorithms using C++, clearly showing how to use polymorphism and inheritance, and including fragments from working and tested programs.

• Data Structures and Algorithms with OPP Design Patterns in C#

  It promotes object-oriented design using C# and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Data Structures and Algorithms with OPP Design Patterns in Ruby

  It promotes object-oriented design using Ruby and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.