Sequential and parallel algorithms and data structures : the basic toolbox /

Sequential and parallel algorithms and data structures : the basic toolbox /

Saved in:
Bibliographic Details
Author / Creator:Sanders, Peter, 1967- author.
Imprint:Cham, Switzerland : Springer, [2019]
Description:1 online resource (xv, 509 pages)
Language:English
Subject:
Algorithms.
Data structures (Computer science)
Computer network architectures.
Algorithms.
Computer network architectures.
Data structures (Computer science)
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11938933
Hidden Bibliographic Details
Other authors / contributors:Mehlhorn, Kurt, 1949- author.
Dietzfelbinger, Martin, author.
Dementiev, Roman, author.
ISBN:9783030252090
3030252094
9783030252083
3030252086
9783030252083
9783030252106
3030252108
9783030252113
3030252116
Digital file characteristics:text file
PDF
Notes:Includes bibliographical references and index.
Online resource; title from PDF title page (SpringerLink, viewed September 16, 2019).
Summary:This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. 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, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.
Other form:Printed edition: 9783030252083
Printed edition: 9783030252106
Printed edition: 9783030252113
Standard no.:10.1007/978-3-030-25209-0
Table of Contents:
  • Appetizer: Integer Arithmetic
  • Introduction
  • Representing Sequences by 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
  • Generic Approaches to Optimization
  • Collective Communication and Computation
  • Load Balancing
  • App. A, Mathematical Background
  • App. B, Computer Architecture Aspects
  • App. C, Support for Parallelism in C++
  • App. D, The Message Passing Interface (MPI)
  • App. E, List of Commercial Products, Trademarks and Licenses.

Similar Items