A new family of Cayley expanders (?)
暂无分享,去创建一个
[1] Noga Alon,et al. Better Expanders and Superconcentrators , 1987, J. Algorithms.
[2] Moshe Morgenstern,et al. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.
[3] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, Journal of computer and system sciences (Print).
[4] O. Ore. SOME REMARKS ON COMMUTATORS , 1951 .
[5] Gábor Hetyei,et al. On the diameter of finite groups , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[6] Igor Pak,et al. The Product Replacement Algorithm and Kazhdan's Property (t) , 1999 .
[7] Benjamin Weiss,et al. Groups and Expanders , 1992, Expanding Graphs.
[8] Akira Maruoka,et al. Expanders obtained from affine transformations , 1985, STOC '85.
[9] Alexander Lubotzky,et al. Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.
[10] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[11] A. Yao,et al. Rearrangeable Networks with Limited Depth , 1982 .
[12] Maria M. Klawe,et al. Limitations on Explicit Constructions of Expanding Graphs , 1984, SIAM J. Comput..
[13] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[14] Alasdair Urquhart,et al. Hard examples for resolution , 1987, JACM.
[15] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[16] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[18] M. Pinsker,et al. On the complexity of a concentrator , 1973 .
[19] János Komlós,et al. Sorting in c log n parallel sets , 1983, Comb..
[20] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[21] Pham Do Tuan,et al. On the estimation of Fourier coefficients. , 1969 .
[22] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1993, Comb..
[23] Alan Williamson,et al. The Probability of Generating the Symmetric Group , 1978 .
[24] Leonid A. Levin,et al. Security preserving amplification of hardness , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[25] Avi Wigderson,et al. Expanders from symmetric codes , 2002, STOC '02.
[26] M. Eichler,et al. Quaternäre quadratische Formen und die Riemannsche Vermutung fÜr die Kongruenzzetafunktion , 1954 .
[27] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .
[28] Peter Winkler,et al. Mixing times , 1997, Microsurveys in Discrete Probability.
[29] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[30] Nicholas Pippenger,et al. Sorting and Selecting in Rounds , 1987, SIAM J. Comput..
[31] M. Minerva. Semi-direct product in groups and Zig-zag product in graphs: Connections and applications , 2002 .
[32] M. Murty. Ramanujan Graphs , 1965 .
[33] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[34] Noam Nisan,et al. Pseudorandomness for network algorithms , 1994, STOC '94.
[35] P. Diaconis,et al. On the eigenvalues of random matrices , 1994, Journal of Applied Probability.
[36] James W. Roberts,et al. Uniformly exhaustive submeasures and nearly additive set functions , 1983 .
[37] Y. Cho,et al. Discrete Groups , 1994 .
[38] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[39] R. M. Tanner. Explicit Concentrators from Generalized N-Gons , 1984 .
[40] Eli Ben-Sasson,et al. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.
[41] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..