|
474
|
A pseudorandom generator from any one-way function
– stad, Impagliazzo, et al.
- 1999
|
|
266
|
A simple parallel algorithm for the maximal independent set problem
– Luby
- 1986
|
|
167
|
How to recycle random bits
– Impagliazzo, Zuckerman
- 1989
|
|
126
|
Randomness is linear in space
– Nisan, Zuckerman
- 1996
|
|
125
|
Unbiased bits from sources of weak randomness and probabilistic communication complexity
– Chor, Goldreich
- 1988
|
|
115
|
Pseudorandom Generators for Space Bounded Computation
– Nisan
- 1992
|
|
95
|
Simulating BPP using a general weak random source
– Zuckerman
- 1996
|
|
87
|
Deterministic simulation in Logspace
– Ajtai, Komlós, et al.
- 1987
|
|
82
|
Dispersers, deterministic amplification, and weak random sources
– Cohen, Wigderson
- 1989
|
|
82
|
Explicit construction of linear sized superconcentrators
– Gabber, Galil
- 1981
|
|
79
|
Expanders that beat the eigenvalue bound: explicitconstruction and applications
– WIGDERSON, ZUCKERMAN
- 1999
|
|
70
|
Computing with very weak random sources
– Srinivasan, Zuckerman
- 1999
|
|
63
|
Generating quasi-random sequences from semi-random sources
– Santha, Vazirani
- 1986
|
|
62
|
Optimal algorithms for byzantine agreement
– Feldman, Micali
- 1988
|
|
55
|
On extracting randomness from weak random sources
– Ta-Shma
- 1996
|
|
50
|
A chernoff bound for random walks on expander graphs
– Gillman
- 1998
|
|
47
|
Extracting randomness: How and why: A survey
– Nisan
- 1996
|
|
47
|
General weak random sources
– Zuckerman
- 1990
|
|
44
|
Independent unbiased coin flips from a correlated biased source: a finite Markov chain
– Blum
- 1986
|
|
44
|
Randomness-efficient oblivious sampling
– Bellare, Rompel
- 1994
|
|
27
|
Randomness in Interactive Proofs
– Bellare, Goldreich, et al.
- 1993
|
|
20
|
Expanders, randomness or time vs space
– Sipser
- 1986
|
|
19
|
A robust noncryptographic protocol for collective coin-flipping
– Saks
- 1989
|
|
17
|
Lower bounds for sampling algorithms for estimating the average
– Canetti, Even, et al.
- 1995
|
|
15
|
On the power of two-point sampling
– Chor, Goldreich
|
|
15
|
Fast perfect-information leader-election protocols with linear immunity
– Cooper, Linial
- 1995
|
|
14
|
Explicit dispersers with polylog degree
– Saks, Srinivasan, et al.
- 1995
|
|
12
|
Coin-flipping games immune against linear-sized coalitions
– Alon, Naor
- 1993
|
|
11
|
Simple and efficient leader election in the full information model
– Ostrovsky, Rajagopalan, et al.
- 1994
|
|
11
|
On using deterministic functions in probabilistic algorithms
– Santha
- 1987
|
|
8
|
Perfect-information leader election with optimal resilience
– Boppana, Narayanan
- 2000
|
|
3
|
Pseudorandomness for space-bounded computations, Unpublished manuscript
– Armoni, Wigderson
- 1996
|
|
3
|
Tiny families of families with random properties: A qualitysize trade-off for hashing, Random Structures and Algorithms 11
– Goldreich, Wigderson
- 1997
|
|
