000 04852nam a22006255i 4500
001 978-3-030-25209-0
003 DE-He213
005 20240423125119.0
007 cr nn 008mamaa
008 190831s2019 sz | s |||| 0|eng d
020 _a9783030252090
_9978-3-030-25209-0
024 7 _a10.1007/978-3-030-25209-0
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
100 1 _aSanders, Peter.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aSequential and Parallel Algorithms and Data Structures
_h[electronic resource] :
_bThe Basic Toolbox /
_cby Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXV, 509 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aAppetizer: 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 _aThis 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.
650 0 _aAlgorithms.
650 0 _aMicroprocessors.
650 0 _aComputer architecture.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aEngineering
_xData processing.
650 0 _aMathematics.
650 1 4 _aAlgorithms.
650 2 4 _aProcessor Architectures.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aData Engineering.
650 2 4 _aApplications of Mathematics.
700 1 _aMehlhorn, Kurt.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
700 1 _aDietzfelbinger, Martin.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
700 1 _aDementiev, Roman.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030252083
776 0 8 _iPrinted edition:
_z9783030252106
776 0 8 _iPrinted edition:
_z9783030252113
856 4 0 _uhttps://doi.org/10.1007/978-3-030-25209-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c174387
_d174387