Extracting all the randomness and reducing the error in Trevisan's extractors
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 149-158
- https://doi.org/10.1145/301250.301292
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Extracting Randomness: A Survey and New ConstructionsJournal of Computer and System Sciences, 1999
- Computing with Very Weak Random SourcesSIAM Journal on Computing, 1999
- Explicit OR-dispersers with polylogarithmic degreeJournal of the ACM, 1998
- Randomness is Linear in SpaceJournal of Computer and System Sciences, 1996
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, 1988
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sourcesCombinatorica, 1987
- Sorting and Selecting in RoundsSIAM Journal on Computing, 1987
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986