Partition Expanders
暂无分享,去创建一个
[1] Brendan D. McKay,et al. Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..
[2] Avi Wigderson,et al. Monotone Expanders: Constructions and Applications , 2010, Theory Comput..
[3] Noam Nisan,et al. Pseudorandomness for network algorithms , 1994, STOC '94.
[4] Alexander Russell,et al. Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem , 2004, Electron. J. Comb..
[5] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[7] Ronald de Wolf,et al. Simultaneous Communication Protocols with Quantum and Classical Messages , 2008, Chic. J. Theor. Comput. Sci..
[8] N. Wormald,et al. Models of the , 2010 .
[9] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[10] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[11] A. Naor,et al. Nonlinear spectral calculus and super-expanders , 2012, 1207.4705.
[12] A. Hoffman,et al. The variation of the spectrum of a normal matrix , 1953 .
[13] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[14] Ziv Bar-Yossef,et al. Information theory methods in communication complexity , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.