Algorithms Unplugged 2011

Part 1 / Searching and Sorting

• Thomas Seidl, Jost Enderle:
  Binary Search. 5-11
  
• Wolfgang P. Kowalk:
  Insertion Sort. 13-16
  
• Helmut Alt:
  Fast Sorting Algorithms. 17-25
  
• Rolf Wanka:
  Parallel Sorting - The Need for Speed. 27-37
  
• Hagen Höpfner:
  Topological Sorting - How Should I Begin to Complete My To Do List? 39-45
  
• Markus E. Nebel:
  Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm. 47-56
  
• Michael Dom, Falk Hüffner, Rolf Niedermeier:
  Depth-First Search (Ariadne & Co.). 57-68
  
• Rolf Klein, Tom Kamphans:
  Pledge's Algorithm - How to Escape from a Dark Maze. 69-75
  
• Holger Schlingloff:
  Cycles in Graphs. 77-88
  
• Ulrik Brandes, Gabi Dorfmüller:
  PageRank - What Is Really Relevant in the World-Wide Web? 89-96
  

Part 2 / Arithmetic and Encryption

• Arno Eigenwillig, Kurt Mehlhorn:
  Multiplication of Long Integers - Faster than Long Multiplication. 101-109
  
• Friedrich Eisenbrand:
  The Euclidean Algorithm. 111-117
  
• Rolf H. Möhring, Martin Oellrich:
  The Sieve of Eratosthenes - How Fast Can We Compute a Prime Number Table? 119-130
  
• Rüdiger Reischuk, Markus Hinkelmann:
  One-Way Functions - Mind the Trap - Escape Only for the Initiated. 131-139
  
• Till Tantau:
  The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets. 141-146
  
• Dirk Bongartz, Walter Unger:
  Public-Key Cryptography. 147-158
  
• Johannes Blömer:
  How to Share a Secret. 159-168
  
• Detlef Sieling:
  Playing Poker by Email. 169-180
  
• Martin Dietzfelbinger:
  Fingerprinting. 181-193
  
• Christian Schindelhauer:
  Hashing. 195-201
  
• Michael Mitzenmacher:
  Codes - Protecting Data Against Errors and Loss. 203-217
  

Part 3 / Planning, Coordination and Simulation

• Christian Scheideler:
  Broadcasting - How Can I Quickly Disseminate Information? 223-229
  
• Lothar Schmitz:
  Converting Numbers into English Words. 231-237
  
• Thomas Erlebach:
  Majority - Who Gets Elected Class Rep? 239-247
  
• Bruno Müller-Clostermann, Tim Jonischkat:
  Random Numbers - How Can We Create Randomness in Computers? 249-258
  
• Jochen Könemann:
  Winning Strategies for a Matchstick Game. 259-265
  
• Sigrid Knust:
  Scheduling of Tournaments or Sports Leagues. 267-275
  
• Michael Behrisch, Amin Coja-Oghlan, Peter Liske:
  Eulerian Circuits. 277-283
  
• Dominik Sibbing, Leif Kobbelt:
  High-Speed Circles. 285-293
  
• Christoph Freundl, Ulrich Rüde:
  Gauss-Seidel Iterative Method for the Computation of Physical Problems. 295-304
  
• Norbert Blum, Matthias Kretschmer:
  Dynamic Programming - Evolutionary Distance. 305-311
  

Part 4 / Optimization

• Peter Sanders, Johannes Singler:
  Shortest Paths. 317-324
  
• Katharina Skutella, Martin Skutella:
  Minimum Spanning Trees - Sometimes Greed Pays Off. 325-331
  
• Robert Görke, Steffen Mecke, Dorothea Wagner:
  Maximum Flows - Towards the Stadium During Rush Hour. 333-344
  
• Volker Claus, Volker Diekert, Holger Petersen:
  Marriage Broker. 345-355
  
• Emo Welzl:
  The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland? 357-360
  
• Susanne Albers, Swen Schmelzer:
  Online Algorithms - What Is It Worth to Know the Future? 361-366
  
• Joachim Gehweiler, Friedhelm Meyer auf der Heide:
  Bin Packing - How Do I Get My Stuff into the Boxes. 367-374
  
• René Beier, Berthold Vöcking:
  The Knapsack Problem. 375-381
  
• Stefan Näher:
  The Travelling Salesman Problem. 383-391
  
• Peter Rossmanith:
  Simulated Annealing. 393-400
  

Last update Mon May 20 04:51:29 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page