2-source dispersers for n^o(1) entropy, and Ramsey graphs beating the Frankl-Wilson construction
Authors:
- 1 November 2012
- journal article
- research article
- Published by Annals of Mathematics in Annals of Mathematics
- Vol. 176 (3) , 1483-1544
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Simulating independenceJournal of the ACM, 2010
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent SourcesSIAM Journal on Computing, 2009
- Extracting Randomness Using Few Independent SourcesSIAM Journal on Computing, 2006
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONSInternational Journal of Number Theory, 2005
- Extractor CodesIEEE Transactions on Information Theory, 2004
- Extracting all the Randomness and Reducing the Error in Trevisan's ExtractorsJournal of Computer and System Sciences, 2002
- Extractors and pseudorandom generatorsJournal of the ACM, 2001
- Expanders That Beat the Eigenvalue Bound: Explicit Construction and ApplicationsCombinatorica, 1999
- On Data Structures and Asymmetric Communication ComplexityJournal of Computer and System Sciences, 1998
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986