Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Extracting randomness via repeated condensing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Extracting Randomness Using Few Independent Sources
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Extractors with weak random seeds
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
Constructing Ramsey Graphs from Boolean Function Representations
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
IEEE Transactions on Information Theory
Extractors for a constant number of polynomially small min-entropy independent sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Increasing the Output Length of Zero-Error Dispersers
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A 2-Source Almost-Extractor for Linear Entropy
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Extractors for Three Uneven-Length Sources
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Affine dispersers from subspace polynomials
Proceedings of the forty-first annual ACM symposium on Theory of computing
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Journal of the ACM (JACM)
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Journal of Computer and System Sciences
From affine to two-source extractors via approximate duality
Proceedings of the forty-third annual ACM symposium on Theory of computing
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
The size Ramsey number of a directed path
Journal of Combinatorial Theory Series B
Improving the Hadamard extractor
Theoretical Computer Science
Some recent results on Ramsey-type numbers
Discrete Applied Mathematics
New independent source extractors with exponential improvement
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The main result of this paper is an explicit disperser for two independent sources on n bits, each of entropy k=no(1). Put differently, setting N=2n and K=2k, we construct explicit N x N Boolean matrices for which no K x K submatrix is monochromatic. Viewed as adjacency matrices of bipartite graphs, this gives an explicit construction of K-Ramsey bipartite graphs of size N.This greatly improves the previous bound of k=o(n) of Barak, Kindler, Shaltiel, Sudakov and Wigderson [4]. It also significantly improves the 25-year record of k = Õ (√n) on the special case of Ramsey graphs, due to Frankl and Wilson [9].The construction uses (besides "classical" extractor ideas) almost all of the machinery developed in the last couple of years for extraction from independent sources, including:Bourgain's extractor for 2 independent sources of some entropy rate Raz's extractor for 2 independent sources, one of which has any entropy rate 1/2 [18]Rao's extractor for 2 independent block-sources of entropy nΩ (1) [17]The "Challenge-Response" mechanism for detecting "entropy concentration" of [4].The main novelty comes in a bootstrap procedure which allows the Challenge-Response mechanism of [4] to be used with sources of less and less entropy, using recursive calls to itself. Subtleties arise since the success of this mechanism depends on restricting the given sources, and so recursion constantly changes the original sources. These are resolved via a new construct, in between a disperser and an extractor, which behaves like an extractor on sufficiently large subsources of the given ones.This version is only an extended abstract, please see the full version, available on the authors' homepages, for more details.