Loss-less condensers, unbalanced expanders, and extractors
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 143-152
- https://doi.org/10.1145/380752.380790
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Extracting Randomness: A Survey and New ConstructionsJournal of Computer and System Sciences, 1999
- Expanders That Beat the Eigenvalue Bound: Explicit Construction and ApplicationsCombinatorica, 1999
- Explicit OR-dispersers with polylogarithmic degreeJournal of the ACM, 1998
- Expander codesIEEE Transactions on Information Theory, 1996
- Simulating BPP using a general weak random sourceAlgorithmica, 1996
- Randomness is Linear in SpaceJournal of Computer and System Sciences, 1996
- Eigenvalues and expansion of regular graphsJournal of the ACM, 1995
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, 1988
- Graph-theoretic properties in computational complexityJournal of Computer and System Sciences, 1976