Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-05T03:35:23.580Z Has data issue: false hasContentIssue false

1 - Chernoff–Hoeffding Bounds

Published online by Cambridge University Press:  19 October 2009

Devdatt P. Dubhashi  and
Alessandro Panconesi
Devdatt P. Dubhashi
Affiliation:
Chalmers University of Technology, Gothenberg
Alessandro Panconesi
Affiliation:
Università degli Studi di Roma 'La Sapienza', Italy

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Chernoff–Hoeffding Bounds
  • Devdatt P. Dubhashi, Chalmers University of Technology, Gothenberg, Alessandro Panconesi, Università degli Studi di Roma 'La Sapienza', Italy
  • Book: Concentration of Measure for the Analysis of Randomized Algorithms
  • Online publication: 19 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511581274.002
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Chernoff–Hoeffding Bounds
  • Devdatt P. Dubhashi, Chalmers University of Technology, Gothenberg, Alessandro Panconesi, Università degli Studi di Roma 'La Sapienza', Italy
  • Book: Concentration of Measure for the Analysis of Randomized Algorithms
  • Online publication: 19 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511581274.002
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Chernoff–Hoeffding Bounds
  • Devdatt P. Dubhashi, Chalmers University of Technology, Gothenberg, Alessandro Panconesi, Università degli Studi di Roma 'La Sapienza', Italy
  • Book: Concentration of Measure for the Analysis of Randomized Algorithms
  • Online publication: 19 October 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511581274.002
Available formats
×