Texts in Theoretical Computer Science. An EATCS Series

Design and Analysis of Randomized Algorithms

Introduction to Design Paradigms

Authors: Hromkovic, J.

Free Preview

Buy this book

eBook n/a
  • ISBN 978-3-540-27903-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
Hardcover n/a
  • ISBN 978-3-540-23949-9
  • Free shipping for individuals worldwide
Softcover n/a
  • ISBN 978-3-642-06300-8
  • Free shipping for individuals worldwide
About this Textbook

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)

Table of contents (7 chapters)

Table of contents (7 chapters)
  • Introduction

    Pages 1-17

    HromkoviČ, Prof. Dr. Juraj

  • Fundamentals

    Pages 19-99

    HromkoviČ, Prof. Dr. Juraj

  • Foiling the Adversary

    Pages 101-129

    HromkoviČ, Prof. Dr. Juraj

  • Fingerprinting

    Pages 131-151

    HromkoviČ, Prof. Dr. Juraj

  • Success Amplification and Random Sampling

    Pages 153-182

    HromkoviČ, Prof. Dr. Juraj

Buy this book

eBook n/a
  • ISBN 978-3-540-27903-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
Hardcover n/a
  • ISBN 978-3-540-23949-9
  • Free shipping for individuals worldwide
Softcover n/a
  • ISBN 978-3-642-06300-8
  • Free shipping for individuals worldwide
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Design and Analysis of Randomized Algorithms
Book Subtitle
Introduction to Design Paradigms
Authors
Series Title
Texts in Theoretical Computer Science. An EATCS Series
Copyright
2005
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-27903-7
DOI
10.1007/3-540-27903-2
Hardcover ISBN
978-3-540-23949-9
Softcover ISBN
978-3-642-06300-8
Series ISSN
1862-4499
Edition Number
1
Number of Pages
XII, 277
Topics