Simple construction of almost k-wise independent random variables
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 536, 544-553
- https://doi.org/10.1109/fscs.1990.89575
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Security preserving amplification of hardnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the power of two-point based samplingJournal of Complexity, 1989
- Dispersers, deterministic amplification, and weak random sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How to recycle random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Realistic analysis of some randomized algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- Matching is as easy as matrix inversionPublished by Association for Computing Machinery (ACM) ,1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- Explicit expanders and the Ramanujan conjecturesPublished by Association for Computing Machinery (ACM) ,1986
- A simple parallel algorithm for the maximal independent set problemPublished by Association for Computing Machinery (ACM) ,1985