## 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

- Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson
- STOC
- 2006

Highly Influenced

@inproceedings{Vazirani1985TowardsAS, title={Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract)}, author={Umesh V. Vazirani}, booktitle={STOC}, year={1985} }

- Published 1985 in STOC
DOI:10.1145/22145.22186

Several computational applications, such as randomizing algorithms [Ra], stochastic simulation [SC, KG] and cryptographic protocols [B11, GM, W] assume a fast source of unbiased, independent coin flips. Unfortunately, the available physical sources of randomness, such as noise diodes and geiger counters are at best imperfect [Mu]. Santha and Vazirani [SV] consider a very general model for such imperfect sources of randomness: the slightly random source. A slightly random source is a black box

Highly Cited

This paper has 45 citations. REVIEW CITATIONS