Atjaunināt sīkdatņu piekrišanu

Algorithms Unplugged 2011 ed. [Hardback]

3.42/5 (24 ratings by Goodreads)
Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by
  • Formāts: Hardback, 406 pages, height x width: 235x155 mm, weight: 863 g, X, 406 p., 1 Hardback
  • Izdošanas datums: 11-Jan-2011
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642153275
  • ISBN-13: 9783642153273
  • Hardback
  • Cena: 100,46 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 118,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 406 pages, height x width: 235x155 mm, weight: 863 g, X, 406 p., 1 Hardback
  • Izdošanas datums: 11-Jan-2011
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642153275
  • ISBN-13: 9783642153273
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 Unplugged presents 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.

Recenzijas

From the reviews:

This work uses a concise presentation style with an efficient problem-solution approach for selected algorithms to solve most common situations in the modern world. The book outlines algorithms that can be applied in areas such as cryptography, evolutionary distance calculations in bioinformatics, and Internet search engines. this book will be most useful as a resource for computer science students. it may also be of interest to mathematics students with the appropriate background. Summing Up: Recommended. Upper-division undergraduates through professionals. (V. Mathura, Choice, Vol. 48 (11), August, 2011)

Presents 41 articles designed to communicate the fascination of algorithms to high-school students and interested adults. Indeed, most of us will easily find something fascinating here. a wonderful resource for students as each chapter can be the basis for further study and research projects. Every library used by computer science or mathematics students should include Algorithms Unplugged. It admirably achieves its purpose of engaging readers and making a book on algorithms fun to read. Many readers will be motivated to explore further. (Art Gittleman, The Mathematical Association of America, April, 2011)

Part I Searching and Sorting
Overview
3(2)
Martin Dietzfelbinger
Christian Scheideler
1 Binary Search
5(8)
Thomas Seidl
Jost Enderle
2 Insertion Sort
13(4)
Wolfgang P. Kowalk
3 Fast Sorting Algorithms
17(10)
Helmut Alt
4 Parallel Sorting - The Need for Speed
27(12)
Rolf Wanka
5 Topological Sorting - How Should I Begin to Complete My To Do List?
39(8)
Hagen Hopfner
6 Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm
47(10)
Markus E. Nebel
7 Depth-First Search (Ariadne & Co.)
57(12)
Michael Dom
Falk Huffner
Rolf Niedermeier
8 Pledge's Algorithm
69(8)
Rolf Klein
Tom Kamphans
9 Cycles in Graphs
77(12)
Holger Schlingloff
10 PageRank - What Is Really Relevant in the World-Wide Web?
89(10)
Ulrik Brandes
Gabi Dorfmuller
Part II Arithmetic and Encryption
Overview
99(2)
Berthold Vocking
11 Multiplication of Long Integers - Faster than Long Multiplication
101(10)
Arno Eigenwillig
Kurt Mehlhorn
12 The Euclidean Algorithm
111(8)
Friedrich Eisenbrand
13 The Sieve of Eratosthenes - How Fast Can We Compute a Prime Number Table?
119(12)
Rolf H. Mohring
Martin Oellrich
14 One-Way Functions. Mind the Trap - Escape Only for the Initiated
131(10)
Rudiger Reischuk
Markus Hinkelmann
15 The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets
141(6)
Till Tantau
16 Public-Key Cryptography
147(12)
Dirk Bongartz
Walter Unger
17 How to Share a Secret
159(10)
Johannes Blomer
18 Playing Poker by Email
169(12)
Detlef Sieling
19 Fingerprinting
181(14)
Martin Dietzfelbinger
20 Hashing
195(8)
Christian Schindelhauer
21 Codes - Protecting Data Against Errors and Loss
203(18)
Michael Mitzenmacher
Part III Planning, Coordination and Simulation
Overview
221(2)
Helmut Alt
Rudiger Reischuk
22 Broadcasting - How Can I Quickly Disseminate Information?
223(8)
Christian Scheideler
23 Converting Numbers into English Words
231(8)
Lothar Schmitz
24 Majority - Who Gets Elected Class Rep?
239(10)
Thomas Erlebach
25 Random Numbers - How Can We Create Randomness in Computers?
249(10)
Bruno Muller-Clostermann
Tim Jonischkat
26 Winning Strategies for a Matchstick Game
259(8)
Jochen Konemann
27 Scheduling of Tournaments or Sports Leagues
267(10)
Sigrid Knust
28 Eulerian Circuits
277(8)
Michael Behrisch
Amin Coja-Oghlan
Peter Liske
29 High-Speed Circles
285(10)
Dominik Sibbing
Leif Kobbelt
30 Gauß-Seidel Iterative Method for the Computation of Physical Problems
295(10)
Christoph Freundl
Ulrich Rude
31 Dynamic Programming - Evolutionary Distance
305(10)
Norbert Blum
Matthias Kretschmer
Part IV Optimization
Overview
315(2)
Heribert Vollmer
Dorothea Wagner
32 Shortest Paths
317(8)
Peter Sanders
Johannes Singler
33 Minimum Spanning Trees (Sometimes Greed Pays Off ...)
325(8)
Katharina Skutella
Martin Skutella
34 Maximum Flows - Towards the Stadium During Rush Hour
333(12)
Robert Gorke
Steffen Mecke
Dorothea Wagner
35 Marriage Broker
345(12)
Volker Claus
Volker Diekert
Holger Petersen
36 The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland?
357(4)
Emo Welzl
37 Online Algorithms - What Is It Worth to Know the Future?
361(6)
Susanne Albers
Swen Schmelzer
38 Bin Packing or "How Do I Get My Stuff into the Boxes?"
367(8)
Joachim Gehweiler
Friedhelm Meyer auf der Heide
39 The Knapsack Problem
375(8)
Rene Beier
Berthold Vocking
40 The Travelling Salesman Problem
383(10)
Stefan Naher
41 Simulated Annealing
393(8)
Peter Rossmanith
Author Details 401