| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Trevor D. Wooley, David Zuckerman |
Non-malleable extractors via character sums  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, David Zuckerman |
Another Proof That BPP Í PH\mathcal{BPP}\subseteq \mathcal{PH} (and More). |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
Pseudorandom financial derivatives. |
ACM Conference on Electronic Commerce |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman |
Privacy Amplification and Non-malleable Extractors via Character Sums. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
Pseudorandom generators for combinatorial shapes. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan |
Fooling functions of halfspaces under product distributions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
Pseudorandom Generators for Combinatorial Shapes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Zuckerman |
Can Random Coin Flips Speed Up a Computer? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Zuckerman |
Pseudorandom Financial Derivatives |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman |
Fooling functions of halfspaces under product distributions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman |
Fooling Functions of Halfspaces under Product Distributions. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Pseudorandness, complexity theory, halfspace |
| 1 | Raghu Meka, David Zuckerman |
Pseudorandom generators for polynomial threshold functions. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
invariance principles, polynomials, pseudorandom generators, branching programs, threshold functions, halfspaces |
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal testing of Reed-Muller codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman |
Testing low-degree polynomials over prime fields. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Raghu Meka, David Zuckerman |
Pseudorandom Generators for Polynomial Threshold Functions |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Raghu Meka, David Zuckerman |
Small-Bias Spaces for Group Products. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Rao, David Zuckerman |
Extractors for Three Uneven-Length Sources. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman |
Network Extractor Protocols. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam R. Klivans, David Zuckerman |
List-decoding reed-muller codes over small fields. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
fitting polynomials, self-correctors, reed-muller codes, list-decoding |
| 1 | David Zuckerman |
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. |
Theory of Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
Lossless Condensers, Unbalanced Expanders, And Extractors. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q01 |
| 1 | Jesse Kamp, David Zuckerman |
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in Quantum Communication. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman |
Random Selection with an Adversarial Majority. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Amnon Ta-Shma, David Zuckerman, Shmuel Safra |
Extractors from Reed-Muller codes. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Salil P. Vadhan, David Zuckerman |
Random Selection with an Adversarial Majority. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
Linear degree extractors and the inapproximability of max clique and chromatic number. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction |
| 1 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
pseudorandomness, randomness extractors |
| 1 | Luca Trevisan, Salil P. Vadhan, David Zuckerman |
Compression of Samplable Sources |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | David Zuckerman |
Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Luca Trevisan, Salil P. Vadhan, David Zuckerman |
Compression of Samplable Sources. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
Subject classification, 68P30 |
| 1 | Amnon Ta-Shma, David Zuckerman |
Extractor codes. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman |
Testing Low-Degree Polynomials over Prime Fields. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan, Salil P. Vadhan, David Zuckerman |
Compression of Samplable Sources. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesse Kamp, David Zuckerman |
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Russell, Michael E. Saks, David Zuckerman |
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman |
Combinatorial bounds for list decoding. |
IEEE Transactions on Information Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dawn Xiaodong Song, J. D. Tygar, David Zuckerman |
Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. (PDF / PS) |
IEEE Symposium on Security and Privacy |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amnon Ta-Shma, David Zuckerman, Shmuel Safra |
Extractors from Reed-Muller Codes |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Alexander Russell, David Zuckerman |
Perfect Information Leader Election in log* n+O (1) Rounds. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amnon Ta-Shma, David Zuckerman, Shmuel Safra |
Extractors from Reed-Muller Codes. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in quantum communication and the complexity of set disjointness. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amnon Ta-Shma, David Zuckerman |
Extractor codes. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
Loss-less condensers, unbalanced expanders, and extractors. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman |
Low discrepancy sets yield approximate min-wise independent permutation families. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in Quantum Communication Complexity |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Avi Wigderson, David Zuckerman |
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan, David Zuckerman |
Computing with Very Weak Random Sources. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman |
Tight Analyses of Two Local Load Balancing Algorithms. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard J. Schulman, David Zuckerman |
Asymptotically good codes correcting insertions, deletions, and transpositions. |
IEEE Transactions on Information Theory |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman |
Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. |
RANDOM-APPROX |
1999 |
DBLP BibTeX RDF |
|
| 1 | Alexander Russell, Michael E. Saks, David Zuckerman |
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman |
Lower Bounds for Randomized Mutual Exclusion. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
Extractors for Weak Random Sources and Their Applications. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Russell, David Zuckerman |
Perfect Information Leader Election in log*n + O(1) Rounds. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, David Zuckerman |
Another proof that BPP subseteq PH (and more). |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | David Zuckerman |
Randomness-optimal oblivious sampling. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman |
Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. |
Combinatorica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard J. Schulman, David Zuckerman |
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
Simulating BPP Using a General Weak Random Source. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Winkler, David Zuckerman |
Multiple cover time. |
Random Struct. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Nisan, David Zuckerman |
Randomness is Linear in Space. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
On Unapproximable Versions of NP-Complete Problems. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman |
Derandomized Graph Products. |
Computational Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman |
Tight analyses of two local load balancing algorithms. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Srinivasan, David Zuckerman |
Computing with Very Weak Random Sources |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
randomness-efficient Leftover Hash Lemma, very weak random sources, RP algorithms simulation, R-bit string, BPP simulations, Chor-Goldreich sources, expander constructions, probability, hardness, time-space tradeoffs, min-entropy |
| 1 | Michael Luby, Alistair Sinclair, David Zuckerman |
Optimal Speedup of Las Vegas Algorithms. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Luby, Alistair Sinclair, David Zuckerman |
Optimal Speedup of Las Vegas Algorithms. |
ISTCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | David Zuckerman |
NP-Complete Problems Have a Version That's Hard to Approximate. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman |
Efficient construction of a small hitting set for combinatorial rectangles in high dimension. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Avi Wigderson, David Zuckerman |
Expanders that beat the eigenvalue bound: explicit construction and applications. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Nisan, David Zuckerman |
More deterministic simulation in logspace. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman |
Lower bounds for randomized mutual exclusion. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
A Technique for Lower Bounding the Cover Time. |
SIAM J. Discrete Math. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
On the Time to Traverse all Edges of a Graph. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | David Zuckerman |
Simulating BPP Using a General Weak Random Source |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
probe search, BPP simulation, general weak random source, R-bit string, approximation algorithms, polynomial time, maximum clique, weak random source |
| 1 | David Zuckerman |
General Weak Random Sources |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
Paley graph conjecture, probability, polynomial time, pseudorandom generator, weak random source |
| 1 | Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman |
Security Preserving Amplification of Hardness |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
regular one-way function, security preserving amplification, weak one-way function, polynomial fraction, inverting algorithm, signatures, pseudorandom generators, hardness |
| 1 | David Zuckerman |
A Technique for Lower Bounding the Cover Time |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, David Zuckerman |
How to Recycle Random Bits |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
random bits, shift register generator, BPP algorithm, information-theoretic lower bound, probabilistic algorithm, pseudorandom generator, linear congruential generator, linear congruential generators |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")