Sequential and Parallel Algorithms and Data Structures The Basic Toolbox /

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Sanders, Peter (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut), Mehlhorn, Kurt (http://id.loc.gov/vocabulary/relators/aut), Dietzfelbinger, Martin (http://id.loc.gov/vocabulary/relators/aut), Dementiev, Roman (http://id.loc.gov/vocabulary/relators/aut)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
Έκδοση:1st ed. 2019.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05134nam a2200565 4500
001 978-3-030-25209-0
003 DE-He213
005 20191022051543.0
007 cr nn 008mamaa
008 190831s2019 gw | s |||| 0|eng d
020 |a 9783030252090  |9 978-3-030-25209-0 
024 7 |a 10.1007/978-3-030-25209-0  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 005.1  |2 23 
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 
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. 
650 0 |a Algorithms. 
650 0 |a Microprocessors. 
650 0 |a Data structures (Computer science). 
650 0 |a Engineering-Data processing. 
650 1 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Processor Architectures.  |0 http://scigraph.springernature.com/things/product-market-codes/I13014 
650 2 4 |a Data Structures and Information Theory.  |0 http://scigraph.springernature.com/things/product-market-codes/I15009 
650 2 4 |a Algorithms.  |0 http://scigraph.springernature.com/things/product-market-codes/M14018 
650 2 4 |a Data Engineering.  |0 http://scigraph.springernature.com/things/product-market-codes/T11040 
650 2 4 |a Mathematics of Algorithmic Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/M13130 
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 
776 0 8 |i Printed edition:  |z 9783030252083 
776 0 8 |i Printed edition:  |z 9783030252106 
776 0 8 |i Printed edition:  |z 9783030252113 
856 4 0 |u https://doi.org/10.1007/978-3-030-25209-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)