Almost k-wise independence versus k-wise independence

Information Processing Letters

Volumn 88, Issue 3, 2003, Pages 107-110

  Alon, Noga ^a   Goldreich, Oded ^b   Mansour, Yishay ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Almost k wise independent distributions; Combinatorial problems; k wise independent distributions; Small probability spaces; Small bias probability spaces; Theory of computation

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; PROBABILITY; THEOREM PROVING;

INDEPENDENT DISTRIBUTIONS;

DATA PROCESSING;

EID: 0141595861     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00359-4     Document Type: Article

References (9)

1. Alon N., Babai L., Itai A. A fast and simple randomized algorithm for the maximal independent set problem. J. Algorithms. 7:1986;567-583.
2. Alon N., Goldreich O., Håstad J., Peralta R. Simple constructions of almost k-wise independent random variables. Random Structures Algorithms. 3:(3):1992;289-304.
3. Chor B., Friedmann J., Goldreich O., Håstad J., Rudich S., Smolensky R. The bit extraction problem and t -resilient functions. Proc. 26th FOCS. 1985;396-407.
4. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15:(4):1986;1036-1053. Preliminary version in: Proc. 17th STOC. 1985.
5. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15:(4):1986;1036-1053. Preliminary version in: Proc. 17th STOC. 1985.
6. Naor J., Naor M. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22:1993;838-856. Preliminary version in: Proc. 22nd STOC. 1990.
7. Naor J., Naor M. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22:1993;838-856. Preliminary version in: Proc. 22nd STOC. 1990.
8. Rao C.R. Factorial experiments derivable from combinatorial arrangements of arrays. J. Roy. Stat. Soc. 9:1947;128-139.
9. U.V. Vazirani, Randomness, adversaries and computation, Ph.D. Thesis, EECS, UC Berkeley, CA, 1986.