- 0 Ergebnisse
Kleinster Preis: € 54,90, größter Preis: € 107,99, Mittelwert: € 76,59
1
Bestellen
bei booklooker.de
€ 56,90
Versand: € 0,001
Bestellen
gesponserter Link
Vöcking, Berthold:

Algorithms Unplugged / Berthold Vöcking (u. a.) / Buch / Book / Englisch / 2011 / Springer Berlin / EAN 9783642153273 - gebunden oder broschiert

2011, ISBN: 9783642153273

[ED: Gebunden], [PU: Springer Berlin], Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on … Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Buchbär
2
Bestellen
bei booklooker.de
€ 54,90
Versand: € 0,001
Bestellen
gesponserter Link

Vöcking, Berthold:

Algorithms Unplugged Berthold Vöcking (u. a.) Buch Book Englisch 2011 Springer Berlin EAN 9783642153273 - gebunden oder broschiert

2011, ISBN: 9783642153273

[ED: Gebunden], [PU: Springer Berlin], Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on … Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) preigu
3
Algorithms Unplugged
Bestellen
bei wordery.com
£ 92,70
(ca. € 107,99)
Bestellen
gesponserter Link
Algorithms Unplugged - neues Buch

ISBN: 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… Mehr…

Nr. 9783642153273. Versandkosten:, , zzgl. Versandkosten.
4
Bestellen
bei Biblio.co.uk
$ 59,88
(ca. € 56,16)
Versand: € 18,761
Bestellen
gesponserter Link
Berthold Vöcking (Editor), Helmut Alt (Editor), Martin Dietzfelbinger (Editor), Rüdiger Reischuk (Editor), Christian Scheideler (Editor), Heribert Vollmer (Editor), Dorothea Wagner (Editor):
Algorithms Unplugged - gebunden oder broschiert

2011, ISBN: 9783642153273

Springer, 2011-03-10. 2011. Hardcover. Used:Good., Springer, 2011-03-10, 0

Versandkosten: EUR 18.76 Ergodebooks
5
Algorithms Unplugged - Berthold Vöcking; Helmut Alt; Martin Dietzfelbinger; Rüdiger Reischuk; Christian Scheideler; Heribert Vollmer; Dorothea Wagner
Bestellen
bei lehmanns.de
€ 106,99
Versand: € 0,001
Bestellen
gesponserter Link
Berthold Vöcking; Helmut Alt; Martin Dietzfelbinger; Rüdiger Reischuk; Christian Scheideler; Heribert Vollmer; Dorothea Wagner:
Algorithms Unplugged - gebunden oder broschiert

2011, ISBN: 9783642153273

Buch, Hardcover, 2011, [PU: Springer Berlin], Springer Berlin, 2011

Versandkosten:sofort lieferbar. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Details zum Buch
Algorithms Unplugged

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.

Detailangaben zum Buch - Algorithms Unplugged


EAN (ISBN-13): 9783642153273
ISBN (ISBN-10): 3642153275
Gebundene Ausgabe
Erscheinungsjahr: 2011
Herausgeber: Springer Berlin
406 Seiten
Gewicht: 0,800 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-08-18T23:57:17+02:00 (Vienna)
Detailseite zuletzt geändert am 2022-08-03T15:20:31+02:00 (Vienna)
ISBN/EAN: 9783642153273

ISBN - alternative Schreibweisen:
3-642-15327-5, 978-3-642-15327-3


Daten vom Verlag:

Autor/in: Berthold Vöcking; Helmut Alt; Martin Dietzfelbinger; Rüdiger Reischuk; Christian Scheideler; Heribert Vollmer; Dorothea Wagner
Titel: Algorithms Unplugged
Verlag: Springer; Springer Berlin
406 Seiten
Erscheinungsjahr: 2011-01-11
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 0,863 kg
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
X, 406 p.

BB; Book; Hardcover, Softcover / Sachbücher/Lexika, Nachschlagewerke; Ingenieurswesen, Maschinenbau allgemein; Verstehen; Technik; Naturwissenschaften; Algorithms; Arithmetic; Bin packing; Broadcasting; Codes; Computer simulations; Cryptography; Cycles; Encoding; Encryption; Fingerprinting; Games; Graphs; Hashing; Knapsack Problem; Multiplication; Online algorithms; Optimizing; Paths; Prime numbers; Random numbers; Searching; Secrets; Simulated annealing; Sorting; Travelling Salesman Problem; Trees; B; Popular Science, general; Computers and Education; Algorithm Analysis and Problem Complexity; Technology and Engineering; Life Sciences; Humanities and Social Sciences; Physical Sciences; Mathematics and Computing; Computers and Education; Computer Science; Biowissenschaften, allgemein; Interdisziplinäre Studien; Mathematik und Naturwissenschaften; Mathematik; Lehrmittel, Lerntechnologien, E-Learning; EA; BC

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.

< zum Archiv...