Sequential and Parallel Algorithms and Data Structures, The Basic Toolbox View Full Text


Ontology type: schema:Book     


Book Info

DATE

2019

GENRE

Monograph

AUTHORS

Peter Sanders , Kurt Mehlhorn , Martin Dietzfelbinger , Roman Dementiev

PUBLISHER

Springer Nature

ABSTRACT

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

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-030-25209-0

DOI

http://dx.doi.org/10.1007/978-3-030-25209-0

ISBN

978-3-030-25208-3 | 978-3-030-25209-0

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1120742388


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Karlsruhe Institute of Technology, Karlsruhe, Germany", 
          "id": "http://www.grid.ac/institutes/grid.7892.4", 
          "name": [
            "Karlsruhe Institute of Technology, Karlsruhe, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sanders", 
        "givenName": "Peter", 
        "id": "sg:person.016457635157.18", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016457635157.18"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Max Planck Institute for Informatics, Saarbr\u00fccken, Germany", 
          "id": "http://www.grid.ac/institutes/grid.419528.3", 
          "name": [
            "Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mehlhorn", 
        "givenName": "Kurt", 
        "id": "sg:person.011757371347.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011757371347.43"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Technische Universit\u00e4t Ilmenau, Ilmenau, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6553.5", 
          "name": [
            "Technische Universit\u00e4t Ilmenau, Ilmenau, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dietzfelbinger", 
        "givenName": "Martin", 
        "id": "sg:person.013015656754.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013015656754.30"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Intel Deutschland GmbH, Feldkirchen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.425153.4", 
          "name": [
            "Intel Deutschland GmbH, Feldkirchen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dementiev", 
        "givenName": "Roman", 
        "id": "sg:person.013660341353.85", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013660341353.85"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2019", 
    "datePublishedReg": "2019-01-01", 
    "description": "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.", 
    "genre": "monograph", 
    "id": "sg:pub.10.1007/978-3-030-25209-0", 
    "isAccessibleForFree": false, 
    "isbn": [
      "978-3-030-25208-3", 
      "978-3-030-25209-0"
    ], 
    "keywords": [
      "data structure", 
      "performance-critical applications", 
      "retrieval of data", 
      "teaching of algorithms", 
      "key algorithms", 
      "hash table", 
      "graph traversal", 
      "algorithm engineering", 
      "algorithm library", 
      "collective communication", 
      "parallel algorithm", 
      "basic toolbox", 
      "memory hierarchy", 
      "associative arrays", 
      "parallel processing", 
      "minimum spanning tree", 
      "sequential algorithm", 
      "graph representation", 
      "generic technique", 
      "algorithmic problems", 
      "efficient implementation", 
      "mathematical language", 
      "shortest path", 
      "mathematical treatment", 
      "priority queue", 
      "classical results", 
      "algorithm", 
      "real-life situations", 
      "sorted sequence", 
      "spanning tree", 
      "efficient organization", 
      "important applications", 
      "concise introduction", 
      "implementation notes", 
      "important issue", 
      "most chapters", 
      "simple solution", 
      "language", 
      "informal explanations", 
      "toolbox", 
      "paradigm shift", 
      "problem", 
      "traversal", 
      "retrieval", 
      "Java", 
      "theorem", 
      "programming", 
      "issues", 
      "applications", 
      "graph", 
      "computation", 
      "forefront of research", 
      "basic structure", 
      "queue", 
      "implementation", 
      "communication", 
      "related titles", 
      "optimization", 
      "processing", 
      "representation", 
      "theory", 
      "library", 
      "hierarchy", 
      "engineering", 
      "structure", 
      "path", 
      "modeling", 
      "solution", 
      "table", 
      "proof", 
      "trees", 
      "simplicity", 
      "array", 
      "technique", 
      "efficiency", 
      "selection", 
      "example", 
      "same basic structure", 
      "list", 
      "chapter", 
      "situation", 
      "organization", 
      "account", 
      "data", 
      "authors", 
      "approach", 
      "sorting", 
      "research", 
      "readers", 
      "note", 
      "hand", 
      "load", 
      "book", 
      "sequence", 
      "forefront", 
      "results", 
      "teaching", 
      "picture", 
      "title", 
      "professionals", 
      "introduction", 
      "textbooks", 
      "practice", 
      "individual chapters", 
      "students", 
      "explanation", 
      "shift", 
      "balance", 
      "understanding", 
      "exercise", 
      "treatment"
    ], 
    "name": "Sequential and Parallel Algorithms and Data Structures, The Basic Toolbox", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1120742388"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-25209-0"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-25209-0", 
      "https://app.dimensions.ai/details/publication/pub.1120742388"
    ], 
    "sdDataset": "books", 
    "sdDatePublished": "2022-09-02T16:09", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/book/book_22.jsonl", 
    "type": "Book", 
    "url": "https://doi.org/10.1007/978-3-030-25209-0"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-25209-0'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-25209-0'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-25209-0'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-25209-0'


 

This table displays all metadata directly associated to this object as RDF triples.

190 TRIPLES      20 PREDICATES      135 URIs      128 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-030-25209-0 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N8a0c33c165cd4bd48744c03cf01f326a
4 schema:datePublished 2019
5 schema:datePublishedReg 2019-01-01
6 schema:description 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.
7 schema:genre monograph
8 schema:isAccessibleForFree false
9 schema:isbn 978-3-030-25208-3
10 978-3-030-25209-0
11 schema:keywords Java
12 account
13 algorithm
14 algorithm engineering
15 algorithm library
16 algorithmic problems
17 applications
18 approach
19 array
20 associative arrays
21 authors
22 balance
23 basic structure
24 basic toolbox
25 book
26 chapter
27 classical results
28 collective communication
29 communication
30 computation
31 concise introduction
32 data
33 data structure
34 efficiency
35 efficient implementation
36 efficient organization
37 engineering
38 example
39 exercise
40 explanation
41 forefront
42 forefront of research
43 generic technique
44 graph
45 graph representation
46 graph traversal
47 hand
48 hash table
49 hierarchy
50 implementation
51 implementation notes
52 important applications
53 important issue
54 individual chapters
55 informal explanations
56 introduction
57 issues
58 key algorithms
59 language
60 library
61 list
62 load
63 mathematical language
64 mathematical treatment
65 memory hierarchy
66 minimum spanning tree
67 modeling
68 most chapters
69 note
70 optimization
71 organization
72 paradigm shift
73 parallel algorithm
74 parallel processing
75 path
76 performance-critical applications
77 picture
78 practice
79 priority queue
80 problem
81 processing
82 professionals
83 programming
84 proof
85 queue
86 readers
87 real-life situations
88 related titles
89 representation
90 research
91 results
92 retrieval
93 retrieval of data
94 same basic structure
95 selection
96 sequence
97 sequential algorithm
98 shift
99 shortest path
100 simple solution
101 simplicity
102 situation
103 solution
104 sorted sequence
105 sorting
106 spanning tree
107 structure
108 students
109 table
110 teaching
111 teaching of algorithms
112 technique
113 textbooks
114 theorem
115 theory
116 title
117 toolbox
118 traversal
119 treatment
120 trees
121 understanding
122 schema:name Sequential and Parallel Algorithms and Data Structures, The Basic Toolbox
123 schema:productId N153919177ffb41cd95b6f7111a72f739
124 N98c7e58d2609470aa1ead2a255ae986f
125 schema:publisher Nf5e8988ebbeb4d47a6b5519bd69dad72
126 schema:sameAs https://app.dimensions.ai/details/publication/pub.1120742388
127 https://doi.org/10.1007/978-3-030-25209-0
128 schema:sdDatePublished 2022-09-02T16:09
129 schema:sdLicense https://scigraph.springernature.com/explorer/license/
130 schema:sdPublisher N256fcca9682d4580a6b65f07ed519a22
131 schema:url https://doi.org/10.1007/978-3-030-25209-0
132 sgo:license sg:explorer/license/
133 sgo:sdDataset books
134 rdf:type schema:Book
135 N153919177ffb41cd95b6f7111a72f739 schema:name doi
136 schema:value 10.1007/978-3-030-25209-0
137 rdf:type schema:PropertyValue
138 N256fcca9682d4580a6b65f07ed519a22 schema:name Springer Nature - SN SciGraph project
139 rdf:type schema:Organization
140 N4ad6103e20ae47189cd9fa5e3cabbd95 rdf:first sg:person.013015656754.30
141 rdf:rest N4f7886805c2c4082962ee89d8c9d96f5
142 N4f7886805c2c4082962ee89d8c9d96f5 rdf:first sg:person.013660341353.85
143 rdf:rest rdf:nil
144 N8a0c33c165cd4bd48744c03cf01f326a rdf:first sg:person.016457635157.18
145 rdf:rest Nc2c45321a3f64d069c0de53478bbc518
146 N98c7e58d2609470aa1ead2a255ae986f schema:name dimensions_id
147 schema:value pub.1120742388
148 rdf:type schema:PropertyValue
149 Nc2c45321a3f64d069c0de53478bbc518 rdf:first sg:person.011757371347.43
150 rdf:rest N4ad6103e20ae47189cd9fa5e3cabbd95
151 Nf5e8988ebbeb4d47a6b5519bd69dad72 schema:name Springer Nature
152 rdf:type schema:Organisation
153 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
154 schema:name Information and Computing Sciences
155 rdf:type schema:DefinedTerm
156 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
157 schema:name Computation Theory and Mathematics
158 rdf:type schema:DefinedTerm
159 sg:person.011757371347.43 schema:affiliation grid-institutes:grid.419528.3
160 schema:familyName Mehlhorn
161 schema:givenName Kurt
162 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011757371347.43
163 rdf:type schema:Person
164 sg:person.013015656754.30 schema:affiliation grid-institutes:grid.6553.5
165 schema:familyName Dietzfelbinger
166 schema:givenName Martin
167 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013015656754.30
168 rdf:type schema:Person
169 sg:person.013660341353.85 schema:affiliation grid-institutes:grid.425153.4
170 schema:familyName Dementiev
171 schema:givenName Roman
172 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013660341353.85
173 rdf:type schema:Person
174 sg:person.016457635157.18 schema:affiliation grid-institutes:grid.7892.4
175 schema:familyName Sanders
176 schema:givenName Peter
177 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016457635157.18
178 rdf:type schema:Person
179 grid-institutes:grid.419528.3 schema:alternateName Max Planck Institute for Informatics, Saarbrücken, Germany
180 schema:name Max Planck Institute for Informatics, Saarbrücken, Germany
181 rdf:type schema:Organization
182 grid-institutes:grid.425153.4 schema:alternateName Intel Deutschland GmbH, Feldkirchen, Germany
183 schema:name Intel Deutschland GmbH, Feldkirchen, Germany
184 rdf:type schema:Organization
185 grid-institutes:grid.6553.5 schema:alternateName Technische Universität Ilmenau, Ilmenau, Germany
186 schema:name Technische Universität Ilmenau, Ilmenau, Germany
187 rdf:type schema:Organization
188 grid-institutes:grid.7892.4 schema:alternateName Karlsruhe Institute of Technology, Karlsruhe, Germany
189 schema:name Karlsruhe Institute of Technology, Karlsruhe, Germany
190 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...