Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)
Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)
Resource Information
The item Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 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, 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 Germanlanguage universities to communicate the fascination of algorithms and computer science to highschool 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
 Language
 eng
 Extent
 1 online resource (x, 406 pages)
 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 DepthFirst 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 WorldWide 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 OneWay Functions – Mind the Trap – Escape Only for the Initiated
 15 The OneTime Pad Algorithm – The Simplest and Most Secure Way to Keep Secrets
 16 PublicKey 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 HighSpeed 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
 Isbn
 9783642153273
 Label
 Algorithms unplugged
 Title
 Algorithms unplugged
 Statement of responsibility
 Berthold Vöcking [and others], editors
 Language
 eng
 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, 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 Germanlanguage universities to communicate the fascination of algorithms and computer science to highschool 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
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA76.9.A43
 LC item number
 A44 2011
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 SpringerLink
 Vöcking, Berthold
 http://library.link/vocab/subjectName

 Computer algorithms
 COMPUTERS
 COMPUTERS
 Informatique
 Computer algorithms
 Label
 Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 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 DepthFirst 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 WorldWide 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 OneWay Functions – Mind the Trap – Escape Only for the Initiated  15 The OneTime Pad Algorithm – The Simplest and Most Secure Way to Keep Secrets  16 PublicKey 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 HighSpeed 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
 Dimensions
 unknown
 Extent
 1 online resource (x, 406 pages)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642153273
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other physical details
 illustrations (some color)
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783642153273
 System control number

 (OCoLC)700199250
 (OCoLC)ocn700199250
 Label
 Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 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 DepthFirst 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 WorldWide 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 OneWay Functions – Mind the Trap – Escape Only for the Initiated  15 The OneTime Pad Algorithm – The Simplest and Most Secure Way to Keep Secrets  16 PublicKey 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 HighSpeed 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
 Dimensions
 unknown
 Extent
 1 online resource (x, 406 pages)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642153273
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other physical details
 illustrations (some color)
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 Stock number
 9783642153273
 System control number

 (OCoLC)700199250
 (OCoLC)ocn700199250
Subject
 COMPUTERS  Enterprise Applications  Business Intelligence Tools
 COMPUTERS  Intelligence (AI) & Semantics
 Computer algorithms
 Computer algorithms
 Computer algorithms
 Computer algorithms
 Computer algorithms
 Computer algorithms
 Electronic books
 Electronic resources
 Informatique
Genre
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsunpluggedBertholdV%C3%B6ckingand/uULydhhX_CE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsunpluggedBertholdV%C3%B6ckingand/uULydhhX_CE/">Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsunpluggedBertholdV%C3%B6ckingand/uULydhhX_CE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsunpluggedBertholdV%C3%B6ckingand/uULydhhX_CE/">Algorithms unplugged, Berthold Vöcking [and others], editors, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>