Sequential Parallel Algorithms Data by Sanders Peter (24 results)
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 64.60
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 65.80
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 62.25
US$ 15.85 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 62.25
US$ 15.85 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 60.40
US$ 19.85 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 67.98
US$ 19.85 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 93.97
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. XV, 509 1 Edition NO-PA16APR2015-KAP.
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 94.07
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New.
- Hardcover
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 97.69
US$ 16.54 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 509 pages. 9.75x6.75x1.25 inches. In Stock.
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 63.22
US$ 74.31 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 59.51
US$ 80.33 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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]c…om | Anbieter: preigu.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller3-star sellerCondition: New
US$ 54.63
US$ 9.18 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Hardcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller3-star sellerCondition: New
US$ 54.63
US$ 12.62 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
Language: English
Published by Springer International Publishing Sep 2019 2019
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 56.89
US$ 26.39 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: 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 algo…rithmic 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.
Language: English
Published by Springer International Publishing Sep 2020 2020
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 56.89
US$ 26.39 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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 solvi…ng 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.
- Hardcover
- Print on Demand
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 91.95
US$ 8.60 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 92.88
US$ 8.60 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. XV, 509.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 95.22
US$ 11.42 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. XV, 509.
- Hardcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 96.07
US$ 11.42 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Softcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
US$ 55.83
US$ 56.22 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Kartoniert / Broschiert. Condition: 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 m…odern performance-critical applications.
- Hardcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
US$ 55.83
US$ 56.22 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Gebunden. Condition: 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 performan…ce-critical applications.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 63.22
US$ 68.85 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 a…lgorithmic 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 KG, Sachsenplatz 4-6, 1201 Wien 528 pp. Englisch.
- Hardcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 63.22
US$ 68.85 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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 algorith…mic 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 KG, Sachsenplatz 4-6, 1201 Wien 528 pp. Englisch.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 69.21
US$ 73.39 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt 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 al…gorithmic 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.
