(De)randomized Construction of Small Sample Spaces in script N signscript c sign

Journal of Computer and System Sciences

Volumn 55, Issue 3, 1997, Pages 402-413

  Karger, David R ^a   Koller, Daphne ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; FINITE AUTOMATA; GRAPH THEORY; LINEAR PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROBABILITY; THEOREM PROVING;

DERANDOMIZED CONSTRUCTION;

PARALLEL ALGORITHMS;

EID: 0031339396     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1532     Document Type: Article

References (25)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7 (1986), 567-583.
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, in "Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990," pp. 544-553.
3. Y. Azar, R. Motwani, and J. Naor, Approximating arbitrary probability distributions using small sample spaces, unpublished manuscript, 1992.
4. M. Blum and O. Goldreich, Towards a computational theory of statistical tests, in "Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992," pp. 406-416.
5. P. A. Beling and N. Megiddo, Using Fast Matrix Multiplication to Find Basic Solutions, in Technical Report RJ 9234 IBM Research Division, 1993,.
6. c n)-wise independence in NC, J. Ass. Comput. Mach. 38, No. 4 (1991), 1026-1046.
7. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, t-resilient functions, in "Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985," pp. 396-407.
8. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličk-ović, Approximations of general independent distributions, in "Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992," pp. 10-16.
9. P. Erdos and J. Selfridge, On a combinatorial game, Journal of Combinatorial Theory series B 14 (1973), 298-301.
10. A. Joffe, On a set of almost deterministic k-independent random variables, Annals of Probability 2 (1974), 161-162.
11. D. Koller and N. Megiddo, Finding small sample spaces satisfying given constraints, in "Proceedings of the 25th Annual Symposium on Theory of Computing, 1993," pp. 268-277, to appear in SIAM Journal on Discrete Mathematics.
12. H. Karloff and Y. Mansour, On construction of k-wise independent random variables, in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994," to appear.
13. E. Kushilevitz, private communication, 1993.
14. R. M. Karp, E. Upfal, and A. Wigderson, Constructing a perfect matching is in random script N signscript c sign, Combinatorica 6, No. 1 (1986), 35-48.
15. M. Luby and N. Nisan, A parallel approximation algorithm for positive linear programming, in "Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993," pp. 448-457.
16. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM Journal on Computing 15, No. 4 (1986), 1036-1053.
17. N. Megiddo, private communication, 1994.
18. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, in "Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989," pp. 8-13; Journal of Computer and System Sciences, to appear; Also available as: IBM Technical Report RJ 7173, (1989).
19. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, in "Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989," pp. 8-13; Journal of Computer and System Sciences, to appear; Also available as: IBM Technical Report RJ 7173, (1989).
20. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, in "Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989," pp. 8-13; Journal of Computer and System Sciences, to appear; Also available as: IBM Technical Report RJ 7173, (1989).
21. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7, No. 1 (1987), 105-113.
22. N. Nisan, Pseudorandom generators for space-bounded computation, in "Proceedings of the 22nd Annual ACM Symposium on Theory of Computating, 1990," pp. 204-212.
23. J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM Journal on Computing 22, No. 4 (1993), 838-856.
24. L. J. Schulman, Sample spaces uniform on neighborhoods, in "Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992," pp. 17-25.
25. J. Spencer, "Ten Lectures on the Probabilistic Method," Soc. Indus. Appl. Mat., Philadelphia, 1987.