Chernoff–Hoeffding Bounds for Applications with Limited Independence
- 1 May 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 8 (2) , 223-250
- https://doi.org/10.1137/s089548019223872x
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Randomness in interactive proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Simulating (log c n )-wise independence in NCJournal of the ACM, 1991
- Probabilistic Analysis of AlgorithmsPublished by Springer Nature ,1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- The tail of the hypergeometric distributionDiscrete Mathematics, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952