David Zuckerman | Academic Influence

David Zuckerman 's AcademicInfluence.com Rankings

David Zuckerman

Computer Science

#1931

World Rank

#2006

Historical Rank

Database

#7944

World Rank

#8272

Historical Rank

computer-science Degrees

Download Badge

Computer Science

David Zuckerman 's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley
Bachelors Computer Science Cornell University

Similar Degrees You Can Earn

Why Is David Zuckerman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David Zuckerman is an American theoretical computer scientist whose work concerns randomness in computation. He is a professor of computer science at the University of Texas at Austin. Biography Zuckerman received an A.B. in mathematics from Harvard University in 1987, where he was a Putnam Fellow in 1986. He went on to earn a Ph.D. in computer science from the University of California at Berkeley in 1991 advised by Umesh Vazirani. He then worked as a postdoctoral fellow at the Massachusetts Institute of Technology and Hebrew University of Jerusalem before joining the University of Texas in 1994. Zuckerman was named a Fellow of the ACM in 2013, and a Simons Investigator in 2016.

(See a Problem?)

David Zuckerman 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Linear degree extractors and the inapproximability of max clique and chromatic number (2006) (927)
Randomness is Linear in Space (1996) (662)
Optimal speedup of Las Vegas algorithms (1993) (556)
An XOR-based erasure-resilient coding scheme (1995) (472)
How to recycle random bits (1989) (400)
Simulating BPP using a general weak random source (1991) (214)
Randomness-optimal oblivious sampling (1997) (170)
Explicit two-source extractors and resilient functions (2016) (163)
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography (2003) (150)
Computing with very weak random sources (1994) (137)
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications (1993) (129)
Loss-less condensers, unbalanced expanders, and extractors (2001) (127)
Security preserving amplification of hardness (1990) (123)
Asymptotically good codes correcting insertions, deletions, and transpositions (1997) (116)
Derandomized graph products (1995) (115)
On Unapproximable Versions of NP-Complete Problems (1996) (112)
General weak random sources (1990) (111)
Rectangles Are Nonnegative Juntas (2015) (110)
Pseudorandom generators for polynomial threshold functions (2009) (103)
Combinatorial bounds for list decoding (2002) (99)
Tight analyses of two local load balancing algorithms (1995) (97)
NP-complete problems have a version that's hard to approximate (1993) (95)
Pseudorandomness from Shrinkage (2012) (88)
More deterministic simulation in logspace (1993) (86)
Deterministic extractors for small-space sources (2006) (86)
Extractors from Reed-Muller codes (2001) (85)
Lossless Condensers, Unbalanced Expanders, And Extractors (2007) (83)
Optimal Testing of Reed-Muller Codes (2009) (83)
Testing low-degree polynomials over prime fields (2004) (81)
Non-malleable Codes against Constant Split-State Tampering (2014) (81)
Extractor codes (2001) (79)
Perfect information leader election in log*n+O(1) rounds (1998) (77)
Another proof that bpp?ph (and more) (1997) (76)
A technique for lower bounding the cover time (1990) (75)
Expander graphs for digital stream authentication and robust overlay networks (2002) (72)
Privacy Amplification and Non-malleable Extractors via Character Sums (2011) (71)
Mining Circuit Lower Bound Proofs for Meta-Algorithms (2014) (68)
Interaction in quantum communication and the complexity of set disjointness (2001) (66)
Efficient construction of a small hitting set for combinatorial rectangles in high dimension (1993) (61)
Lower bounds for leader election and collective coin-flipping in the perfect information model (1999) (46)
Fooling Functions of Halfspaces under Product Distributions (2010) (46)
Randomness-optimal sampling, extractors, and constructive leader election (1996) (44)
Interaction in Quantum Communication (2006) (40)
Network Extractor Protocols (2008) (37)
Pseudorandom generators for combinatorial shapes (2011) (36)
Bitcoin Beacon (2016) (31)
Multiple cover time (1996) (30)
Small-Bias Spaces for Group Products (2009) (30)
List-decoding reed-muller codes over small fields (2008) (27)
Covering times of random walks on bounded degree trees and other graphs (1989) (25)
Robust Pseudorandom Generators (2013) (25)
Another proof that BPP subseteq PH (and more) (1997) (24)
Random Selection with an Adversarial Majority (2006) (23)
Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families (1999) (23)
Compression of Samplable Sources (2004) (22)
Robust Fourier and Polynomial Curve Fitting (2016) (18)
Nearly Optimal Pseudorandomness From Hardness (2020) (17)
On the Time to Traverse all Edges of a Graph (1991) (17)
Optimal Speedup of Las Vegas Algorithms y (2019) (15)
Simple Optimal Hitting Sets for Small-Success RL (2018) (14)
Randomness extractors for independent sources and applications (2007) (13)
On Low Discrepancy Samplings in Product Spaces of Motion Groups (2014) (11)
Extractors for Three Uneven-Length Sources (2008) (11)
Lower bounds for randomized mutual exclusion (1993) (11)
New Extractors for Interleaved Sources (2016) (9)
XOR lemmas for resilient functions against polynomials (2020) (7)
Proceedings of the 30th Conference on Computational Complexity (2015) (6)
Interaction in Quantum Communication Complexity (2000) (6)
Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing (2020) (6)
Pseudorandom financial derivatives (2010) (5)
Computing efficiently using weak random sources (1992) (3)
Improved Extractors for Recognizable and Algebraic Sources (2019) (3)
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions (2019) (3)
Spectral Sparsification via Bounded-Independence Sampling (2020) (2)
Certifiably Pseudorandom Financial Derivatives (2010) (2)
Non-malleable extractors via character sums (2011) (2)
The Space Complexity of Sampling (2021) (2)
TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING (1999) (1)
Deterministic extractors (2007) (1)
Deterministic Extractors for Additive Sources: Extended Abstract (2014) (1)
Existence of Simple Extractors (2018) (1)
4 Concluding Remarks Acknowledgements (1994) (0)
Interaction in Quantum Communication. (arXiv:quant-ph/0603135v1 CROSS LISTED) (2018) (0)
Special issue “Computational Complexity Conference 2015” Guest Editors’ Foreword (2016) (0)
Front Matter, Table of Contents, Preface, Conference Organization (2015) (0)
Can Random Coin Flips Speed Up a Computer? (2010) (0)
Almost Chor-Goldreich Sources and Adversarial Random Walks (2022) (0)
Error correcting codes: local testing, list decoding, and applications (2007) (0)
Extractors for Weak Random Sources and Their Applications (1998) (0)
2 Ju n 20 10 Pseudorandom Financial Derivatives ( Working paper ) (2010) (0)
Special issue “Computational Complexity Conference 2015” Guest Editors’ Foreword (2016) (0)
Ju l 2 01 0 Pseudorandom Financial Derivatives ( Working paper ) (2010) (0)
C R ] 2 1 M ay 2 01 6 Bitcoin Beacon Iddo Bentov (2016) (0)
Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface (2008) (0)
A Proposed Mechanism for the Coining of Classifiers in ASL By (2018) (0)
Another Proof That BPP Í PH\mathcal{BPP}\subseteq \mathcal{PH} (and More) (2011) (0)
J an 2 01 1 Pseudorandom Financial Derivatives ( Working paper ) (2011) (0)
Apt to change : A Comparison of Handshape Aperture in Estonian and Latvian Sign Languages (2018) (0)
Free Handshape: A Proposed Mechanism for the Coining of Classifiers in ASL (2018) (0)
Randomness Efficient Noise Stability and Generalized Small Bias Sets (2020) (0)
Extractors for Images of Varieties (2022) (0)
Deterministic Extractors for Additive Sources (2014) (0)
72 53 v 1 [ cs . C C ] 2 7 O ct 2 01 4 Deterministic Extractors for Additive Sources (2018) (0)

This paper list is powered by the following services:

Other Resources About David Zuckerman

en.wikipedia.org

What Schools Are Affiliated With David Zuckerman ?

David Zuckerman is affiliated with the following schools: