Authors:
- The first introductory textbook at the advanced and graduate level on randomized algorithms
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Theoretical Computer Science. An EATCS Series (TTCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (7 chapters)
-
Front Matter
-
Back Matter
About this book
Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.
Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.
Reviews
From the reviews:
"The book gives an introduction to (design and analysis of) randomized algorithms. It is a self-contained textbook primarily for students. … The proofs are precise and contain all details. This makes the book perfect for self-study. … A student … will be happy to find everything defined precisely and explained in detail." (Benjamin Doerr, Zentralblatt MATH, Vol. 1083, 2006)
“Theory of Computing community (especially those who work on Algorithm Design) is well acquainted with the concept of Randomization. … this book still gives a fresh and interesting point of view to Randomization and Randomized Algorithms. … This is a very good to excellent textbook on the Design and Analysis of Randomized Algorithms. Its unique … feature is that it explicitly isolates and promotes the most important design techniques; this is really a great experience for the incoming theorist to specialize on Randomized Algorithms.” (Marios Mavronicolas, SIGACT News, Vol. 40 (2), 2009)Authors and Affiliations
-
ETH Zentrum, RZ F2 Department of Computer Science, Swiss Federal Institute of Technology, Zürich, Switzerland
Juraj HromkoviČ
Bibliographic Information
Book Title: Design and Analysis of Randomized Algorithms
Book Subtitle: Introduction to Design Paradigms
Authors: Juraj HromkoviČ
Series Title: Texts in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/3-540-27903-2
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2005
Hardcover ISBN: 978-3-540-23949-9Published: 14 June 2005
Softcover ISBN: 978-3-642-06300-8Published: 21 October 2010
eBook ISBN: 978-3-540-27903-7Published: 11 October 2005
Series ISSN: 1862-4499
Series E-ISSN: 1862-4502
Edition Number: 1
Number of Pages: XII, 277
Topics: Programming Techniques, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Discrete Mathematics in Computer Science, Algorithms