Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
暂无分享,去创建一个
Avi Wigderson | Omer Reingold | Salil P. Vadhan | A. Wigderson | S. Vadhan | O. Reingold | Omer Reingold
[1] James W. Roberts,et al. Uniformly exhaustive submeasures and nearly additive set functions , 1983 .
[2] Miklos Santha,et al. Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..
[3] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..
[4] Manuel Blum,et al. Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..
[5] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[6] Alexander Lubotzky,et al. Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.
[7] Manuel Blum. Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..
[8] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[9] Avi Wigderson,et al. Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.
[10] Noga Alon,et al. Better Expanders and Superconcentrators , 1987, J. Algorithms.
[11] Noga Alon,et al. Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory , 1986, Comb..
[12] Noam Nisan,et al. Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[13] Oded Goldreich,et al. A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..
[14] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[15] E. Szemerédi,et al. Sorting inc logn parallel steps , 1983 .
[16] Avi Wigderson,et al. Extracting randomness via repeated condensing , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[17] Miklós Ajtai,et al. Recursive construction for 3-regular expanders , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[18] A. Nilli. On the second eigenvalue of a graph , 1991 .
[19] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[20] Avi Wigderson,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..
[21] Avi Wigderson,et al. Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.
[22] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1999, Comb..
[23] M. Murty. Ramanujan Graphs , 1965 .
[24] Joel Friedman,et al. On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..
[25] Benjamin Weiss,et al. Groups and Expanders , 1992, Expanding Graphs.
[26] A. Yao,et al. Rearrangeable Networks with Limited Depth , 1982 .
[27] Andrei Z. Broder,et al. On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[28] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[29] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[30] Igor Pak,et al. The Product Replacement Algorithm and Kazhdan's Property (t) , 1999 .
[31] Noam Nisan,et al. Pseudorandomness for network algorithms , 1994, STOC '94.
[32] V. Shoup. New algorithms for finding irreducible polynomials over finite fields , 1990 .
[33] Noga Alon,et al. Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.
[34] Amnon Ta-Shma. Almost Optimal Dispersers , 2002, Comb..
[35] D. Spielman,et al. Expander codes , 1996 .
[36] D. Zuckerman,et al. Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.
[37] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[38] Nicholas Pippenger,et al. Sorting and Selecting in Rounds , 1987, SIAM J. Comput..
[39] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[40] A. Wigderson,et al. ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.
[41] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[42] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[43] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[44] M. Gromov. Filling Riemannian manifolds , 1983 .
[45] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[46] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[47] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[48] Jaikumar Radhakrishnan,et al. Tight bounds for depth-two superconcentrators , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[49] Luca Trevisan,et al. Construction of extractors using pseudo-random generators (extended abstract) , 1999, STOC '99.
[50] Ran Raz,et al. Error reduction for extractors , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[51] Leonid A. Levin,et al. Security preserving amplification of hardness , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[52] 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.
[53] Ran Raz,et al. On recycling the randomness of states in space bounded computation , 1999, STOC '99.
[54] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[55] Vijay V. Vazirani,et al. Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[56] R. M. Tanner. Explicit Concentrators from Generalized N-Gons , 1984 .
[57] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[58] A. Wigderson,et al. Disperser graphs, deterministic amplification, and imperfect random sources (גרפים מפזרים, הגברה דטרמיניסטית ומקורות אקראים חלשים.) , 1991 .
[59] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[60] Noga Alon,et al. Semi-direct product in groups and zig-zag product in graphs: connections and applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[61] Ran Canetti,et al. Lower Bounds for Sampling Algorithms for Estimating the Average , 1995, Inf. Process. Lett..
[62] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[63] Akira Maruoka,et al. Expanders obtained from affine transformations , 1987, Comb..
[64] David Zuckerman,et al. Simulating BPP using a general weak random source , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[65] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .
[66] M. Pinsker,et al. On the complexity of a concentrator , 1973 .