David Zuckerman
According to our database^{1},
David Zuckerman
authored at least 80 papers
between 1989 and 2020.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2013, "For contributions to randomness extraction, pseudorandomness, and their role in complexity theory.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at dl.acm.org
On csauthors.net:
Bibliography
2020
Bounded Collusion Protocols, CylinderIntersection Extractors and LeakageResilient Secret Sharing.
Electronic Colloquium on Computational Complexity (ECCC), 2020
Electronic Colloquium on Computational Complexity (ECCC), 2020
2019
SIAM J. Comput., 2019
J. ACM, 2019
Biasing Boolean Functions and Collective CoinFlipping Protocols over Arbitrary Product Distributions.
Electronic Colloquium on Computational Complexity (ECCC), 2019
Electronic Colloquium on Computational Complexity (ECCC), 2019
Electronic Colloquium on Computational Complexity (ECCC), 2019
2018
Electronic Colloquium on Computational Complexity (ECCC), 2018
Electronic Colloquium on Computational Complexity (ECCC), 2018
Electronic Colloquium on Computational Complexity (ECCC), 2018
2016
CoRR, 2016
Comput. Complex., 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Electronic Colloquium on Computational Complexity (ECCC), 2015
Electronic Colloquium on Computational Complexity (ECCC), 2015
Comput. Complex., 2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
2014
SIAM J. Comput., 2014
Electronic Colloquium on Computational Complexity (ECCC), 2014
Electronic Colloquium on Computational Complexity (ECCC), 2014
CoRR, 2014
CoRR, 2014
2013
SIAM J. Comput., 2013
Electronic Colloquium on Computational Complexity (ECCC), 2013
2011
J. Comput. Syst. Sci., 2011
CoRR, 2011
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC2011), 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Another Proof That <i>BPP</i> Í <i>PH</i>\mathcal{BPP}\subseteq \mathcal{PH} (and More).
Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011
2010
Electronic Colloquium on Computational Complexity (ECCC), 2010
Electronic Colloquium on Computational Complexity (ECCC), 2010
CoRR, 2010
Proceedings of the Property Testing  Current Research and Surveys, 2010
2009
Random Struct. Algorithms, 2009
Electronic Colloquium on Computational Complexity (ECCC), 2009
Proceedings of the Approximation, 2009
2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Proceedings of the Approximation, 2008
2007
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number.
Theory Comput., 2007
IEEE Trans. Inf. Theory, 2007
Deterministic Extractors for BitFixing Sources and ExposureResilient Cryptography.
SIAM J. Comput., 2007
Comb., 2007
2006
J. Comput. Syst. Sci., 2006
Electronic Colloquium on Computational Complexity (ECCC), 2006
2005
Comput. Complex., 2005
2004
IEEE Trans. Inf. Theory, 2004
2002
IEEE Trans. Inf. Theory, 2002
Lower Bounds for Leader Election and Collective CoinFlipping in the Perfect Information Model.
SIAM J. Comput., 2002
Proceedings of the 2002 IEEE Symposium on Security and Privacy, 2002
2001
J. Comput. Syst. Sci., 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
2000
Inf. Process. Lett., 2000
CoRR, 2000
1999
IEEE Trans. Inf. Theory, 1999
SIAM J. Comput., 1999
SIAM J. Comput., 1999
Comb., 1999
1998
SIAM J. Comput., 1998
Proceedings of the Algorithm Theory, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Random Struct. Algorithms, 1997
Electronic Colloquium on Computational Complexity (ECCC), 1997
Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension.
Comb., 1997
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version).
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
1996
SIAM J. Comput., 1996
Random Struct. Algorithms, 1996
J. Comput. Syst. Sci., 1996
Algorithmica, 1996
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Comput. Complex., 1995
1993
Inf. Process. Lett., 1993
Proceedings of the TwentyFifth Annual ACM Symposium on Theory of Computing, 1993
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, 1993
1992
SIAM J. Discret. Math., 1992
1991
Inf. Process. Lett., 1991
1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989