David Zuckerman

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Improved Condensers for Chor-Goldreich Sources 2024 Jesse Goodman
Xin Li
David Zuckerman
+ Extractors for Images of Varieties 2023 Zeyu Guo
Ben Lee Volk
Akhil Jalan
David Zuckerman
+ Extractors for Images of Varieties 2022 Zeyu Guo
Ben Lee Volk
Akhil Jalan
David Zuckerman
+ Spectral Sparsification via Bounded-Independence Sampling 2020 Dean Doron
Jack Murtagh
Salil Vadhan
David Zuckerman
+ Spectral Sparsification via Bounded-Independence Sampling. 2020 Dean Doron
Jack Murtagh
Salil Vadhan
David Zuckerman
+ Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions 2019 Yuval Filmus
Lianna Hambardzumyan
Hamed Hatami
Pooya Hatami
David Zuckerman
+ Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. 2019 Yuval Filmus
Lianna Hambardzumyan
Hamed Hatami
Pooya Hatami
David Zuckerman
+ Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions 2019 Yuval Filmus
Lianna Hambardzumyan
Hamed Hatami
Pooya Hatami
David Zuckerman
+ PDF Chat Certifiably Pseudorandom Financial Derivatives 2019 David Zuckerman
+ XOR Lemmas for Resilient Functions Against Polynomials. 2019 Eshan Chattopadhyay
Pooya Hatami
Kaave Hosseini
Shachar Lovett
David Zuckerman
+ Bitcoin Beacon 2016 Iddo Bentov
Ariel Gabizon
David Zuckerman
+ Bitcoin Beacon 2016 Iddo Bentov
Ariel Gabizon
David Zuckerman
+ PDF Chat Deterministic Extractors for Additive Sources 2015 Abhishek Bhowmick
Ariel Gabizon
Thái Hoàng Lê
David Zuckerman
+ On Low Discrepancy Samplings in Product Spaces of Motion Groups 2014 Chandrajit Bajaj
Abhishek Bhowmick
Eshan Chattopadhyay
David Zuckerman
+ Deterministic Extractors for Additive Sources 2014 Abhishek Bhowmick
Ariel Gabizon
David Zuckerman
+ PDF Chat Privacy Amplification and Nonmalleable Extractors Via Character Sums 2014 Yevgeniy Dodis
Xin Li
Trevor D. Wooley
David Zuckerman
+ On Low Discrepancy Samplings in Product Spaces of Motion Groups 2014 Chandrajit Bajaj
Abhishek Bhowmick
Eshan Chattopadhyay
David Zuckerman
+ Deterministic Extractors for Additive Sources 2014 Abhishek Bhowmick
Ariel Gabizon
Thái Hoàng Lê
David Zuckerman
+ Pseudorandom Generators for Combinatorial Shapes 2013 Parikshit Gopalan
Raghu Meka
Omer Reingold
David Zuckerman
+ PDF Chat Pseudorandom Generators for Polynomial Threshold Functions 2013 Raghu Meka
David Zuckerman
+ PDF Chat Privacy Amplification and Non-malleable Extractors via Character Sums 2011 Yevgeniy Dodis
Xin Li
Trevor D. Wooley
David Zuckerman
+ Pseudorandom generators for combinatorial shapes 2011 Parikshit Gopalan
Raghu Meka
Omer Reingold
David Zuckerman
+ Non-malleable extractors via character sums 2011 Trevor D. Wooley
David Zuckerman
+ Privacy Amplification and Non-Malleable Extractors Via Character Sums 2011 Yevgeniy Dodis
Xin Li
Trevor D. Wooley
David Zuckerman
+ PDF Chat 2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011) 2011 Yevgeniy Dodis
Xin Li
Trevor D. Wooley
David Zuckerman
+ Privacy Amplification and Non-Malleable Extractors Via Character Sums 2011 Yevgeniy Dodis
Xin Li
Trevor D. Wooley
David Zuckerman
+ PDF Chat Optimal Testing of Reed-Muller Codes 2010 Arnab Bhattacharyya
Swastik Kopparty
Grant Schoenebeck
Madhu Sudan
David Zuckerman
+ PDF Chat Pseudorandom generators for polynomial threshold functions 2010 Raghu Meka
David Zuckerman
+ Certifiably Pseudorandom Financial Derivatives 2010 David Zuckerman
+ Pseudorandom Financial Derivatives 2010 David Zuckerman
+ PDF Chat Fooling Functions of Halfspaces under Product Distributions 2010 Parikshit Gopalan
Ryan O’Donnell
Yi Wu
David Zuckerman
+ Can Random Coin Flips Speed Up a Computer? 2010 David Zuckerman
+ PDF Chat Optimal Testing of Reed-Muller Codes 2010 Arnab Bhattacharyya
Swastik Kopparty
Grant Schoenebeck
Madhu Sudan
David Zuckerman
+ Fooling functions of halfspaces under product distributions 2010 Parikshit Gopalan
Ryan O’Donnell
Yi Wu
David Zuckerman
+ Pseudorandom Generators for Combinatorial Shapes. 2010 Parikshit Gopalan
Raghu Meka
Omer Reingold
David Zuckerman
+ Certifiably Pseudorandom Financial Derivatives 2010 David Zuckerman
+ Pseudorandom Generators for Polynomial Threshold Functions 2009 Raghu Meka
David Zuckerman
+ None 2009 Charanjit S. Jutla
Anindya C. Patthak
Atri Rudra
David Zuckerman
+ Pseudorandom Generators for Polynomial Threshold Functions 2009 Raghu Meka
David Zuckerman
+ Optimal Testing of Reed-Muller Codes 2009 Arnab Bhattacharyya
Swastik Kopparty
Grant Schoenebeck
Madhu Sudan
David Zuckerman
+ PDF Chat Interaction in Quantum Communication 2007 Hartmut Klauck
Ashwin Nayak
Amnon Ta‐Shma
David Zuckerman
+ PDF Chat Compression of Samplable Sources 2005 Luca Trevisan
Salil Vadhan
David Zuckerman
+ NP-complete problems have a version that's hard to approximate 2002 David Zuckerman
+ Interaction in Quantum Communication Complexity 2000 Ashwin Nayak
Amnon Ta‐Shma
David Zuckerman
+ Low discrepancy sets yield approximate min-wise independent permutation families 2000 Michael Saks
Aravind Srinivasan
Shiyu Zhou
David Zuckerman
+ Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families 1999 Michael Saks
Aravind Srinivasan
Shiyu Zhou
David Zuckerman
+ Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications 1999 Avi Wigderson
David Zuckerman
+ Extractors for weak random sources and their applications 1998 David Zuckerman
+ On Unapproximable Versions of $NP$-Complete Problems 1996 David Zuckerman
+ Multiple cover time 1996 Peter Winkler
David Zuckerman
+ Randomness is Linear in Space 1996 Noam Nisan
David Zuckerman
+ PDF Chat Derandomized graph products 1995 Noga Alon
Uriel Feige
Avi Wigderson
David Zuckerman
+ Expanders that beat the eigenvalue bound 1993 Avi Wigderson
David Zuckerman
+ A Technique for Lower Bounding the Cover Time 1992 David Zuckerman
+ On the time to traverse all edges of a graph 1991 David Zuckerman
+ A technique for lower bounding the cover time 1990 David Zuckerman
+ Covering times of random walks on bounded degree trees and other graphs 1989 David Zuckerman
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Randomness is Linear in Space 1996 Noam Nisan
David Zuckerman
16
+ On Some Exponential Sums 1948 André Weil
5
+ PDF Chat On the time taken by random walks on finite groups to visit every state 1983 David Aldous
4
+ Sharpening of the Upper Bound of the Absolute Constant in the Berry–Esseen Inequality 2007 И. Г. Шевцова
4
+ PDF Chat On the cover time of random walks on graphs 1989 Jeff D. Kahn
Nathan Linial
Noam Nisan
Michael Saks
4
+ PDF Chat Covering Problems for Brownian Motion on Spheres 1988 Peter Matthews
4
+ Monte-Carlo approximation algorithms for enumeration problems 1989 Richard M. Karp
Michael Luby
Neal Madras
3
+ A fast and simple randomized parallel algorithm for the maximal independent set problem 1986 Noga Alon
László Babai
Alon Itai
3
+ Affine extractors over prime fields 2011 Amir Yehudayoff
3
+ PDF Chat Distributional and $L^{q}$ norm inequalities for polynomials over convex bodies in ${\Bbb R}^n$ 2001 Anthony Carbery
James Wright
3
+ PDF Chat Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers 2009 Zeev Dvir
Swastik Kopparty
Shubhangi Saraf
Madhu Sudan
3
+ Discrepancy sets and pseudorandom generators for combinatorial rectangles 2002 Roy Armoni
Michael Saks
Avi Wigderson
Shiyu Zhou
3
+ PDF Chat Approximating the Permanent 1989 Mark Jerrum
Alistair Sinclair
3
+ PDF Chat On a Set of Almost Deterministic $k$-Independent Random Variables 1974 A. Joffe
3
+ Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness 2009 Ido Ben‐Eliezer
Shachar Lovett
Ariel Yadin
3
+ Approximations of general independent distributions 1992 Guy Even
Oded Goldreich
Michael Luby
Noam Nisan
Boban Veličković
3
+ PDF Chat Quantum lower bounds by polynomials 2001 Robert Beals
Harry Buhrman
Richard Cleve
Michele Mosca
Ronald de Wolf
3
+ PDF Chat Simple Constructions of Almost k‐wise Independent Random Variables 1992 Noga Alon
Oded Goldreich
Johan Håstad
René Peralta
3
+ Bounds on the cover time 1989 Andrei Broder
Anna R. Karlin
3
+ On the Construction of Affine Extractors 2007 Jean Bourgain
3
+ PDF Chat Total variation asymptotics for sums of independent integer random variables 2002 A. D. Barbour
V. Čekanavičius
3
+ PDF Chat Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 2008 Yevgeniy Dodis
Rafail Ostrovsky
Leonid Reyzin
Adam Smith
3
+ Lower bounds for covering times for reversible Markov chains and random walks on graphs 1989 David Aldous
3
+ PDF Chat Random walks on random trees 1973 J. W. Moon
3
+ PDF Chat Pseudorandom generators for polynomial threshold functions 2010 Raghu Meka
David Zuckerman
3
+ PDF Chat A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions 2010 Ilias Diakonikolas
Rocco A. Servedio
Li-Yang Tan
Andrew Wan
2
+ PDF Chat Optimal lower bounds for quantum automata and random access codes 2003 Ashwin Nayak
2
+ On determinants of random symmetric matrices over Z_m 2010 Richard P. Brent
Brendan D. McKay
2
+ PDF Chat An Improved Robust Fuzzy Extractor 2008 Bhavana Kanukurthi
Leonid Reyzin
2
+ PDF Chat Coalescing Random Walks and Voter Model Consensus Times on the Torus in $\mathbb{Z}^d$ 1989 J. Theodore Cox
2
+ Notes on Geometry 1982 Elmer Rees
2
+ A Lyapunov-type Bound in <i>R<sup>d</sup></i> 2005 V. Bentkus
2
+ Min-Wise Independent Permutations 2000 Andrei Broder
Moses Charikar
Alan Frieze
Michael Mitzenmacher
2
+ PDF Chat AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM 2008 Ben Green
Terence Tao
2
+ PDF Chat An invariance principle for polytopes 2010 Prahladh Harsha
Adam R. Klivans
Raghu Meka
2
+ Quantum vs. classical communication and computation 1998 Harry Buhrman
Richard Cleve
Avi Wigderson
2
+ Finite Markov chains 1976 John G. Kemeny
J. Laurie Snell
2
+ PDF Chat Sum–product theorems and exponential sum bounds in residue classes for general modulus 2007 Jean Bourgain
2
+ PDF Chat Unconditionally Secure Quantum Bit Commitment is Impossible 1997 Dominic Mayers
2
+ PDF Chat A random polynomial-time algorithm for approximating the volume of convex bodies 1991 Martin Dyer
Alan Frieze
Ravi Kannan
2
+ The “transition probability” in the state space of a ∗-algebra 1976 Armin Uhlmann
2
+ Sorting, Approximate Sorting, and Searching in Rounds 1988 Noga Alon
Yossi Azar
2
+ PDF Chat Eigenvalues and expanders 1986 Ilan Alon
2
+ PDF Chat A Note on Hypercontractivity of Stable Random Variables 1990 Jerzy Szulga
2
+ PDF Chat Derandomized Squaring of Graphs 2005 Eyal Rozenman
Salil Vadhan
2
+ PDF Chat Hypercontractivity of simple random variables 2007 Paweł Wolff
2
+ PDF Chat Hypercontraction principle and random multilinear forms 1988 W. Krakowiak
Jerzy Szulga
2
+ PDF Chat Sorting and Selecting in Rounds 1987 Nicholas Pippenger
2
+ PDF Chat Dispersers for Affine Sources with Sub-polynomial Entropy 2011 Ronen Shaltiel
2
+ Random walk covering of some special trees 1991 David Aldous
2