• Publications
  • Influence
Randomness is Linear in Space
TLDR
We show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bits can be simulated using onlyO(S). Expand
  • 647
  • 57
  • PDF
Linear degree extractors and the inapproximability of max clique and chromatic number
TLDR
We use our dispersers to derandomize results of Hastad [23] and Feige-Kilian [19] and show that for all ε>0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1-ε are NP-hard. Expand
  • 686
  • 43
  • PDF
An XOR-based erasure-resilient coding scheme
An (m; n; b; r)-erasure-resilient coding scheme consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of n packets eachExpand
  • 454
  • 38
  • PDF
Optimal speedup of Las Vegas algorithms
TLDR
The authors describe a simple universal strategy S/sup univ/, with the property that, for any algorithm A, T(A,S) is the best performance that can be achieved, up to a constant factor, by any universal strategy. Expand
  • 303
  • 24
  • PDF
Loss-less condensers, unbalanced expanders, and extractors
TLDR
An extractor is a procedure which extracts randomness from a random source using a few additional random bits. Expand
  • 137
  • 20
  • PDF
How to recycle random bits
TLDR
It is shown that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. Expand
  • 401
  • 19
  • PDF
Randomness-optimal oblivious sampling
TLDR
We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Expand
  • 141
  • 15
  • PDF
Optimal Speedup of Las Vegas Algorithms
TLDR
A is a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose running time is a random variable. Expand
  • 199
  • 13
Computing with very weak random sources
TLDR
For any fixed /spl epsiv/>0, we show how to simulate RP algorithms in time n/sup O(log n/) using the output of a /spl delta/-source with min-entropy R/sup /spl Omega/(1/), which is optimal. Expand
  • 121
  • 11
  • PDF
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography
TLDR
We give an efficient deterministic algorithm that extracts almost-random bits from sources where $n^{\frac{1}{2}+\gamma} of the $n$ bits are uniformly random and the rest are fixed in advance. Expand
  • 142
  • 10
  • PDF