Algorithms unplugged /
Material type: Computer fileLanguage: English Original language: German Publisher: Berlin, Germany : Springer-Verlag, [2011]Copyright date: ©2011Edition: First editionDescription: 1 online resource (x, 406 pages) : illustrationsContent type:- text
- computer
- online resource
- 9783642153273
- 9783642153280
Item type | Current library | Collection | URL | Status | Barcode | |
---|---|---|---|---|---|---|
eBook | Online | Information Technology | Link to resource | Available | E1000030 |
Browsing Online shelves, Collection: Information Technology Close shelf browser (Hides shelf browser)
Includes bibliographical references.
Part I: Searching and sorting. -- Overview -- Binary search -- Insertion sort -- Fast sorting algorithms -- Parallel sorting - the need for speed -- Topological sorting - how should I begin to complete my to do list? -- Searching texts - but fast! The Boyer-Moore-Horspool Algorithm -- Depth-first search (Ariadne & Co.) -- Pledge's Algorithm -- Cycles in graphs -- PageRank - what is really relevant in the world-wide web? -- Part II: Arithmetic and encryption. -- Overview -- Multiplication of long integers - faster than long multiplication -- The Euclidean Algorithm -- The Sieve of Eratosthenes - how fast can we compute a prime number table? -- One-way functions. Mind the trap - escape only for the initiated -- The one-time pad algorithm - the simplest and most secure way to keep secrets -- Public-key cryptography -- How to share a secret -- Playing poker by email -- Fingerprinting -- Hashing -- Codes - protecting data against errors and loss -- Part III: Planning, coordination and simulation. -- Overview -- Broadcasting - how can I quickly disseminate information? -- Converting numbers into English words -- Majority - who gets elected class rep? -- Random numbers - how fast can we create randomness in computers? -- Winning strategies for a matchstick game -- Scheduling of tournaments or sports leagues -- Eulerian Circuits -- High-speed circles -- Gauss-Seidel Iterative Method for computation of physical problems -- Dynamic programming - evolutionary distance -- Part IV: Optimization. -- Overview -- Shortest paths -- Minimum spanning trees (sometimes greed pays off...) -- Maximum flows - towards the stadium during rush hour -- Marriage broker -- The smallest enclosing circle - a contribution to democracy from Switzerland -- Online algorithms - what is it worth to know the future? -- Bin packing or "how do I get my stuff into the boxes?" -- The knapsack problem -- The travelling salesman problem -- Simulated annealing.
Available on-campus and off-campus with authorized login.
Translated into English from German.
There are no comments on this title.