Sequential and parallel algorithms and data structures: the basic toolbox
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham, Switzerland
Springer
[2019]
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | xv, 509 Seiten Illustrationen |
| ISBN: | 9783030252113 9783030252083 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV046150258 | ||
| 003 | DE-604 | ||
| 005 | 20240109 | ||
| 007 | t | ||
| 008 | 190906s2019 a||| |||| 00||| eng d | ||
| 020 | |a 9783030252113 |9 978-3-030-25211-3 | ||
| 020 | |a 9783030252083 |9 978-3-030-25208-3 | ||
| 035 | |a (OCoLC)1119032340 | ||
| 035 | |a (DE-599)BVBBV046150258 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-11 |a DE-739 |a DE-1043 |a DE-355 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 68P05 |2 msc | ||
| 084 | |a 68Wxx |2 msc | ||
| 100 | 1 | |a Sanders, Peter |d 1967- |e Verfasser |0 (DE-588)136120113 |4 aut | |
| 245 | 1 | 0 | |a Sequential and parallel algorithms and data structures |b the basic toolbox |c Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev |
| 264 | 1 | |a Cham, Switzerland |b Springer |c [2019] | |
| 264 | 4 | |c © 2019 | |
| 300 | |a xv, 509 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Processor Architectures | |
| 650 | 4 | |a Data Structures and Information Theory | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Data Engineering | |
| 650 | 4 | |a Mathematics of Algorithmic Complexity | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Data structures (Computer scienc | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Engineering—Data processing | |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Mehlhorn, Kurt |d 1949- |e Verfasser |0 (DE-588)139294201 |4 aut | |
| 700 | 1 | |a Dietzfelbinger, Martin |d 1956- |e Verfasser |0 (DE-588)130020761 |4 aut | |
| 700 | 1 | |a Dementiev, Roman |d 1979- |e Verfasser |0 (DE-588)124503829 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-030-25209-0 |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031530412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031530412 | ||
Datensatz im Suchindex
| _version_ | 1804180492353798144 |
|---|---|
| adam_text | Contents 1 Appetizer: Integer Arithmetic................................................................ 1.1 Addition.......................................................................................... 1.2 Multiplication: The School Method.............................................. 1.3 Result Checking............................................................................. 1.4 A Recursive Version of the SchoolMethod..................................... 1.5 Karatsuba Multiplication................................................................ 1.6 Parallel Multiplication.................................................................... 1.7 Algorithm Engineering.................................................................... 1.8 The Programs ................................................................................. 1.9 Proofs of Lemma 1.7 and Theorem 1.9 ......................................... 1.10 Implementation Notes..................................................................... 1.11 Historical Notes and Further Findings........................................... 1 2 6 10 11 13 15 17 18 21 23 23 2 Introduction.............................................................................................. 2.1 Asymptotic Notation....................................................................... 2.2 The Sequential Machine Model...................................................... 2.3 Pseudocode.................................................................................... 2.4 Parallel Machine
Models................................................................ 2.5 Parallel Pseudocode....................................................................... 2.6 Designing Correct Algorithms andPrograms ................................. 2.7 An Example ֊ Binary Search.......................................................... 2.8 Basic Algorithm Analysis .............................................................. 2.9 Average-Case Analysis................................................................... 2.10 Parallel-Algorithm Analysis .......................................................... 2.11 Randomized Algorithms.................................................................. 2.12 Graphs............................................................................................ 2.13 P and NP........................................................................................ 2.14 Implementation Notes..................................................................... 2.15 Historical Notes and Further Findings........................................... 25 26 29 32 38 44 46 49 52 57 62 63 68 73 77 79
xii Contents 3 Representing Sequences by Arrays and Linked Lists............................ 3.1 Processing Arrays in Parallel.............................................................. 3.2 Linked Lists.......................................................................................... 3.3 Processing Linked Lists in Parallel.................................................... 3.4 Unbounded Arrays.............................................................................. 3.5 * Amortized Analysis .......................................................................... 3.6 Stacks and Queues .............................................................................. 3.7 Parallel Queue-Like Data Structures.................................................. 3.8 Lists versus Arrays.............................................................................. 3.9 Implementation Notes.......................................................................... 3.10 Historical Notes and Further Findings.............................................. 81 82 86 91 97 102 106 109 113 114 116 4 Hash Tables and Associative Arrays.......................................................... 4.1 Hashing with Chaining........................................................................ 4.2 Universal Hashing................................................................................ 4.3 Hashing with Linear Probing.............................................................. 4.4 Chaining versus Linear Probing ........................................................ 4.5 *Perfect
Hashing.................................................................................. 4.6 Parallel Hashing.................................................................................. 4.7 Implementation Notes.......................................................................... 4.8 Historical Notes and Further Findings.............................................. 117 120 122 128 130 131 134 147 149 5 Sorting and Selection.................................................................................... 5.1 Simple Sorters...................................................................................... 5.2 Simple, Fast, and Inefficient Parallel Sorting.................................... 5.3 Mergesort- an 0(иlogn) Sorting Algorithm .................................. 5.4 Parallel Mergesort................................................................................ 5.5 A Lower Bound.................................................................................... 5.6 Quicksort.............................................................................................. 5.7 Parallel Quicksort................................................................................ 5.8 Selection................................................................................................ 5.9 Parallel Selection.................................................................................. 5.10 Breaking the Lower Bound................................................................ 5.11 *Parallel Bucket Sort and Radix
Sort................................................ 5.12 *External Sorting ................................................................................ 5.13 Parallel Sample Sort with Implementations...................................... 5.14 * Parallel Multiway Mergesort............................................................ 5.15 Parallel Sorting with Logarithmic Latency........................................ 5.16 Implementation Notes.......................................................................... 5.17 Historical Notes and Further Findings.............................................. 153 156 158 160 162 165 168 173 178 180 182 186 187 191 201 205 207 208
Contents xiii 6 Priority Queues.................................... 6.1 Binary Heaps........................................................................................ 6.2 Addressable Priority Queues.............................................................. 6.3 *External Memory.............................................................................. 6.4 Parallel Priority Queues...................................................................... 6.5 Implementation Notes.......................................................................... 6.6 Historical Notes and Further Findings.............................................. 211 213 218 224 226 229 230 7 Sorted Sequences .......................................................................................... 7.1 Binary Search Trees........................................................................... 7.2 (a, fe)-Trees and Red-Black Trees...................................................... 7.3 More Operations .................................................................................. 7.4 Amortized Analysis of Update Operations........................................ 7.5 Augmented Search Trees.................................................................... 7.6 Parallel Sorted Sequences .................................................................. 7.7 Implementation Notes.......................................................................... 7.8 Historical Notes and Further Findings.............................................. 233 235 238 245 248 250 252 254 256 8 Graph
Representation.................................................................................. 8.1 Unordered Edge Sequences................................................................ 8.2 Adjacency Arrays - Static Graphs .................................................... 8.3 Adjacency Lists - Dynamic Graphs.................................................. 8.4 The Adjacency Matrix Representation.............................................. 8.5 Implicit Representations...................................................................... 8.6 Parallel Graph Representation............................................................ 8.7 Implementation Notes.......................................................................... 8.8 Historical Notes and Further Findings.............................................. 259 260 261 261 263 264 265 267 268 9 Graph Traversal............................................................................................ 9.1 Breadth-First Search............................................................................ 9.2 Parallel Breadth-First Search.............................................................. 9.3 Depth-First Search.............................................................................. 9.4 Parallel Traversal of DAGs.................................................................. 9.5 Implementation Notes.......................................................................... 9.6 Historical Notes and Further Findings.............................................. 271 272 274 282 294 298 299 10 Shortest
Paths............................................................................................... 10.1 From Basic Concepts to a Generic Algorithm................................. 10.2 Directed Acyclic Graphs.................................................................... 10.3 Nonnegative Edge Costs (Dijkstra’s Algorithm).............................. 10.4 *Average-Case Analysis of Dijkstra’s Algorithm............................ 10.5 Monotone Integer Priority Queues.................................................... 10.6 Arbitrary Edge Costs (Bellman-Ford Algorithm)............................ 10.7 All-Pairs Shortest Paths and Node Potentials.................................... 10.8 Shortest-Path Queries.......................................................................... 301 302 306 307 311 313 318 320 322
xiv Contents 10.9 Parallel Shortest Paths .................................................................... 328 10.10 Implementation Notes...................................................................... 330 10.11 Historical Notes and Further Findings........................................... 331 11 Minimum Spanning Trees........................................................................ 11.1 Cut and Cycle Properties................................................................ 11.2 The Jarnik-Prim Algorithm............................................................ 11.3 Kruskal’s Algorithm........................................................................ 11.4 The Union-Find Data Structure....................................................... 11.5 *External Memory ......................................................................... 11.6 *Parallel Algorithms........................................................................ 11.7 Applications..................................................................................... 11.8 Implementation Notes...................................................................... 11.9 Historical Notes and Further Findings........................................... 333 334 337 338 340 344 348 351 353 354 12 Generic Approaches to Optimization..................................................... 12.1 Linear Programming - Use a Black-BoxSolver............................. 12.2 Greedy Algorithms - Never Look Back.......................................... 12.3 Dynamic Programming - Build It Piece by
Piece.......................... 12.4 Systematic Search - When in Doubt, Use Brute Force................... 12.5 Local Search - Think Globally, Act Locally.................................. 12.6 Evolutionary Algorithms................................................................ 12.7 Implementation Notes...................................................................... 12.8 Historical Notes and Further Findings........................................... 357 359 365 368 373 379 389 391 392 13 Collective Communication and Computation........................................ 13.1 Broadcast......................................................................................... 13.2 Reduction........................................................................................ 13.3 Prefix Sums..................................................................................... 13.4 Synchronization............................................................................... 13.5 (All)-Gather/Scatter....................................................................... 13.6 All-to-All Message Exchange......................................................... 13.7 Asynchronous Collective Communication...................................... 393 396 402 404 406 412 413 418 14 Load Balancing......................................................................................... 14.1 Overview and Basic Assumptions................................................... 14.2 Prefix Sums - Independent Tasks with Known Size....................... 14.3 The Master-Worker
Scheme.......................................................... 14.4 (Randomized) Static Load Balancing............................................. 14.5 Work Stealing................................................................................. 14.6 Handling Dependencies.................................................................. 419 420 422 424 426 427 433
Contents XV A Mathematical Background........................................................................... A. 1 Mathematical Symbols........................................................................ A.2 Mathematical Concepts....................................................................... A.3 Basic Probability Theory.................................................................. A.4 Useful Formulae.................................................................................. 435 435 436 438 443 В Computer Architecture Aspects................................................................... B. 1 Cores and Hardware Threads.............................................................. B.2 The Memory Hierarchy...................................................................... B.3 Cache Coherence Protocols................................................................ B.4 Atomic Operations.............................................................................. B.5 Hardware Transactional Memory...................................................... B.6 Memory Management.......................................................................... B.7 The Interconnection Network............................................................ B.8 CPU Performance Analysis................................................................ B.9 Compiler.............................................................................................. 447 447 448 449 451 451 451 452 453 454 C Support for Parallelism in
C++.................................................................. C. 1 “Hello World” C++11 Program with Threads................................... C.2 Locks.................................................................................................... C.3 Asynchronous Operations.................................................................. C.4 Atomic Operations.............................................................................. C.5 Useful Tools.......................................................................................... C.6 Memory Management.......................................................................... C.7 Thread Scheduling.............................................................................. 455 455 456 457 457 458 458 459 D The Message Passing Interface (MPI) ....................................................... D. 1 “Hello World” and What Is an MPI Program?................................... D.2 Point-to-Point Communication.......................................................... D.3 Collective Communication.................................................................. 461 461 463 464 E List of Commercial Products, TVademarks and Software Licenses ... 465 E. 1 BSD З-Clause License........................................................................ 465 References................................................................................................................ 467 Index 487
|
| any_adam_object | 1 |
| author | Sanders, Peter 1967- Mehlhorn, Kurt 1949- Dietzfelbinger, Martin 1956- Dementiev, Roman 1979- |
| author_GND | (DE-588)136120113 (DE-588)139294201 (DE-588)130020761 (DE-588)124503829 |
| author_facet | Sanders, Peter 1967- Mehlhorn, Kurt 1949- Dietzfelbinger, Martin 1956- Dementiev, Roman 1979- |
| author_role | aut aut aut aut |
| author_sort | Sanders, Peter 1967- |
| author_variant | p s ps k m km m d md r d rd |
| building | Verbundindex |
| bvnumber | BV046150258 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)1119032340 (DE-599)BVBBV046150258 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02348nam a2200577 c 4500</leader><controlfield tag="001">BV046150258</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240109 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">190906s2019 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030252113</subfield><subfield code="9">978-3-030-25211-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030252083</subfield><subfield code="9">978-3-030-25208-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1119032340</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046150258</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-1043</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68P05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Wxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sanders, Peter</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)136120113</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sequential and parallel algorithms and data structures</subfield><subfield code="b">the basic toolbox</subfield><subfield code="c">Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham, Switzerland</subfield><subfield code="b">Springer</subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xv, 509 Seiten</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Processor Architectures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Algorithmic Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer scienc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering—Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mehlhorn, Kurt</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139294201</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dietzfelbinger, Martin</subfield><subfield code="d">1956-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)130020761</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dementiev, Roman</subfield><subfield code="d">1979-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124503829</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-030-25209-0</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031530412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031530412</subfield></datafield></record></collection> |
| id | DE-604.BV046150258 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:36:37Z |
| institution | BVB |
| isbn | 9783030252113 9783030252083 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031530412 |
| oclc_num | 1119032340 |
| open_access_boolean | |
| owner | DE-83 DE-11 DE-739 DE-1043 DE-355 DE-BY-UBR |
| owner_facet | DE-83 DE-11 DE-739 DE-1043 DE-355 DE-BY-UBR |
| physical | xv, 509 Seiten Illustrationen |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Springer |
| record_format | marc |
| spelling | Sanders, Peter 1967- Verfasser (DE-588)136120113 aut Sequential and parallel algorithms and data structures the basic toolbox Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev Cham, Switzerland Springer [2019] © 2019 xv, 509 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Algorithm Analysis and Problem Complexity Processor Architectures Data Structures and Information Theory Algorithms Data Engineering Mathematics of Algorithmic Complexity Computer software Computer science Data structures (Computer scienc Engineering—Data processing Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Informatik (DE-588)4026894-9 s DE-604 Mehlhorn, Kurt 1949- Verfasser (DE-588)139294201 aut Dietzfelbinger, Martin 1956- Verfasser (DE-588)130020761 aut Dementiev, Roman 1979- Verfasser (DE-588)124503829 aut Erscheint auch als Online-Ausgabe 978-3-030-25209-0 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031530412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sanders, Peter 1967- Mehlhorn, Kurt 1949- Dietzfelbinger, Martin 1956- Dementiev, Roman 1979- Sequential and parallel algorithms and data structures the basic toolbox Algorithm Analysis and Problem Complexity Processor Architectures Data Structures and Information Theory Algorithms Data Engineering Mathematics of Algorithmic Complexity Computer software Computer science Data structures (Computer scienc Engineering—Data processing Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4026894-9 (DE-588)4001183-5 |
| title | Sequential and parallel algorithms and data structures the basic toolbox |
| title_auth | Sequential and parallel algorithms and data structures the basic toolbox |
| title_exact_search | Sequential and parallel algorithms and data structures the basic toolbox |
| title_full | Sequential and parallel algorithms and data structures the basic toolbox Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev |
| title_fullStr | Sequential and parallel algorithms and data structures the basic toolbox Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev |
| title_full_unstemmed | Sequential and parallel algorithms and data structures the basic toolbox Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev |
| title_short | Sequential and parallel algorithms and data structures |
| title_sort | sequential and parallel algorithms and data structures the basic toolbox |
| title_sub | the basic toolbox |
| topic | Algorithm Analysis and Problem Complexity Processor Architectures Data Structures and Information Theory Algorithms Data Engineering Mathematics of Algorithmic Complexity Computer software Computer science Data structures (Computer scienc Engineering—Data processing Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithm Analysis and Problem Complexity Processor Architectures Data Structures and Information Theory Algorithms Data Engineering Mathematics of Algorithmic Complexity Computer software Computer science Data structures (Computer scienc Engineering—Data processing Informatik Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031530412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sanderspeter sequentialandparallelalgorithmsanddatastructuresthebasictoolbox AT mehlhornkurt sequentialandparallelalgorithmsanddatastructuresthebasictoolbox AT dietzfelbingermartin sequentialandparallelalgorithmsanddatastructuresthebasictoolbox AT dementievroman sequentialandparallelalgorithmsanddatastructuresthebasictoolbox |