Lossless condensers, unbalanced expanders, and extractors

Combinatorica

Volumn 27, Issue 2, 2007, Pages 213-240

  Ta Shma, Amnon ^a   Umans, Christopher ^b   Zuckerman, David ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34248175874     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-007-0053-2     Document Type: Article

References (43)

1. M. AJTAI, J. KOMLÓS and E. SZEMERÉ DI: Sorting in c log n, parallel steps, Combinatorica 3 (1983), 1-19.
2. M. AJTAI, J. KOMLÓS and E. SZEMERÉ DI: Deterministic simulation in Logspace, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 132-140, 1987.
3. N. ALON: Personal communication, 1999.
4. S. ARORA, F. T. LEIGHTON and B. M. MAGGS: On-line algorithms for path selection in a nonblocking network, SIAM Journal on Computing 25(3) (1996), 600-625.
5. H. BUHRMAN, P. B. MILTERSEN, J. RADHAKRISHNAN and S. VENKATESH: Are bitvectors optimal?, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 449-458, 2000.
6. M. CAPALBO, O. REINGOLD, S. VADHAN and A. WIGDERSON: Randomness conductors and constant-degree expansion beyond the degree/2 barrier, in Proceedings of the 84th Annual ACM Symposium on Theory of Computing, pages 659-668, 2002.
7. P. FELDMAN, J. FRIED MAN and N. PIPPENGER: Wide-sense nonblocking networks, SIAM Journal on Discrete Mathematics 1 (1988), 158-173.
8. O. GABBER and Z. GALIL: Explicit construction of linear sized superconcentrators, Journal of Computer and System Sciences 22 (1981), 407-420.
9. O. GOLDREICH, R. IMPAGLIAZZO, L. LEVIN, R. VENKATESAN and D. ZUCKERMAN: Security preserving amplification of hardness, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 318-326, 1990.
10. R. IMPAGLIAZZO, R. SHALTIEL and A. WIGDERSON: Near-optimal conversion of hardness into pseudo-randomness, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 181-190, 1999.
11. R. IMPAGLIAZZO, R. SHALTIEL and A. WIGDERSON: Extractors and pseudo-random generators with optimal seed length, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 1-10, 2000.
12. R. IMPAGLIAZZO and A. WIGDERSON: P = BPP unless E has subexponential circuits: derandomizing the XOR. lemma; in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
13. N. KAHALE: Eigenvalues and expansion of regular graphs, Journal of the ACM 42 (1995), 1091-1106.
14. C. LU, O. REINGOLD, S. VADHAN and A. WIGDERSON: Extractors: Optimal up to constant factors; in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003.
15. G. A. MARGULIS: Explicit construction of concentrators, Problems of Information Transmission 9 (1973), 325-332.
16. N. NISAN and A. TA-SHMA: Extracting randomness: A survey and new constructions; Journal of Computer and System Sciences 58 (1999), 148-173.
17. N. NISAN and A. WIGDERSON: Hardness vs. randomness, Journal of Computer and System Sciences 49 (1994), 149-167.
18. N. NISAN and D. ZUCKERMAN: Randomness is linear in space, Journal of Computer and System Sciences 52(1) (1996), 43-52.
19. N. PIPPENGER: Sorting and selecting in rounds, SIAM Journal on Computing 16(6) (1987), 1032-1038.
20. J. RADHAKRISHNAN and A. TA-SHMA: Bounds for dispersera, extractors, and depth-two superconcentrators; SIAM Journal on Discrete Mathematics 13(1) (2000), 2-24.
21. R. RAZ: Extractors with weak random seeds, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 11-20, 2005.
22. R. RAZ and O. REINGOLD: On recycling the randomness of states in space bounded computation, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 159-168, 1999.
23. R. RAZ, O. REINGOLD and S. VADHAN: Extracting all the randomness and reducing the error in Trevisan's extractors, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 149-158, 1999.
24. O. REINGOLD, R. SHALTIEL and A. WIGDERSON: Extracting randomness via repeated condensing, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 22-31, 2000.
25. M. SAKS, A. SRINIVASAN and S. ZHOU: Explicit OR-dispersers with polylog degree, Journal of the ACM 45 (1998), 123-154.
26. M. SANTHA: On using deterministic functions in probabilistic algorithms, Information and Computation 74(3) (1987), 241-249.
27. R. SHALTIEL and C. UMANS: Simple extractors for all min-entropies and a new pseudorandom generator, Journal of the ACM 52 (2005), 172-216.
28. M. SIPSER: Expanders, randomness, or time vs. space; Journal of Computer and System Sciences 36 (1988), 379-383.
29. M. SIPSER and D. A. SPIELMAN: Expander codes, IEEE Transactions on Information Theory 42(6) (1996), 1710-1722.
30. A. SRINIVASAN and D. ZUCKERMAN: Computing with very weak random sources, SIAM Journal on Computing 28 (1999), 1433-1459.
31. M. SUDAN, L. TREVISAN and S. VADHAN: Pseudorandom generators without the XOR lemma, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 537-546, 1999.
32. A. TA-SHMA: On extracting randomness from weak random sources, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 276-285, 1996.
33. A. TA-SHMA: Almost optimal dispersers, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 196-202, 1998.
34. A. TA-SHMA, D. ZUCKERMAN and S. SAFRA: Extractors from Reed-Muller codes, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 638-647, 2001.
35. L. TREVISAN: Construction of extractors using pseudo-random generators, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 141-148, 1999.
36. p minimization problems, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science., pages 465-474, 1999.
37. C. UMANS: Pseudo-random generators for all hardnesses, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 627-634, 2002.
38. C. UMANS: Reconstructive dispersers and hitting set generators, in APPROX-RANDOM, pages 460-471, 2005.
39. L. G. VALIANT: Graph theoretic properties in computational complexity, Journal of Computer and System Sciences 13 (1976), 278-285.
40. A. WIGDERSON and D. ZUCKERMAN: Expanders that beat the eigenvalue bound: Explicit construction and applications, Combinatorica 19(1) (1999), 125-138.
41. D. ZUCKERMAN: General weak random sources, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 534-543, 1990.
42. D. ZUCKERMAN: Simulating BPP using a general weak random source, Algorithmica 16 (1996), 367-391.
43. D. ZUCKERMAN: Randomness-optimal oblivious sampling, Random Structures and Algorithms 11 (1997), 345-367.