Loss-less condensers, unbalanced expanders, and extractors

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 143-152

  Ta Shma, A ^a   Umans, C ^a   Zuckerman, D ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ENTROPY; THEOREM PROVING;

CONDENSORS; EXPANDERS;

RANDOM PROCESSES;

EID: 0034832181     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380790     Document Type: Conference Paper

References (34)

1. Sorting in clog n parallel steps
2. Deterministic simulation in Logspace
3. On-line algorithms for path selection in a nonblocking network
4. Are bitvectors optimal?
5. Wide-sense nonblocking networks
6. Explicit construction of linear sized superconcentrators
7. Security preserving amplification of hardness
8. Near-optimal conversion of hardness into pseudo-randomness
9. Extractors and pseudo-random generators with optimal seed length
10. Eigenvalues and expansion of regular graphs
11. Explicit construction of concentrators
12. Extracting randomness: A survey and new constructions
13. Hardness vs. randomness
14. Randomness is linear in space
15. Sorting and selecting in rounds
16. Bounds for dispersers, extractors, and depth-two superconcentrators
17. On recycling the randomness of states in space bounded computation
18. Extracting all the randomness and reducing the error in Trevisan's extractors
19. Extracting randomness via repeated condensing
20. Explicit OR-dispersers with polylog degree
21. On using deterministic functions in probabilistic algorithms
22. Expanders, randomness, or time vs. space
23. Expander codes
24. Computing with very weak random sources
25. On extracting randomness from weak random sources
26. Almost optimal dispersers
27. Construction of extractors using pseudo-random generators
28. p minimization problems
29. Graph theoretic properties in computational complexity
30. Expanders that beat the eigenvalue bound: Explicit construction and applications
31. General weak random sources
32. Simulating BPP using a general weak random source
33. Randomness-optimal oblivious sampling