Randomness conductors and constant-degree lossless expanders

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 659-668

  Capalbo, Michael ^a   Reingold, Omer ^b   Vadhan, Salil ^c   Wigderson, Avi ^d  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c HARVARD UNIVERSITY   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS; RANDOM PROCESSES;

CONSTANT DEGREE LOSSLESS EXPANDERS; EXPANSION FACTOR; RANDOMNESS CONDUCTORS;

GRAPH THEORY;

EID: 0036041924     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510002.510003     Document Type: Conference Paper

References (36)

1. Pseudorandom generators in propositional proof complexity
2. Lower bounds for polynomial calculus: Non-binomial case
3. Eigenvalues and expanders
4. Eigenvalues, expanders and superconcentrators (extended abstract)
5. On-line algorithms for path selection in a nonblocking network
6. Propositional proof complexity: Past, present and future
7. Short proofs are narrow-resolution made simple
8. Static and dynamic path selection on expander graphs: A random walk approach
9. Are bitvectors optimal?
10. Explicit constant-degree unique-neighbor expanders
11. Unbiased bits from sources of weak randomness and probabilistic communication complexity
12. Many hard examples for resolution
13. Tiny families of functions with random properties: A quality-size trade-off for hashing
14. Eigenvalues and expansion of regular graphs
15. Ramanujan graphs
16. Improved low-density parity-check codes using irregular graphs
17. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators
18. Randomness is linear in space
19. Constructing disjoint paths on expander graphs
20. Sorting and selecting in rounds
21. Tight bounds for depth-two superconcentrators
22. On recycling the randomness of the states in space bounded computation
23. Extracting all the randomness and reducing the error in Trevisan's extractors
24. Extracting randomness via repeated condensing
25. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
26. Expanders, randomness, or time versus space
27. Expander codes
28. Linear-time encodable and decodable error-correcting codes
29. Computing with very weak random sources
30. Loss-less condensers, unbalanced expanders, and extractors
31. Explicit concentrators from generalized n-gons
32. Extractors and pseudorandom generators
33. On the complexity of derivations in propositional calculus
34. How to share memory in a distributed system
35. Hard examples for resolution