On the error parameter of dispersers

Ronen Gradwohl; Guy Kindler; Orner Reingold; Amnon Ta-Shma

doi:10.1007/11538462_25

On the error parameter of dispersers

Ronen Gradwohl, Guy Kindler, Orner Reingold, Amnon Ta-Shma

Research output: Contribution to journal › Conference article › peer-review

5 Scopus citations

Abstract

Optimal dispersere 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.

Original language	English
Pages (from-to)	294-305
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	3624
DOIs	https://doi.org/10.1007/11538462_25
State	Published - 2005
Externally published	Yes
Event	8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005 - Berkeley, CA, United States Duration: 22 Aug 2005 → 24 Aug 2005

Access to Document

10.1007/11538462_25

Cite this

@article{7e559d8f98cf49698e1cb900efb9d181,

title = "On the error parameter of dispersers",

abstract = "Optimal dispersere 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.",

author = "Ronen Gradwohl and Guy Kindler and Orner Reingold and Amnon Ta-Shma",

year = "2005",

doi = "10.1007/11538462_25",

language = "אנגלית",

volume = "3624",

pages = "294--305",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

note = "8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005 ; Conference date: 22-08-2005 Through 24-08-2005",

}

TY - JOUR

T1 - On the error parameter of dispersers

AU - Gradwohl, Ronen

AU - Kindler, Guy

AU - Reingold, Orner

AU - Ta-Shma, Amnon

PY - 2005

Y1 - 2005

N2 - Optimal dispersere 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.

AB - Optimal dispersere 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.

UR - http://www.scopus.com/inward/record.url?scp=26944464561&partnerID=8YFLogxK

U2 - 10.1007/11538462_25

DO - 10.1007/11538462_25

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:26944464561

SN - 0302-9743

VL - 3624

SP - 294

EP - 305

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005

Y2 - 22 August 2005 through 24 August 2005

ER -

On the error parameter of dispersers

Abstract

Access to Document

Other files and links

Fingerprint

Cite this