Chernoff-Hoeffding bounds for applications with limited independence
暂无分享,去创建一个
Aravind Srinivasan | Jeanette P. Schmidt | Alan Siegel | A. Siegel | Jeanette P. Schmidt | A. Srinivasan
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] Larry Rudolph,et al. A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..
[3] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[4] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[5] Bonnie Berger,et al. Simulating (logcn)-wise independence in NC , 1991, JACM.
[6] Moni Naor,et al. The Probabilistic Method Yields Deterministic Parallel Algorithms , 1994, J. Comput. Syst. Sci..
[7] Bruce M. Maggs,et al. Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[8] Noam Nisan,et al. Approximations of general independent distributions , 1992, STOC '92.
[9] Noam Nisan,et al. Approximate Inclusion-Exclusion , 1990, Comb..
[10] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[11] Jeanette P. Schmidt,et al. The analysis of closed hashing under limited randomness , 1990, STOC '90.
[12] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[13] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[14] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[15] Jeanette P. Schmidt,et al. On aspects of university and performance for closed hashing , 1989, STOC '89.
[16] Aravind Srinivasan,et al. Fast randomized algorithms for distributed edge coloring , 1992, PODC '92.
[17] A. Joffe. On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .
[18] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[19] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[20] Eli Upfal,et al. A time-randomness tradeoff for oblivious routing , 1988, STOC '88.
[21] Clifford Stein,et al. Approximation algorithms for multicommodity flow and shop scheduling problems , 1992 .
[22] SrinivasanAravind,et al. Chernoff-Hoeffding Bounds for Applications with Limited Independence , 1995 .
[23] Prabhakar Raghavan,et al. Randomized algorithms and pseudorandom numbers , 1988, STOC '88.
[24] Larry Carter,et al. New classes and applications of hash functions , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[25] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[26] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[27] Iosif Pinelis,et al. Some Inequalities for the Distribution of Sums of Independent Random Variables , 1978 .
[28] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[29] Mihir Bellare,et al. Randomness in interactive proofs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[30] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[31] Vasek Chvátal,et al. The tail of the hypergeometric distribution , 1979, Discret. Math..
[32] Abhiram G. Ranade,et al. How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[33] H. Robbins. A Remark on Stirling’s Formula , 1955 .