Concentration of Measure for the Analysis of Randomized Algorithms.
A coherent and unified account of techniques for analyzing the performance of randomized algorithms.
Saved in:
| Online Access: |
Full Text (via ProQuest) |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Leiden :
Cambridge University Press,
2009.
|
| Subjects: |
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | b9627137 | ||
| 003 | CoU | ||
| 005 | 20170929044655.2 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 090914s2009 ne o 000 0 eng d | ||
| 019 | |a 609842926 | ||
| 020 | |a 9780511580291 |q (electronic bk.) | ||
| 020 | |a 0511580290 |q (electronic bk.) | ||
| 035 | |a (OCoLC)ebqac438728734 | ||
| 035 | |a (OCoLC)438728734 |z (OCoLC)609842926 | ||
| 037 | |a ebqac451942 | ||
| 040 | |a MERUC |b eng |e pn |c MERUC |d YDXCP |d EBLCP |d OCLCQ |d MHW |d OCLCQ |d IDEBK |d DEBSZ |d OCLCQ |d OCLCO |d OCLCQ |d OCLCF |d OCLCQ |d ZCU |d OCLCQ |d MERUC | ||
| 049 | |a GWRE | ||
| 050 | 4 | |a QA273.D765 2009 | |
| 100 | 1 | |a Dubhashi, Devdatt. | |
| 245 | 1 | 0 | |a Concentration of Measure for the Analysis of Randomized Algorithms. |
| 260 | |a Leiden : |b Cambridge University Press, |c 2009. | ||
| 300 | |a 1 online resource (214 pages) | ||
| 336 | |a text |b txt |2 rdacontent. | ||
| 337 | |a computer |b c |2 rdamedia. | ||
| 338 | |a online resource |b cr |2 rdacarrier. | ||
| 505 | 0 | |a Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 1 Chernoff-Hoeffding Bounds; 2 Applications of the Chernoff-Hoeffding Bounds; 3 Chernoff-Hoeffding Bounds in Dependent Settings; 4 Interlude: Probabilistic Recurrences; 5 Martingales and the Method of Bounded Differences; 6 The Simple Method of Bounded Differences in Action; 7 The Method of Averaged Bounded Differences; 8 The Method of Bounded Variances; 9 Interlude: The Infamous Upper Tail; 10 Isoperimetric Inequalities and Concentration; 11 Talagrand's Isoperimetric Inequality. | |
| 505 | 8 | |a 12 Isoperimetric Inequalities and Concentration via Transportation Cost Inequalities13 Quadratic Transportation Cost and Talagrand's Inequality; 14 Log-Sobolev Inequalities and Concentration; Appendix A Summary of the Most Useful Bounds; Bibliography; Index. | |
| 520 | |a A coherent and unified account of techniques for analyzing the performance of randomized algorithms. | ||
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Distribution (Probability theory) | |
| 650 | 0 | |a Limit theorems (Probability theory) | |
| 650 | 0 | |a Random variables. | |
| 650 | 7 | |a Algorithms. |2 fast |0 (OCoLC)fst00805020. | |
| 650 | 7 | |a Distribution (Probability theory) |2 fast |0 (OCoLC)fst00895600. | |
| 650 | 7 | |a Limit theorems (Probability theory) |2 fast |0 (OCoLC)fst00998881. | |
| 650 | 7 | |a Random variables. |2 fast |0 (OCoLC)fst01089812. | |
| 700 | 1 | |a Panconesi, Alessandro. | |
| 776 | 1 | |z 9780521884273. | |
| 856 | 4 | 0 | |u http://ebookcentral.proquest.com/lib/ucb/detail.action?docID=451942 |z Full Text (via ProQuest) |
| 907 | |a .b96271371 |b 07-02-19 |c 10-03-17 | ||
| 998 | |a web |b - - |c f |d b |e z |f eng |g ne |h 0 |i 1 | ||
| 956 | |a Ebook Central Academic Complete | ||
| 956 | |b Ebook Central Academic Complete | ||
| 999 | f | f | |i 67956c7e-4180-5f33-8693-e68a455be745 |s a97067cd-0791-5290-ac83-a5974230f4a8 |
| 952 | f | f | |p Can circulate |a University of Colorado Boulder |b Online |c Online |d Online |e QA273.D765 2009 |h Library of Congress classification |i web |n 1 |