Sample spaces uniform on neighborhoods

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 17-25

  Schulman, Leonard J ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING ERRORS; COMPUTATION THEORY; ALGORITHMS; INTEGRATED CIRCUIT TESTING; PROBABILITY; RANDOM NUMBER GENERATION; SAMPLING; SET THEORY; SIGNAL PROCESSING; VECTORS;

DERANDOMIZATION; DIMENSIONAL VECTORS; EXHAUSTIVE TESTING; INDEPENDENT SET; LOCAL LEMMATA; PARALLEL CONSTRUCTION; STATISTICAL INDEPENDENCE; UNIFORM DISTRIBUTION;

VECTOR SPACES; COMPUTATIONAL METHODS;

DERANDOMIZATION; NEIGHBORHOODS; SAMPLE SPACES;

EID: 0026977180     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129715     Document Type: Conference Paper

References (18)

1. N. Alon. A parallel algorithmic version of the local lemma. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 586-593,1991.
2. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7:567-583, 1986.
3. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost fc-wise independent random variables. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 544-553, 1990.
4. László Babai and Peter Frankl. Linear algebra methods in combinatorics. Preliminary Version, 1988.
5. J. Beck. An algorithmic approach to the Lovasz local lemma I. To appear in Random Structures and Algorithms.
6. B. Berger and J. Rompel. Simulating (logcn)-wise independence in NC. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 2-7, 1989.
7. B. Chor, 0. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolenski. The bit extraction problem or t-resilient functions. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 396407, 1985.
8. Z. Füredi, J. R. Griggs, and D. J. Kleit-man. Representations of families of triples over GF(2). IMA Preprint Series # 422, 1988.
9. R. G. Gallager. Information Theory and Reliable Communication. Wiley, 1968.
10. R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. JACM, 32(4):762-773, Oct. 1985.
11. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, Nov. 1986.
12. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1977.
13. 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, pages 8-13,1989.
14. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 213-223, 1990.
15. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. JCSS, 37(2):130-143, Oct. 1988.
16. G. Seroussi and N. H. Bshouty. Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory, 34(3):513-522,1988.
17. Joel Spencer. Ten Lectures on the Probabilistic Method. SIAM, 1987.
18. U. V. Vazirani. Randomness, Adversaries and Computation. PhD Thesis, EECS, U.C. Berkeley, 1986.