On construction ofk-wise independent random variables
暂无分享,去创建一个
[1] A. Joffe. On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .
[2] Oded Goldreich,et al. The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[4] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[5] Bonnie Berger,et al. Simulating (log/sup c/n)-wise independence in NC , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[7] Leonard J. Schulman. Sample spaces uniform on neighborhoods , 1992, STOC '92.
[8] Joel Friedman,et al. On the bit extraction problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[9] Michael Luby. Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..
[10] Nimrod Megiddo,et al. Constructing small sample spaces satisfying given constraints , 1993, SIAM J. Discret. Math..
[11] Moni Naor,et al. The Probabilistic Method Yields Deterministic Parallel Algorithms , 1994, J. Comput. Syst. Sci..