• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel och pussel

Skapa nya rutiner – hälsoböcker upp till 50% →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Samhälle och politik
    2. Samhälle och kultur
    3. Kultur och medier
    4. Referensverk och tvärvetenskap

    Algorithms Unplugged

    AvBerthold Vöcking,Helmut Alt

    Häftad, Engelska, 2016

    1 185 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    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 amaze? 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.

    Produktinformation

    • Utgivningsdatum:2016-08-23
    • Mått:155 x 235 x 23 mm
    • Vikt:628 g
    • Format:Häftad
    • Språk:Engelska
    • Antal sidor:406
    • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    • ISBN:9783662506004

    Utforska kategorier

    • Referensverk och tvärvetenskap inom Samhälle och politik
    • Teknik: allmänt inom Naturvetenskap och teknik
    • Matematik inom Naturvetenskap och teknik

    Recensioner i media

    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)

    Innehållsförteckning

    • 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.
    Hoppa över listan

    Du kanske också är intresserad av

    Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner - Taschenbuch der Algorithmen, Häftad

    Taschenbuch der Algorithmen

    Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

    Häftad, 2008

    471 kr

    Dorothea Wagner, Heribert Vollmer, Christian Scheideler, Rudiger Reischuk, Martin Dietzfelbinger, Helmut Alt, Berthold Vocking - Algorithms Unplugged, E-bok

    Algorithms Unplugged

    Dorothea Wagner, Heribert Vollmer, Christian Scheideler, Rudiger Reischuk, Martin Dietzfelbinger, Helmut Alt, Berthold Vocking

    E-bok
    2010

    1 570 kr

    Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner - Algorithms Unplugged, Inbunden

    Algorithms Unplugged

    Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

    Inbunden, 2011

    1 185 kr

    Dorothea Wagner, Heribert Vollmer, Christian Scheideler, Rudiger Reischuk, Martin Dietzfelbinger, Helmut Alt, Berthold Vocking - Taschenbuch der Algorithmen, E-bok

    Taschenbuch der Algorithmen

    Dorothea Wagner, Heribert Vollmer, Christian Scheideler, Rudiger Reischuk, Martin Dietzfelbinger, Helmut Alt, Berthold Vocking

    E-bok
    2008

    488 kr

    Berthold Vöcking - Algorithmic Game Theory, Häftad

    Algorithmic Game Theory

    Berthold Vöcking

    Häftad, 2013

    500 kr

    Rüdiger Reischuk, Michel Morvan - STACS 97, Häftad

    STACS 97

    Rüdiger Reischuk, Michel Morvan

    Häftad, 1997

    1 110 kr

    Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk - Algorithmic Learning Theory, Häftad

    Algorithmic Learning Theory

    Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk

    Häftad, 2002

    559 kr

    Maciej Liskiewicz, Rüdiger Reischuk - Fundamentals of Computation Theory, Häftad

    Fundamentals of Computation Theory

    Maciej Liskiewicz, Rüdiger Reischuk

    Häftad, 2005

    559 kr

    Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk - Graph-Theoretic Concepts in Computer Science, Häftad

    Graph-Theoretic Concepts in Computer Science

    Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk

    Häftad, 2013

    542 kr

    Claude Puech, Rüdiger Reischuk - STACS 96, Häftad

    STACS 96

    Claude Puech, Rüdiger Reischuk

    Häftad, 1996

    1 110 kr