Article

Free access

Chernoff-Hoeffding bounds for applications with limited independence

Authors:

Jeanette P. Schmidt,

Alan Siegel, and

Aravind SrinivasanAuthors Info & Claims

SODA '93: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms

January 1993

Pages 331 - 340

Published: 01 January 1993 Publication History

PDF eReader

References

[1]

N. Alon, L. Babai, and A. Itaj. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7:567-583, 1986.

Digital Library

Google Scholar

[2]

N. Alon, J. Spencer, and P. Erd6s. The Probabilistic Method. Wiley-Interscience Series, John Wiley & Sons, Inc., New York, 1992.

Google Scholar

[3]

D. Angluin and L.G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer and System Sciences, 18:155-193, 1979.

Google Scholar

[4]

M. Bellare, O. Goldreich, and S. Goldwasser. Randomness in Interactive Proofs. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 563-573, 1990.

Google Scholar

[5]

M. Bellare and J. Rompel. Randomness Efficient Sampling of Arbitrary Functions, Technical Report MIT/LCS/TM-433.b, Laboratory for Computer Science, Massachusetts Institute of Technology, July 1990.

Google Scholar

[6]

B. Berger and J. Rompel. Simulating (logcn)-wise independence in N C. J. Assoc. Comput. Much., 38(4)'1026-t046, 1991.

Digital Library

Google Scholar

[7]

J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18-143-154, 1979.

Google Scholar

[8]

H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.

Google Scholar

[9]

V. Chv&tal. The tail of the hypergeometric distribution. Discrete Mathematics, 25:285-287, 1979.

Google Scholar

[10]

G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veliizkovid. Approximations of general independent distributions. In Proceedings of the A GM Symposium on Theory of Computing, pages 10-16, 1992.

Digital Library

Google Scholar

[11]

W. Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, pages 13-30, 1963.

Google Scholar

[12]

A. Joffe. On a set of almost deterministic kindependent random variables. The Annals of Probability, 2(1)'161-162, 1974.

Google Scholar

[13]

H. J. Karloff and P. Raghavan. Randomized algorithms and pseudorandom numbers. In Proceedings of the A CM Symposium on Theory of Computing, pages 310- 321, 1988.

Digital Library

Google Scholar

[14]

C. Kruskal, L. Rudolph, and M. Suit. A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71'95-132, 1990.

Digital Library

Google Scholar

[15]

F.T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 256- 269, 1988.

Google Scholar

[16]

N. Linial and N. Nisan. Approximate inclusionexclusion. Combinatorica, 10(4):349-365, 1990.

Google Scholar

[17]

K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parMlel memories. Acta Informatica, 21:339-374, 1984.

Digital Library

Google Scholar

[18]

R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 8-13, 1989.

Digital Library

Google Scholar

[19]

J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the A CM Symposium on Theory of Computing, pages 213-223, 1990.

Digital Library

Google Scholar

[20]

S.V. Nagaev and I.F. Pinelis. Some inequalities for the distribution of the sums of independent random variables. Theory of Probability and its Applications, 22:248-256, 1977.

Google Scholar

[21]

A. Panconesi and A. Srinivasan. Fast randomized algorithms for distributed edge coloring. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 251-262, 1992.

Digital Library

Google Scholar

[22]

D. Peleg and E. Upfal. A time-randomness tradeoff for oblivious routing. SIAM J. Comput., 19:256-266, 1990.

Digital Library

Google Scholar

[23]

S. A. Plotkin, D. B. Shmoys, and l~. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 495-504, 1991. Expanded version available as Technical Report 999, School of Operations Research and Industrial Engineering, Cornell University, 1992.

Digital Library

Google Scholar

[24]

P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130-143, 1988.

Digital Library

Google Scholar

[25]

