Design and analysis of randomized algorithms
introduction to design paradigms
by Juraj Hromkovič
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.
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
Design and analysis of randomized algorithms: introduction to design paradigms
2005, Springer
in English
3540239499 9783540239499
|
aaaa
|
Book Details
Edition Notes
Includes bibliographical references (p. [267]-269) and index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
| August 12, 2024 | Edited by MARC Bot | import existing book |
| December 25, 2021 | Edited by ImportBot | import existing book |
| April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
| February 13, 2010 | Edited by WorkBot | add more information to works |
| December 10, 2009 | Created by WorkBot | add works page |