Searching for authors named "David Zuckerman" – sorted by Relevance.
-
On Unapproximable Versions of NP-Complete Problems
- ON UNAPPROXIMABLE VERSIONS OF NP-COMPLETE PROBLEMS DAVID ZUCKERMAN y Abstract. We prove
- Cited by 31 (1 self) – Add To MetaCart
-
On the Time to Traverse All Edges of a Graph
- On the Time to Traverse All Edges of a Graph David Zuckerman Division of Computer Science
- Cited by 5 (0 self) – Add To MetaCart
-
Simulating BPP Using a General Weak Random Source
- Simulating BPP Using a General Weak Random Source David Zuckerman y Dept. of Computer Sciences
- Cited by 84 (16 self) – Add To MetaCart
-
A Technique for Lower Bounding the Cover Time
- A Technique for Lower Bounding the Cover Time David Zuckerman* Division of Computer Science
- Cited by 22 (2 self) – Add To MetaCart
-
Randomness-Optimal Oblivious Sampling
- Randomness-Optimal Oblivious Sampling David Zuckerman y July 7, 1997 Abstract We present
- Cited by 18 (0 self) – Add To MetaCart
-
Multiple Cover Time
- Multiple Cover Time Peter Winkler 1 and David Zuckerman 2 Abstract Motivated by applications
- Cited by 4 (0 self) – Add To MetaCart
-
Extractors for Three Uneven-Length Sources
- Extractors for Three Uneven-Length Sources Anup Rao ⋆,1 and David Zuckerman ⋆⋆,2 1 School
- Cited by 1 (0 self) – Add To MetaCart
-
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography
- JESSE KAMP AND DAVID ZUCKERMAN fixed bits of the source, these steps will not hurt us. Therefore
- Cited by 27 (3 self) – Add To MetaCart
-
How to Recycle Random Bits
- How to Recycle Random Bits Russell Impagliazzo David Zuckerman y Abstract We show
- Cited by 148 (10 self) – Add To MetaCart
-
Randomness is Linear in Space
- Randomness is Linear in Space Noam Nisan y David Zuckerman z Abstract We show that any
- Cited by 153 (16 self) – Add To MetaCart

