On the error parameter of dispersers

Authors:
Ronen Gradwohl;Guy Kindler;Omer Reingold;Amnon Ta-Shma
Affiliations:
Department of Computer Science and Applied Math, Weizmann Institute of Science;Institute for Advanced Study, Princeton;Department of Computer Science and Applied Math, Weizmann Institute of Science;School of Computer Science, Tel-Aviv University
Venue:
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
Year:
2005

Citing 16
Cited 1

Explicit expanders and the Ramanujan conjectures

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Expanders, randomness, or time versus space

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Better expansion for Ramanujan graphs

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
More deterministic simulation in logspace

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Almost optimal dispersers

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tiny families of functions with random properties: a quality-size trade-off for hashing

Proceedings of the workshop on Randomized algorithms and computation
Extracting randomness: a survey and new constructions

Journal of Computer and System Sciences
Loss-less condensers, unbalanced expanders, and extractors

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Tight bounds for depth-two superconcentrators

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Error Reduction for Extractors

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

FOCS '00 Proceedings of the 41st Annual 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
Dispersers, deterministic amplification, and weak random sources

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
General weak random sources

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Computing with very weak random sources

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

How many oblivious transfers are needed for secure multiparty computation?

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in some parameters. Our constructions are not strong, but we show that having such explicit strong constructions implies a solution to the Ramsey graph construction problem.