David Zuckerman

发表

Another proof that BPP subseteq PH (and more)

Oded Goldreich, David Zuckerman, Oded Goldreich, 1997, Electron. Colloquium Comput. Complex..

Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface

Yael Tauman Kalai, Osamu Watanabe, Yuval Ishai, 2008 .

More deterministic simulation in logspace

Noam Nisan, David Zuckerman, N. Nisan, 1993, STOC.

How to recycle random bits

Russell Impagliazzo, David Zuckerman, R. Impagliazzo, 1989, 30th Annual Symposium on Foundations of Computer Science.

Explicit two-source extractors and resilient functions

David Zuckerman, Eshan Chattopadhyay, Eshan Chattopadhyay, 2016, Electron. Colloquium Comput. Complex..

Deterministic extractors for small-space sources

David Zuckerman, Anup Rao, Salil P. Vadhan, 2006, STOC '06.

Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER

David Zuckerman, David Zuckerman, 2005 .

Randomness-optimal oblivious sampling

D. Zuckerman, David Zuckerman, 1997, Random Struct. Algorithms.

Another proof that bpp?ph (and more)

Oded Goldreich, D. Zuckerman, David Zuckerman, 1997 .

Randomness is Linear in Space

Noam Nisan, David Zuckerman, N. Nisan, 1996, J. Comput. Syst. Sci..

General weak random sources

David Zuckerman, David Zuckerman, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Loss-less condensers, unbalanced expanders, and extractors

Amnon Ta-Shma, David Zuckerman, Christopher Umans, 2001, STOC '01.

Computing with very weak random sources

Aravind Srinivasan, David Zuckerman, A. Srinivasan, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Nearly Optimal Pseudorandomness From Hardness

David Zuckerman, Dean Doron, Dana Moshkovitz, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Security preserving amplification of hardness

Leonid A. Levin, Ramarathnam Venkatesan, Russell Impagliazzo, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Fooling Functions of Halfspaces under Product Distributions

P. Gopalan, R. O'Donnell, Y. Wu, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

A technique for lower bounding the cover time

David Zuckerman, David Zuckerman, 1990, STOC '90.

Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications

Avi Wigderson, David Zuckerman, A. Wigderson, 1993, Comb..

Pseudorandomness from Shrinkage

Russell Impagliazzo, David Zuckerman, Raghu Meka, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Pseudorandom generators for combinatorial shapes

Omer Reingold, David Zuckerman, Parikshit Gopalan, 2011, STOC '11.

Pseudorandom financial derivatives pdf

David Zuckerman, David Zuckerman, 2010, EC '11.

Pseudorandom generators for polynomial threshold functions

David Zuckerman, Raghu Meka, Raghu Meka, 2009, STOC '10.

Robust Fourier and Polynomial Curve Fitting

Venkatesan Guruswami, David Zuckerman, V. Guruswami, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Apt to change : A Comparison of Handshape Aperture in Estonian and Latvian Sign Languages

Jacob Malin, David Zuckerman, Melanie Drolsbaugh, 2018 .

Error correcting codes: local testing, list decoding, and applications

Anindya C. Patthak, D. Zuckerman, David Zuckerman, 2007 .

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions

Pooya Hatami, David Zuckerman, Yuval Filmus, 2019, Electron. Colloquium Comput. Complex..

Bitcoin Beacon

Iddo Bentov, Ariel Gabizon, David Zuckerman, 2016, ArXiv.

C R ] 2 1 M ay 2 01 6 Bitcoin Beacon Iddo Bentov

David Zuckerman, 2016 .

Network Extractor Protocols

Yael Tauman Kalai, David Zuckerman, Anup Rao, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Randomness extractors for independent sources and applications

D. Zuckerman, Anup Rao, David Zuckerman, 2007 .

Deterministic extractors for bit-fixing sources and exposure-resilient cryptography

David Zuckerman, Jesse Kamp, David Zuckerman, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Lower bounds for leader election and collective coin-flipping in the perfect information model

Michael E. Saks, Alexander Russell, David Zuckerman, 1999, STOC '99.

Perfect information leader election in log*n+O(1) rounds

Alexander Russell, David Zuckerman, A. Russell, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Rectangles Are Nonnegative Juntas

Shachar Lovett, David Zuckerman, Thomas Watson, 2015, SIAM J. Comput..

Privacy Amplification and Non-malleable Extractors via Character Sums

Yevgeniy Dodis, David Zuckerman, Xin Li, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

NP-complete problems have a version that's hard to approximate

David Zuckerman, David Zuckerman, 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

Optimal speedup of Las Vegas algorithms

David Zuckerman, Alistair Sinclair, Michael Luby, 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

New Extractors for Interleaved Sources

David Zuckerman, Eshan Chattopadhyay, Eshan Chattopadhyay, 2016, Electron. Colloquium Comput. Complex..

Non-malleable Codes against Constant Split-State Tampering

David Zuckerman, Eshan Chattopadhyay, Eshan Chattopadhyay, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing

David Zuckerman, Ashutosh Kumar, Raghu Meka, 2020, Electron. Colloquium Comput. Complex..

An XOR-based erasure-resilient coding scheme

Marek Karpinski, Richard M. Karp, David Zuckerman, 1995 .

Optimal Testing of Reed-Muller Codes

Madhu Sudan, David Zuckerman, Grant Schoenebeck, 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Combinatorial bounds for list decoding

