Tight bounds for depth-two superconcentrators

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 585-594

  Radhakrishnan, Jaikumar ^a   Ta Shma, Amnon ^a  

^a Tata Istitute of Fundamental Research   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBABILITY;

DEPTH TWO SUPERCONCENTRATORS; DISJOINT DISPERSER GRAPHS;

GRAPH THEORY;

EID: 0031351738     PISSN: 02725428     EISSN: None     Source Type: None    
DOI: 10.1109/SFCS.1997.646148     Document Type: Conference Paper

References (20)

1. N Alon P. Pudlak Superconcentrators of depths 2 and 3; odd levels help (rarely) Journal of Computer and System Sciences 48 194 202 1994
2. B. Bollobás Extremal Graph Theory 1 1978 Academic Press London
3. D. Dolev C. Dwork N. Pippenger A. Wigderson Superconcentrators, generalizers and generalized connectors with limited depth ACM Symposium on Theory of Computing (STOC) 42 51 ACM Symposium on Theory of Computing (STOC) 1983
4. 0. Goldreich A. Wigderson Tiny families of functions with random properties: A quality-size trade-off for hashing Proceedings of the 26th Annual ACM Symposium on the Theory of Computing 574 583 Proceedings of the 26th Annual ACM Symposium on the Theory of Computing 1994 ACM
5. G. Hansel Nombre minimal de contacts de fermature nécessaires pour réaliser une fonction booléenne symétrique de n variables C. R. Acad. Sci. Paris 258 6037 6040 1964
6. G. Katona E. Szemeredi On a problem of graph theory Studia Sci. Math. Hungarica 2 23 28 1967
7. E. Meshulam A geometric construction of a superconcentrator of depth 2 Theoretical Computer Science 32 215 219 1984
8. N. Nisan Refining randomness: How and why IEEE Conference on Computational Complexity 44 58 IEEE Conference on Computational Complexity 1996
9. N. Nisan A. Wigderson Research pearls in theory of computation: Homework 2, problem 2 http://www.cs.huji.ac il/course/pearls/
10. N. Nisan D. Zuckerman More deterministic simulation in logspace Proceedings of the 25th Annual ACM Symposium on the Theory of Computing 235 244 Proceedings of the 25th Annual ACM Symposium on the Theory of Computing 1993 ACM
11. N. Pippenger Superconcentrators SIAM Journal on Computing 298 304 1977
12. N. Pippenger Superconcentrators of depth 2 Journal of Computer and System Sciences 24 82 90 1982
13. N. Pippenger Sorting and selecting in rounds SIAM Journal on Computing 16 1032 1038 1987
14. P. Pudlak Communication in bounded depth circuits Combinatorica 14 2 203 216 1994
15. M. Sipser Expanders, randomness, or time versus space Journal of Computer and System Sciences 36 379 383 1988
16. D. Spielman Linear time encodable and de-codable error-correcting codes IEEE Trans. on Information Theory 42 6 1723 1731 November 1996
17. A. Ta-Shma On extracting randomness from weak random sources STOC 1996 276 285 STOC 1996 1996-May
18. A. Ta-Shma Refining Randomness June 1996 The Hebrew University Jerusalem
19. L. Valiant Graph-theoretic properties in computational complexity Journal of Computer and System Sciences 13 278 285 1976
20. A. Wigderson D. Zuckerman Expanders that beat the eigenvalue bound: Explicit construction and applications Proceedings of the 25th Annual ACM Symposium on the Theory of Computing 245 251 Proceedings of the 25th Annual ACM Symposium on the Theory of Computing 1993 ACM