Sequential and Parallel Algorithms and Data Structures : The Basic Toolbox - neues Buch

EAN (ISBN-13): 9783030252090
Erscheinungsjahr: 2019
Herausgeber: Springer International Publishing

Buch in der Datenbank seit 2019-08-26T15:05:24+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-12-13T12:07:37+01:00 (Berlin)
ISBN/EAN: 9783030252090

ISBN - alternative Schreibweisen:
978-3-030-25209-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: dietzfelbinger, kurt martin, kurt marti, pete sanders, mehlhorn, peter sanders

---

Daten vom Verlag:

Autor/in: Peter Sanders; Kurt Mehlhorn; Martin Dietzfelbinger; Roman Dementiev
Titel: Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox
Verlag: Springer; Springer International Publishing
509 Seiten
Erscheinungsjahr: 2019-08-31
Cham; CH
Sprache: Englisch
48,14 € (DE)
49,50 € (AT)
53,50 CHF (CH)
Available
XV, 509 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Algorithmics; Algorithms; Sequences; Arrays; Data Structures; Linked Lists; Hash Tables; Sorting; Queues; Graphs; Trees; Optimization; Load Balancing; C++; Java; Big Data; Parallel Computing; High-Performance Computing; Parallel Processsing; Parallelism; algorithm analysis and problem complexity; B; Algorithms; Processor Architectures; Data Structures and Information Theory; Data Engineering; Applications of Mathematics; Computer Science; Rechnerarchitektur und Logik-Entwurf; Informationstheorie; Datenbanken; Angewandte Mathematik; BB

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.

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.

“The style of the book is accessible and is suitable for a wide range of audiences, from mathematicians and computer scientists to researchers from other fields who would like to use parallelised approaches in their research.” (Irina Ioana Mohorianu, zbMATH 1445.68003, 2020)

is a senior staff application engineer in the Intel Architecture, Graphics and Software group. He holds a Ph.D. in computer science from Saarland University. His interests include parallel algorithms, compute accelerators and processor architectures, hardware transactional memory, hardware performance and power monitoring, memory hierarchies, software libraries, and scalable software architectures.

Peter Sanders Kurt Mehlhorn Martin Dietzfelbinger  Roman Dementiev

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.

 

Every computer scientist and every professional programmer should know about the basic algorithmic toolbox Authors address the paradigm shift towards the parallel algorithms required to solve modern performance-critical applications Addressed to students and professionals familiar with programming and basic mathematical language Includes many examples, pictures, informal explanations, exercises, and implementation notes with efficient implementations in languages such as C++ and Java Authors have extensive experience teaching these subjects to undergraduate and graduate students