On construction of k-wise independent random variables howard

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 564-573

  Karloff, Howard ^a   Mansour, Yishay ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PROBABILITY; ALGORITHMS; COMPUTER SCIENCE; FUNCTION EVALUATION; MATHEMATICAL MODELS; STATE SPACE METHODS; THEOREM PROVING; VECTORS;

DEGREE OF INDEPENDENCE; EXPLICIT CONSTRUCTIONS; INDEPENDENT RANDOM VARIABLES; LOWER BOUNDS; PROBABILITY SPACES; SAMPLE SPACE;

VECTOR SPACES; RANDOM PROCESSES;

INDEPENDENT RANDOM VARIABLES; PROBABILITY SPACE;

EID: 0028044344     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195409     Document Type: Conference Paper

References (11)

1. [ABI86] N. Alon, L. Babai, and A. Itai, "A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem, " Journal of Algorithms 7 (1986), pages 567-583.
2. [AS92]N. Alon and J. Spencer, The Probabilistic Method, Wiley, 1992.
3. [BE89]B. Berger and J. Rompel, "Simulating (logcn)-wise Independence in NC, " Proc. 30tft IEEE Symposium on Foundations of Computer Science, 1989, pages 2-7.
4. th IEEE Symposium on Foundations of Computer Science, 1985, pages 396-407.
5. [Fri92]J. Friedman, "On the Bit Extraction Problem, " Proc. 33rd IEEE Symposium on Foundations of Computer Science, 1992, pages 314-319.
6. [Joffe74] A. Joffe, "On a Set of Almost Deterministic ?-Independent Random Variables, " Annals of Probability 2 (1974), pages 161-162.
7. [KM93] D. Koller and N. Megiddo, Constructing Small Sample Spaces Satisfying Given Constraints, " Proc. 25ih ACM Symposium on Theory of Computing, 1993, pages 268-277.
8. [Lub86] M. Luby, "A Simple Parallel Algorithm for the Maximal Independent Set Problem, " SIAM Journal on Computing 15 (1986), pages 1036-1053.
9. [Lub88] M. Luby, "Removing Randomness in Parallel Computation Without a Processor Penalty, " Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988, pages 162-173.
10. [MNN89] R. Motwani, J. Naor, and J. Naor, "The Probabilistic Method Yields Deterministic Parallel Algorithms, " Proc. 30th IEEE Symposium on Foundations of Computer Science, 1989, pages 8-13.
11. [Sch92]L. Schulman, "Sample Spaces Uniform on Neighborhoods, " Proc. 24th ACM Symposium on Theory of Computing, 1992, pages 17-25.