//]]>

Algorithms Unplugged (Record no. 21677)

000 -LEADER
fixed length control field 05776nam a22005175i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151119.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 101210s2011 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642153280
978-3-642-15328-0
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number Q162
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 500
Edition number 23
Classification number 600
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2011.
912 ## -
-- ZDB-2-SCS
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Vöcking, Berthold.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Algorithms Unplugged
Medium [electronic resource] /
Statement of responsibility, etc edited by Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner.
300 ## - PHYSICAL DESCRIPTION
Extent X, 406p.
Other physical details online resource.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Science (General).
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Education.
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Popular Science.
Topical term or geographic name as entry element Popular Science in Mathematics/Computer Science/Natural Science/Technology.
Topical term or geographic name as entry element Computers and Education.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Alt, Helmut.
Relator term editor.
Personal name Dietzfelbinger, Martin.
Relator term editor.
Personal name Reischuk, Rüdiger.
Relator term editor.
Personal name Scheideler, Christian.
Relator term editor.
Personal name Vollmer, Heribert.
Relator term editor.
Personal name Wagner, Dorothea.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642153273
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-15328-0
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-14AUM Main Library2014-04-14 2014-04-14 E-Book   AUM Main Library500