Algorithms unplugged
- Responsibility
- Berthold Vöcking [and others], editors.
- Language
- English. Translated from the German.
- Digital
- data file
- Imprint
- Berlin ; Heidelberg ; New York : Springer, ©2011.
- Physical description
- 1 online resource (x, 406 pages) : illustrations (some color)
Online
Available online
More options
Description
Creators/Contributors
- Contributor
- Vöcking, Berthold.
Contents/Summary
- Bibliography
- Includes bibliographical references.
- Contents
-
- Part I
- Searching and Sorting
- Overview
- 1 Binary Search
- 2 Insertion Sort
- 3 Fast Sorting Algorithms
- 4 Parallel Sorting
- The Need for Speed
- 5 Topological Sorting
- How Should I Begin to Complete My To Do List?
- 6 Searching Texts
- But Fast! The Boyer-Moore-Horspool Algorithm
- 7 Depth-First Search (Ariadne & Co.)
- 8 Pledge's Algorithm
- How to Escape from a Dark Maze
- 9 Cycles in Graphs
- 10 PageRank
- What Is Really Relevant in the World-Wide Web?
- Part II
- Arithmetic and Encryption
- Overview
- 11 Multiplication of Long Integers
- Faster than Long Multiplication
- 12 The Euclidean Algorithm
- 13 The Sieve of Eratosthenes
- How Fast Can We Compute a Prime Number Table?
- 14 One-Way Functions
- Mind the Trap
- Escape Only for the Initiated
- 15 The One-Time Pad Algorithm
- The Simplest and Most Secure Way to Keep Secrets
- 16 Public-Key Cryptography
- 17 How to Share a Secret
- 18 Playing Poker by Email
- 19 Fingerprinting
- 20 Hashing
- 21 Codes
- Protecting Data Against Errors and Loss
- Part III
- Planning, Coordination and Simulation
- Overview
- 22 Broadcasting
- How Can I Quickly Disseminate Information?
- 23 Coverting Numbers into English Words
- 24 Majority
- Who Gets Elected Class Rep?
- 25 Random Numbers
- How Can We Create Randomness in Computers?
- 26 Winning Strategies for a Matchstick Game
- 27 Scheduling of Tournaments or Sports Leagues
- 28 Eulerian Circuits
- 29 High-Speed Circles
- 30 Gauß-Seidel Iterative Method for the Computation of Physical Problems
- 31 Dynamic Programming
- Evolutionary Distance
- Part IV
- Optimisation
- Overview
- 32 Shortest Paths
- 33 Minimum Spanning Trees
- Sometimes Greed Pays Off
- 34 Maximum Flows
- Towards the Stadium During Rush Hour
- 35 Marriage Broker
- 36 The Smallest Enclosing Circle
- A Contribution to Democracy from Switzerland?
- 37 Online Algorithms
- What Is It Worth to Know the Future?
- 38 Bin Packing
- How Do I Get My Stuff into the Boxes
- 39 The Knapsack Problem
- 40 The Travelling Salesman Problem
- 41 Simulated Annealing.
- 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.
Subjects
Bibliographic information
- Publication date
- 2011
- ISBN
- 9783642153280 (electronic bk.)
- 3642153283 (electronic bk.)
- 3642153275
- 9783642153273
- 9783642153273
- DOI
- 10.1007/978-3-642-15328-0
Browse related items
Start at call number:
