Introduction to finite fields and their applications
Introduction to finite fields and their applications
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Tiny families of functions with random properties: a quality-size trade-off for hashing
Proceedings of the workshop on Randomized algorithms and computation
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
A Chernoff Bound for Random Walks on Expander Graphs
SIAM Journal on Computing
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Computing with Very Weak Random Sources
SIAM Journal on Computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Storing information with extractors
Information Processing Letters
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Extracting Randomness via Repeated Condensing
SIAM Journal on Computing
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs
Random Structures & Algorithms
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
Better lossless condensers through derandomized curve samplers
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Combinatorial bounds for list decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
IEEE Transactions on Information Theory
Efficient and robust compressed sensing using optimized expander graphs
IEEE Transactions on Information Theory
Guest column: from randomness extraction to rotating needles
ACM SIGACT News
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Journal of the ACM (JACM)
Pseudorandom financial derivatives
Proceedings of the 12th ACM conference on Electronic commerce
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Kolmogorov Complexity in Randomness Extraction
ACM Transactions on Computation Theory (TOCT)
Domain extension for MACs beyond the birthday barrier
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Pseudo-random graphs and bit probe schemes with one-sided error
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Leftover Hash Lemma, revisited
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Extractors and lower bounds for locally samplable sources
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Better short-seed quantum-proof extractors
Theoretical Computer Science
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Design extractors, non-malleable condensers and privacy amplification
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
SIAM Journal on Matrix Analysis and Applications
The Complexity of Distributions
SIAM Journal on Computing
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
New independent source extractors with exponential improvement
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Robust pseudorandom generators
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
Hi-index | 0.07 |
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous constructions of Ta-Shma et al. [2007] required at least one of these to be quasipolynomial in the optimal. Our expanders have a short and self-contained description and analysis, based on the ideas underlying the recent list-decodable error-correcting codes of Parvaresh and Vardy [2005]. Our expanders can be interpreted as near-optimal “randomness condensers,” that reduce the task of extracting randomness from sources of arbitrary min-entropy rate to extracting randomness from sources of min-entropy rate arbitrarily close to 1, which is a much easier task. Using this connection, we obtain a new, self-contained construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al. [2003] and improving upon it when the error parameter is small (e.g., 1/poly(n)).