國立虎尾科技大學 |

Sequential and Parallel Algorithms and Data Structures = The Basic Toolbox /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Sequential and Parallel Algorithms and Data Structures/ by Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev.
其他題名:	The Basic Toolbox /
作者:	Sanders, Peter.
其他作者:	Mehlhorn, Kurt.
面頁冊數:	XV, 509 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-25209-0
ISBN:	9783030252090

Sequential and Parallel Algorithms and Data Structures = The Basic Toolbox /
Sanders, Peter.

Sequential and Parallel Algorithms and Data StructuresThe Basic Toolbox /[electronic resource] :by Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev. - 1st ed. 2019. - XV, 509 p.online resource.

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.

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.

ISBN: 9783030252090

Standard No.: 10.1007/978-3-030-25209-0doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Sequential and Parallel Algorithms and Data Structures = The Basic Toolbox /
LDR:03921nam a22003975i 4500 001 1007883
003 DE-He213
005 20200704152438.0
007 cr nn 008mamaa
008 210106s2019 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
035 $a 978-3-030-25209-0
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. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 680373
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. $3 527865
650 0 $a Microprocessors. $3 632481
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Engineering—Data processing. $3 1297966
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Processor Architectures. $3 669787
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Data Engineering. $3 1226308
650 2 4 $a Mathematics of Algorithmic Complexity. $3 1020203
700 1 $a Mehlhorn, Kurt. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 680372
700 1 $a Dietzfelbinger, Martin. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 894779
700 1 $a Dementiev, Roman. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1301684
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
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
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)