Venkatesan Guruswami, Madhu Sudan, Johan Håstad, 2002, IEEE Trans. Inf. Theory.

Asymptotically good codes correcting insertions, deletions, and transpositions

David Zuckerman, Leonard J. Schulman, L. Schulman, 1997, SODA '97.

Deterministic Extractors for Additive Sources: Extended Abstract

David Zuckerman, Ariel Gabizon, Abhishek Bhowmick, 2014, ITCS.

Deterministic Extractors for Additive Sources pdf

David Zuckerman, Ariel Gabizon, Abhishek Bhowmick, 2014, ArXiv.

On Unapproximable Versions of NP-Complete Problems

David Zuckerman, David Zuckerman, 1996, SIAM J. Comput..

Interaction in Quantum Communication

Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, 2006, IEEE Transactions on Information Theory.

Lower bounds for randomized mutual exclusion

Eyal Kushilevitz, Yishay Mansour, David Zuckerman, 1993, SIAM J. Comput..

Tight analyses of two local load balancing algorithms

C. G. Plaxton, R. Tarjan, F. Leighton, 1995, STOC '95.

Covering times of random walks on bounded degree trees and other graphs

D. Zuckerman, David Zuckerman, 1989 .

Robust Pseudorandom Generators

Rafail Ostrovsky, Yuval Ishai, Eyal Kushilevitz, 2013, ICALP.

Almost Chor-Goldreich Sources and Adversarial Random Walks

D. Zuckerman, Dana Moshkovitz, Dean Doron, 2023, Electron. Colloquium Comput. Complex..

Certifiably Pseudorandom Financial Derivatives

David Zuckerman, David Zuckerman, 2010, SIAM J. Comput..

Extractors for Three Uneven-Length Sources

David Zuckerman, Anup Rao, Anup Rao, 2008, APPROX-RANDOM.

Existence of Simple Extractors

Xue Chen, David Zuckerman, David Zuckerman, 2018, Electron. Colloquium Comput. Complex..

J an 2 01 1 Pseudorandom Financial Derivatives ( Working paper )

D. Zuckerman, David Zuckerman, 2011 .

2 Ju n 20 10 Pseudorandom Financial Derivatives ( Working paper )

David Zuckerman, 2010 .

Ju l 2 01 0 Pseudorandom Financial Derivatives ( Working paper )

David Zuckerman, 2010 .

Lossless Condensers, Unbalanced Expanders, And Extractors

Amnon Ta-Shma, David Zuckerman, Christopher Umans, 2007, Comb..

Extractors from Reed-Muller codes

Amnon Ta-Shma, David Zuckerman, Shmuel Safra, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Extractor codes

Amnon Ta-Shma, David Zuckerman, A. Ta-Shma, 2001, IEEE Transactions on Information Theory.

Simulating BPP using a general weak random source

David Zuckerman, David Zuckerman, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Derandomized graph products

Noga Alon, Avi Wigderson, Uriel Feige, 1995, computational complexity.

Linear degree extractors and the inapproximability of max clique and chromatic number

David Zuckerman, 2006, STOC.

Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number General Terms

David Zuckerman, 2022 .

Randomness-optimal sampling, extractors, and constructive leader election

David Zuckerman, David Zuckerman, 1996, STOC '96.

On Low Discrepancy Samplings in Product Spaces of Motion Groups pdf

Chandrajit L. Bajaj, David Zuckerman, Eshan Chattopadhyay, 2014, ArXiv.

Mining Circuit Lower Bound Proofs for Meta-Algorithms

David Zuckerman, Ronen Shaltiel, Valentine Kabanets, 2014, computational complexity.

Simple Optimal Hitting Sets for Small-Success RL

David Zuckerman, William M. Hoza, William Hoza, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Extractors for Images of Varieties

Ben lee Volk, Zeyu Guo, David Zuckerman, 2022, Electron. Colloquium Comput. Complex..

Efficient construction of a small hitting set for combinatorial rectangles in high dimension

Michael E. Saks, Nathan Linial, David Zuckerman, 1993, Comb..

72 53 v 1 [ cs . C C ] 2 7 O ct 2 01 4 Deterministic Extractors for Additive Sources

Ariel Gabizon, D. Zuckerman, Abhishek Bhowmick, 2018 .

Interaction in quantum communication and the complexity of set disjointness

H. Klauck, A. Nayak, A. Ta-Shma, 2001, STOC '01.

Interaction in Quantum Communication Complexity

Ashwin Nayak, Amnon Ta-Shma, David Zuckerman, 2000, ArXiv.

Spectral Sparsification via Bounded-Independence Sampling

S. Vadhan, Dean Doron, Jack Murtagh, 2020, Electron. Colloquium Comput. Complex..

Testing low-degree polynomials over prime fields

Atri Rudra, David Zuckerman, Charanjit S. Jutla, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families

Aravind Srinivasan, Michael E. Saks, David Zuckerman, 1999, RANDOM-APPROX.

Random Selection with an Adversarial Majority

David Zuckerman, Salil P. Vadhan, Ronen Gradwohl, 2006, CRYPTO.

Compression of Samplable Sources

S. Vadhan, L. Trevisan, D. Zuckerman, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Non-malleable extractors via character sums pdf

David Zuckerman, Trevor D. Wooley, T. Wooley, 2011, arXiv.org.

Optimal Speedup of Las Vegas Algorithms y

M. Luby, A. Sinclair, David Zuckerman, 2019 .