| Description |
x, 406 pages : illustrations (chiefly color) ; 25 cm |
| Contents |
Part I: Searching and sorting. -- Overview / Martin Dietzfelbinger and Christian Schneideler -- Binary search / Thomas Seidl and Jost Enderle -- Insertion sort / Wolfgang P. Kowalk -- Fast sorting algorithms / Helmet Alt -- Parallel sorting -- the need for speed / Rolf Wanka -- Topological sorting -- how should I begin to complete my to do list? / Hagen Höpfner -- Searching texts -- but fast! The Boyer-Moore-Horspool Algorithm / Markus E. Nebel -- Depth-first search (Ariadne & Co.) / Michael Dom, Falk Hüffner, and Rolf Niedermeier -- Pledge's Algorithm / Rolf Klein and Tom Kamphans -- Cycles in graphs / Holger Schlingloff -- PageRank -- what is really relevant in the world-wide web? / Ulrik Brandes and Gabi Dorfmüller -- Part II Arithmetic and encryption. -- Overview / Berthold Vöcking -- Multiplication of long integers -- faster than long multiplication / Arno Eigenwillig and Kurt Mehlhorn -- The Euclidean Algorithm / Friedrich Eisenbrand -- The Sieve of Eratosthenes -- how fast can we compute a prime number table? / Rolf Möhring and Martin Oellrich -- One-way functions. Mind the trap -- escape only for the initiated / Rüdiger Reischuk and Markus Hinkelmann -- The one-time pad algorithm -- the simplest and most secure way to keep secrets / Till Tantau -- Public-key cryptography / Dirk Bongartz and Walter Unger -- How to share a secret / Johannes Blömer -- Playing poker by email / Detlef Sieling -- Fingerprinting / Martin Dietzfelbinger -- Hashing / Christian Schindlehauer -- Codes -- protecting data against errors and loss / Michael Mitzenmacher -- Part III: Planning, coordination and simulation. -- Overview / Helmut Alt and Rüdiger Reischuk -- Broadcasting -- how can I quickly disseminate information? Christian Scheideler -- Converting numbers into English words / Lothar Schmitz -- Majority -- who gets elected class rep? / Thomas Erlebach -- Random numbers -- how fast can we create randomness in computers? / Bruno Müller-Clostermann and Tim Jonischkat -- Winning strategies for a matchstick game / Jochen Könenmann -- Scheduling of tournaments or sports leagues / Sigrid Knust -- Eulerian Circuits / Michael Behrisch, Amin Coja-Oghlan, and Peter Liske -- High-speed circles / Dominik Sibbing and Leif Kobbelt -- Gauß-Seidel Iterative Method for computation of physical problems / Christoph Freundl and Ulrich Rüde -- Dynamic programming -- evolutionary distance / Norbert Blum and Matthias Kretschmer -- Part IV: Optimization. -- Overview / Heribert Vollmer and Dorothea Wagner -- Shortest paths / Peter Sanders and Johannes Singler -- Minimum spanning trees (sometimes greed pays off ...) / Katharina Skutella and Martin Skutella -- Maximum flows -- towards the stadium during rush hour / Robert Görke, Steffen Mecke, and Dorothea Wagner -- Marriage broker / Volker Claus, Volker Diekert, and Holger Peterson -- The smallest enclosing circle -- a contribution to democracy from Switzerland / Emo Welzl -- Online algorithms -- what is it worth to know the future? / Susanne Albers and Swen Schmelzer -- Bin packing or "how do I get my stuff into the boxes?" / Joachim Gehweiler and Friedhelm Meyer auf der Heide -- The knapsack problem / Rene Beier and Berthold Vöcking -- The travelling salesman problem / Stefan Näher -- Simulated annealing / Peter Rossmanith |
| Summary |
"Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas--they facilitate new applications in science, medicine, production, logistics, traffic, communication and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs -- for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity -- the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults."--Back cover |
| Bibliography |
Includes bibliographical references |
| Notes |
Translated from the German |
|
Print version record |
| Subject |
Algorithms.
|
|
Computer algorithms.
|
|
Computer science -- Mathematics.
|
|
Problem solving.
|
| Author |
Vöcking, Berthold.
|
| LC no. |
2014412779 |
| ISBN |
3642153275 |
|
3662506009 |
|
9783642153273 |
|
9783662506004 |
|
