Sciweavers

8 search results - page 1 / 2
» Deterministic extractors for small-space sources
Sort
View
STOC
2006
ACM
78views Algorithms» more  STOC 2006»
14 years 5 months ago
Deterministic extractors for small-space sources
Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zucke...
ECCC
2011
183views ECommerce» more  ECCC 2011»
12 years 12 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
13 years 8 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 5 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
FOCS
2004
IEEE
13 years 8 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson