Sequential and Parallel Algorithms and Data Structures The Basic Toolbox / by 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 simpl...

Full description

Saved in:
Bibliographic Details
Main Authors: Sanders, Peter (Author), Mehlhorn, Kurt (Author), Dietzfelbinger, Martin (Author), Dementiev, Roman (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2019.
Edition:1st ed. 2019.
Series:Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3257014
003 MWH
005 20191022051543.0
007 cr nn 008mamaa
008 190831s2019 gw | s |||| 0|eng d
020 |a 9783030252090 
024 7 |a 10.1007/978-3-030-25209-0  |2 doi 
035 |a (DE-He213)978-3-030-25209-0 
050 4 |a E-Book 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
100 1 |a Sanders, Peter.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Sequential and Parallel Algorithms and Data Structures  |h [electronic resource] :  |b The Basic Toolbox /  |c by Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev. 
250 |a 1st ed. 2019. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2019. 
300 |a XV, 509 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer eBook Collection 
505 0 |a 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. 
520 |a 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Algorithms. 
650 0 |a Microprocessors. 
650 0 |a Data structures (Computer science). 
650 0 |a Engineering—Data processing. 
690 |a Electronic resources (E-books) 
700 1 |a Mehlhorn, Kurt.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Dietzfelbinger, Martin.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Dementiev, Roman.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-030-25209-0  |3 Click to view e-book  |t 0 
907 |a .b32570144  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21701763  |z 02-26-20 
999 f f |i 0685f279-9282-5d98-8eb2-f6dd7f626e6b  |s 3fb99d86-8bad-5761-90ad-adc61e6e1838  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File