Zuckerman, David - Department of Computer Sciences, University of Texas at Austin

Advanced Search

Zuckerman, David - Department of Computer Sciences, University of Texas at Austin

List-Decoding Reed-Muller Codes over Small Fields Parikshit Gopalan
Randomness is Linear in Space \Lambda Noam Nisan y David Zuckerman z
Pseudorandom Financial Derivatives [Extended Abstract]
A Technique for Lower Bounding the Cover Time David Zuckerman*
Optimal Speedup of Las Vegas Algorithms y Michael Luby z Alistair Sinclair x David Zuckerman --
LOWER BOUNDS FOR LEADER ELECTION AND COLLECTIVE COIN-FLIPPING IN THE PERFECT INFORMATION MODEL
Lower Bounds for Randomized Mutual Exclusion \Lambda Eyal Kushilevitz y Yishay Mansour z Michael O. Rabin x David Zuckerman --
Randomness is Linear in Space Noam Nisan
SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 5, pp. 12311247
Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications \Lambda
Simulating BPP Using a General Weak Random Source \Lambda David Zuckerman y
How to Recycle Random Bits Russell Impagliazzo \Lambda David Zuckerman y
Multiple Cover Time Peter Winkler 1 and David Zuckerman 2
ON UNAPPROXIMABLE VERSIONS OF NPCOMPLETE PROBLEMS \Lambda
Lossless Condensers, Unbalanced Expanders, and Extractors Amnon TaShma # Christopher Umans + David Zuckerman #
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions
Perfect Information Leader Election in log n + O(1) Rounds
Testing Low-Degree Polynomials over Prime Fields Charanjit S. Jutla
On the Time to Traverse All Edges of a Graph David Zuckerman \Lambda
Small-Bias Spaces for Group Products and David Zuckerman
RandomnessOptimal Oblivious Sampling \Lambda David Zuckerman y
Extractor Codes Amnon TaShma, David Zuckerman
Efficient construction of a small hitting set for combinatorial rectangles in high dimension \Lambda
Computing Eciently Using General Weak Random Sources David Zuckerman
DERANDOMIZED GRAPH PRODUCTS Noga Alon, Uriel Feige, Avi Wigderson