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

פרסום מחקרי: פרסום בכתב עת › מאמר מכנס › ביקורת עמיתים

5 ציטוטים ‏(Scopus)

תקציר

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.

שפה מקורית	אנגלית
עמודים (מ-עד)	294-305
מספר עמודים	12
כתב עת	Lecture Notes in Computer Science
כרך	3624
מזהי עצם דיגיטלי (DOIs)	https://doi.org/10.1007/11538462_25
סטטוס פרסום	פורסם - 2005
פורסם באופן חיצוני	כן
אירוע	8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005 - Berkeley, CA, ארצות הברית משך הזמן: 22 אוג׳ 2005 → 24 אוג׳ 2005

גישה למסמך

10.1007/11538462_25

קבצים וקישורים אחרים

Link to publication in Scopus

פורמט ציטוט ביבליוגרפי

@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",

publisher = "Springer Science and Business Media Deutschland GmbH",

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

תקציר

גישה למסמך

קבצים וקישורים אחרים

טביעת אצבע

פורמט ציטוט ביבליוגרפי