P. Raghavan. Lecture notes on randomized algorithms. Technical Report RC 15340 (#68237), IBM T.J.Watson Research Center, January 1990. Also available as CS661 Lecture Notes, Technical report YALE/DCS/RR-757, Department of Computer Science, Yale University, January 1990.

Google Scholar

[26]

A. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 41:307-326, 1991.

Digital Library

Google Scholar

[27]

H. Robbins. A remark on Stirling's formula. Amer. Math. Monthly, 62:26-29, 1955.

Google Scholar

[28]

J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff- Hoeffding bounds for applications with limited independence. Technical Report TR 92-1305, Department of Computer Science, Cornell University, October 1992.

Digital Library

Google Scholar

[29]

J.P. Schmidt and A. Siegel. On aspects of universality and performance for closed hashing. In Proceedings of the ACM Symposium on Theory of Computing, pages 355-366, 1989.

Digital Library

Google Scholar

[30]

J.P. Schmidt and A. Siegel. The analysis of closed hashing under limited randomness. In Proceedings of the A CM Symposium on Theory of Computing, pages 224-234, 1990.

Digital Library

Google Scholar

[31]

D. B. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. In Proceedings of the A GM/SIAM Symposium on Discrete Algorithms, pages 131-140, 1991.

Digital Library

Google Scholar

[32]

A. Siegel. On universal classes of fast hash functions, their time-space tradeoff, and their applications. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 20-25, 1989.

Google Scholar

[33]

J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, 1987.

Google Scholar

[34]

C. Stein. Approximation algorithms.{or multicommodity flow and shop scheduling problems. PhD thesis, Technical Report 550, Laboratory for Computer Science, Massachusetts htstitute of Technology, 1992.

Digital Library

Google Scholar

[35]

L. G. Valiant. A scheme for fast parallel communication. SiAM J. Comput., 11:350-361, 1982.

Google Scholar

[36]

L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the A CM Symposium on Theory o} Computing, pages 263-277, 1981.

Digital Library

Google Scholar

[37]

M.N. Wegman and J.L. Carter. New classes and applications of hash fupctions. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 175-182, 1979.

Google Scholar

Cited By

View all

Bercea IEven GLeonardi SGupta A(2022)An extendable data structure for incremental stable perfect hashingProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520070(1298-1310)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520070
Gravin NGuo SKwok TLu PMarx D(2021)Concentration bounds for almost k-wise independence with applications to non-uniform securityProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458207(2404-2423)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458207
Dziembowski SPietrzak KWichs D(2018)Non-Malleable CodesJournal of the ACM10.1145/317843265:4(1-32)Online publication date: 26-Apr-2018
https://dl.acm.org/doi/10.1145/3178432
Show More Cited By

Index Terms

Chernoff-Hoeffding bounds for applications with limited independence
1. Mathematics of computing
  1. Discrete mathematics
  2. Probability and statistics
2. Theory of computation
  1. Models of computation
    1. Probabilistic computation
  2. Randomness, geometry and discrete structures

Recommendations

Chernoff-Hoeffding Bounds for Applications with Limited Independence

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 ...
Read More
Chernoff-Hoeffding Bounds for Applications with Limited Independence
Read More
Equitable Coloring Extends Chernoff-Hoeffding Bounds
APPROX '01/RANDOM '01: Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization

Chernoff-Hoeffding bounds are sharp tail probability bounds for sums of bounded independent random variables. Often we cannot avoid dependence among random variables involved in the sum. In some cases the theory of martingales has been used to obtain ...
Read More

Comments

Information & Contributors

Information

Published In

SODA '93: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms

January 1993

506 pages

ISBN:0898713137

Chairman:
Vijaya Ramachandran

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1993

Check for updates

Qualifiers

Article

Conference

SODA93

Sponsor:

SIGACT
SIAM

SODA93: Conference on Discrete Algorithms

January 25 - 27, 1993

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
2,047
Total Downloads

Downloads (Last 12 months)517
Downloads (Last 6 weeks)105

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bercea IEven GLeonardi SGupta A(2022)An extendable data structure for incremental stable perfect hashingProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520070(1298-1310)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520070
Gravin NGuo SKwok TLu PMarx D(2021)Concentration bounds for almost k-wise independence with applications to non-uniform securityProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458207(2404-2423)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458207
Dziembowski SPietrzak KWichs D(2018)Non-Malleable CodesJournal of the ACM10.1145/317843265:4(1-32)Online publication date: 26-Apr-2018
https://dl.acm.org/doi/10.1145/3178432
Bhuvanagiri LGanguly SKesh DSaha C(2006)Simpler algorithm for estimating frequency moments of data streamsProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109634(708-713)Online publication date: 22-Jan-2006
https://dl.acm.org/doi/10.5555/1109557.1109634
Karger DRuhl MGibbons PAdler M(2004)Simple efficient load balancing algorithms for peer-to-peer systemsProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007919(36-43)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007919
Karger DRuhl M(2004)Simple efficient load balancing algorithms for peer-to-peer systemsProceedings of the Third international conference on Peer-to-Peer Systems10.1007/978-3-540-30183-7_13(131-140)Online publication date: 26-Feb-2004
https://dl.acm.org/doi/10.1007/978-3-540-30183-7_13
Auletta VCaragiannis IKaklamanis CPersiano P(2002)Randomized path coloring on binary treesTheoretical Computer Science10.1016/S0304-3975(01)00310-3289:1(355-399)Online publication date: 23-Oct-2002
https://dl.acm.org/doi/10.1016/S0304-3975%2801%2900310-3
Pagh RVitter JSpirakis PYannakakis M(2001)On the cell probe complexity of membership and perfect hashingProceedings of the thirty-third annual ACM symposium on Theory of computing10.1145/380752.380836(425-432)Online publication date: 6-Jul-2001
https://dl.acm.org/doi/10.1145/380752.380836
Karger DLehman ELeighton TPanigrahy RLevine MLewin DLeighton FShor P(1997)Consistent hashing and random treesProceedings of the twenty-ninth annual ACM symposium on Theory of computing10.1145/258533.258660(654-663)Online publication date: 4-May-1997
https://dl.acm.org/doi/10.1145/258533.258660
Goodrich MTardos É(1996)Fixed-dimensional parallel linear programming via relative ε-approximationsProceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/313852.313904(132-141)Online publication date: 28-Jan-1996
https://dl.acm.org/doi/10.5555/313852.313904
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations