Algorithms Unplugged

  • Berthold Vöcking
  • Helmut Alt
  • Martin Dietzfelbinger
  • Rüdiger Reischuk
  • Christian Scheideler
  • Heribert Vollmer
  • Dorothea Wagner

Table of contents

  1. Front Matter
    Pages I-X
  2. Searching and Sorting

    1. Front Matter
      Pages 1-4
    2. Thomas Seidl, Jost Enderle
      Pages 5-11
    3. Wolfgang P. Kowalk
      Pages 13-16
    4. Helmut Alt
      Pages 17-25
    5. Rolf Wanka
      Pages 27-37
    6. Michael Dom, Falk Hüffner, Rolf Niedermeier
      Pages 57-68
    7. Rolf Klein, Tom Kamphans
      Pages 69-75
    8. Holger Schlingloff
      Pages 77-88
    9. Ulrik Brandes, Gabi Dorfmüller
      Pages 89-96
  3. Arithmetic and Encryption

    1. Front Matter
      Pages 97-100
    2. Arno Eigenwillig, Kurt Mehlhorn
      Pages 101-109
    3. Friedrich Eisenbrand
      Pages 111-117
    4. Rolf H. Möhring, Martin Oellrich
      Pages 119-130
    5. Rüdiger Reischuk, Markus Hinkelmann
      Pages 131-139
    6. Dirk Bongartz, Walter Unger
      Pages 147-158
    7. Johannes Blömer
      Pages 159-168
    8. Detlef Sieling
      Pages 169-180
    9. Martin Dietzfelbinger
      Pages 181-193
    10. Christian Schindelhauer
      Pages 195-201
    11. Michael Mitzenmacher
      Pages 203-217
  4. Planning, Coordination and Simulation

    1. Front Matter
      Pages 219-222
    2. Lothar Schmitz
      Pages 231-237
    3. Thomas Erlebach
      Pages 239-247
    4. Bruno Müller-Clostermann, Tim Jonischkat
      Pages 249-258
    5. Jochen Könemann
      Pages 259-265
    6. Sigrid Knust
      Pages 267-275
    7. Michael Behrisch, Amin Coja-Oghlan, Peter Liske
      Pages 277-283
    8. Dominik Sibbing, Leif Kobbelt
      Pages 285-293
    9. Christoph Freundl, Ulrich Rüde
      Pages 295-304
    10. Norbert Blum, Matthias Kretschmer
      Pages 305-311
  5. Optimization

    1. Front Matter
      Pages 313-316
    2. Peter Sanders, Johannes Singler
      Pages 317-324
    3. Katharina Skutella, Martin Skutella
      Pages 325-331
    4. Robert Görke, Steffen Mecke, Dorothea Wagner
      Pages 333-344
    5. Volker Claus, Volker Diekert, Holger Petersen
      Pages 345-355
    6. Susanne Albers, Swen Schmelzer
      Pages 361-366
    7. Joachim Gehweiler, Friedhelm Meyer auf der Heide
      Pages 367-374
    8. Rene Beier, Berthold Vöcking
      Pages 375-381
    9. Stefan Näher
      Pages 383-391
    10. Peter Rossmanith
      Pages 393-400
  6. Back Matter
    Pages 401-406

About this book


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, communi¬cation 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.


Algorithms Arithmetic Bin packing Broadcasting Codes Computer simulations Cryptography Cycles Encoding Encryption Fingerprinting Games Graphs Hashing Knapsack Problem Multiplication Online algorithms Optimizing Paths Prime numbers Random numbers Searching Secrets Simulated annealing Sorting Travelling Salesman Problem Trees

Editors and affiliations

  • Berthold Vöcking
    • 1
  • Helmut Alt
    • 2
  • Martin Dietzfelbinger
    • 3
  • Rüdiger Reischuk
    • 4
  • Christian Scheideler
    • 5
  • Heribert Vollmer
    • 6
  • Dorothea Wagner
    • 7
  1. 1.Lehrstuhl für Informatik I, Algorithmen und KomplexitätRWTH AachenAachenGermany
  2. 2.Institut für InformatikFreie Universität BerlinBerlinGermany
  3. 3.Institut für Theoretische Informatik, Fakultät für InformatikTechnische Universität IlmenauIlmenauGermany
  4. 4.Institut für Theoretische InformatikUniversität zu LübeckLübeckGermany
  5. 5.Institut für InformatikUniversität PaderbornPaderbornGermany
  6. 6.Institut für Theoretische InformatikLeibniz Universität HannoverHannoverGermany
  7. 7.Institut für Theoretische InformatikKarlsruhe Institute of Technology (KIT)KarlsruheGermany

Bibliographic information