Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman
ISBN 10: 3030252116 ISBN 13: 9783030252113
Editorial: Springer, 2020
Nuevos
Encuadernación de tapa blanda
Librería:
Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 25 de marzo de 2015
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
In. N° de ref. del artículo ria9783030252113_new
Sinopsis:
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.
Acerca del autor:
Peter Sanders is a professor of computer science at the Karlsruhe Institute of Technology. He is a leading researcher in the area of theoretical and experimental algorithm analysis, in particular related to efficient algorithms for parallel processing and communication in networks. He won the Gottfried Wilhelm Leibniz Prize of the German Research Foundation in 2012.
Kurt Mehlhorn has been a professor of computer science at Saarland University since 1975, and a director of the Max Planck Institute for Informatics in Saarbrücken. He was appointed a Fellow of the ACM (1999) "for important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms." He has coauthored over 250 refereed conference papers and journal articles, in collaboration with 200 researchers. He received the Gottfried Wilhelm Leibniz Prize of the German Research Foundation in 1987 and the Konrad Zuse Medal of the German Society for Informatics in 1995.
Martin Dietzfelbinger is a professor of computer science at the Ilmenau University of Technology. His research interests include complexity theory and algorithms, in particular the design and analysis of randomized data structures and algorithms, hash functions, applications of hashing, sorting, algorithm engineering, and the complexity of parallel and distributed computation.
Roman Dementiev is a senior staff application engineer in the Intel Architecture, Graphics and Software group. He holds a Ph.D. in computer science from Saarland University. His interests include parallel algorithms, compute accelerators and processor architectures, hardware transactional memory, hardware performance and power monitoring, memory hierarchies, software libraries, and scalable software architectures.
The authors have considerable experience teaching on the topic of algorithms and working on related industrial projects.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Sequential and Parallel Algorithms and Data ...
Editorial: Springer
Año de publicación: 2020
Encuadernación: Encuadernación de tapa blanda
Condición: New
Los mejores resultados en AbeBooks
Imagen del vendedor
Sequential and Parallel Algorithms and Data Structures
Publicado por
Springer International Publishing, 2020
ISBN 10: 3030252116
ISBN 13: 9783030252113
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Every computer scientist and every professional programmer should know about the basic algorithmic toolboxAuthors address the paradigm shift towards the parallel algorithms required to solve modern performance-critical applications. Nº de ref. del artículo: 448676717
Comprar nuevo
EUR 42,96
EUR 48,99 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Sequential and Parallel Algorithms and Data Structures | The Basic Toolbox
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Sequential and Parallel Algorithms and Data Structures | The Basic Toolbox | Peter Sanders (u. a.) | Taschenbuch | xv | Englisch | 2020 | Springer | EAN 9783030252113 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 118954487
Comprar nuevo
EUR 44,75
EUR 70,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020011226
Comprar nuevo
EUR 48,09
EUR 3,40 shipping
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Sequential and Parallel Algorithms and Data Structures
Publicado por
Springer International Publishing Sep 2020, 2020
ISBN 10: 3030252116
ISBN 13: 9783030252113
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 528 pp. Englisch. Nº de ref. del artículo: 9783030252113
Comprar nuevo
EUR 48,14
EUR 23,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Sequential and Parallel Algorithms and Data Structures
Publicado por
Springer International Publishing, Springer International Publishing Sep 2020, 2020
ISBN 10: 3030252116
ISBN 13: 9783030252113
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 528 pp. Englisch. Nº de ref. del artículo: 9783030252113
Comprar nuevo
EUR 48,14
EUR 60,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Sequential and Parallel Algorithms and Data Structures : The Basic Toolbox
Publicado por
Springer International Publishing, 2020
ISBN 10: 3030252116
ISBN 13: 9783030252113
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783030252113
Comprar nuevo
EUR 48,14
EUR 63,96 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783030252113
Comprar nuevo
EUR 54,38
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: Más de 20 disponibles