Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 314

The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.

Chernoff–Hoeffding Bounds for Applications with Limited Independence

Schmidt, Jeanette P., Siegel, Alan, Srinivasan, Aravind · 1995 · SIAM Journal on Discrete Mathematics

Abstract

Chernoff–Hoeffding (CH) bounds are fundamental tools used in bounding the tail probabilities of the sums of bounded and independent random variables (r.v.’s). We present a simple technique that gives slightly better bounds than these and that more importantly requires only limited independence among the random variables, thereby importing a variety of standard results to the case of limited independence for free. Additional methods are also presented, and the aggregate results are sharp and provide a better understanding of the proof techniques behind these bounds. These results also yield improved bounds for various tail probability distributions and enable improved approximation algorithms for jobshop scheduling. The limited independence result implies that a reduced amount and weaker sources of randomness are sufficient for randomized algorithms whose analyses use the CH bounds, e.g., the analysis of randomized algorithms for random sampling and oblivious packet routing.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s089548019223872x

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 16 references

Cited by

See all 314

Metadata

Authors
Schmidt, J. P., Siegel, A., & Srinivasan, A.
Venue
SIAM Journal on Discrete Mathematics
Published
1995-05
Volume
8
Issue
2
Pages
223-250
ISSN
  • 0895-4801 (ISSN-L)
  • 1095-7146
OpenAlex
W2063844956
Cited by
314
References
16
FWCI
9.98
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Chernoff–Hoeffding Bounds for Applications with Limited Independence. https://app.cochat.ai/papers/10.1137/s089548019223872x
The paper
Schmidt, J. P., Siegel, A., & Srinivasan, A. (1995). Chernoff–Hoeffding Bounds for Applications with Limited Independence. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/s089548019223872x

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.