The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
Concentration of Measure for the Analysis of Randomized Algorithms
US$ 28.00
(+ tax)
Preview (read now)
Add to my own site
Give this ebook to a friend
Add to my wishlist
Author's page
Publisher's page
Devices
- iPad
- PC
- e-readers with Adobe Digital Editions installed
- Mac
See the full list
Available Devices
X
This book is available for the following devices:
- iPad
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
File Formats
Download: secure PDF.
You can also read this book online in eb20 format without having to download anything.
You can also read this book online in eb20 format without having to download anything.
Permissions
Printing
Copy/Paste
Read Aloud
Printing
Copy/Paste
Read Aloud
more
Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms. It covers the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as CH bounds in dependent settings. The authors emphasize comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
less
Cambridge University Press; June 2009
214 pages; ISBN 9780511577710
Read online, or download in secure PDF format
214 pages; ISBN 9780511577710
Read online, or download in secure PDF format