Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On using deterministic functions to reduce randomness in probabilistic algorithms
Information and Computation
Sorting and selecting in rounds
SIAM Journal on Computing
Expanders, randomness, or time versus space
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
Sorting in c log n parallel steps
Combinatorica
Journal of Computer and System Sciences
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Journal of Computer and System Sciences
On-line Algorithms for Path Selectionin a Nonblocking Network
SIAM Journal on Computing
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of 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
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
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Extracting randomness via repeated condensing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory - Part 1
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIGACT news complexity theory comun 37
ACM SIGACT News
SIGACT news complexity theory column 38
ACM SIGACT News
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
On the complexity of approximating the VC dimension
Journal of Computer and System Sciences - Complexity 2001
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Error-Correcting Codes and Pseudorandom Projections
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cooperative asynchronous update of shared memory
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Extractors for a constant number of polynomially small min-entropy independent sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of 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
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Compression of samplable sources
Computational Complexity
Language compression and pseudorandom generators
Computational Complexity
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
The unified theory of pseudorandomness: guest column
ACM SIGACT News
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Domain extension of public random functions: beyond the birthday Barrier
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Simpler constant-seed condensers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ACM Transactions on Algorithms (TALG)
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Cryptography in constant parallel time
Cryptography in constant parallel time
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Better short-seed quantum-proof extractors
Theoretical Computer Science
Optimization problems in the polynomial-time hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the error parameter of dispersers
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Reconstructive dispersers and hitting set generators
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hi-index | 0.06 |
An extractor is a procedure which extracts randomness from a detective random source using a few additional random bits. Explicit extractor constructions have numerous applications and obtaining such constructions is an important derandomization goal. Trevisan recently introduced an elegant extractor construction, but the number of truly random bits required is suboptimal when the input source has low-min-entropy. Significant progress toward overcoming this bottleneck has been made, but so far has required complicated recursive techniques that lose the simplicity of Trevisan's construction. We give a clean method for overcoming this bottleneck by constructing {\em loss-less condensers}. which compress the n-bit input source without losing any min-entropy, using O(\log n) additional random bits. Our condensers are built using a simple modification of Trevisan's construction, and yield the best extractor constructions to date.Loss-less condensers also produce unbalanced bipartite expander graphs with small (polylogarithmic) degree D and very strong expansion of (1-\epilon)D. We give other applications of our construction, including dispersers with entropy loss O(\log n), depth two super-concentrators whose size is within a polylog of optimal, and an improved hardness of approximation result.