The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Zuckerman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
    Efficient construction of a small hitting set for combinatorial rectangles in high dimension. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:258-267 [Conf]
  2. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:1-14 [Conf]
  3. David Zuckerman
    NP-Complete Problems Have a Version That's Hard to Approximate. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:305-312 [Conf]
  4. Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
    Random Selection with an Adversarial Majority. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:409-426 [Conf]
  5. Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman
    Security Preserving Amplification of Hardness [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:318-326 [Conf]
  6. Russell Impagliazzo, David Zuckerman
    How to Recycle Random Bits [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:248-253 [Conf]
  7. Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
    Testing Low-Degree Polynomials over Prime Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:423-432 [Conf]
  8. Jesse Kamp, David Zuckerman
    Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:92-101 [Conf]
  9. Alexander Russell, David Zuckerman
    Perfect Information Leader Election in log*n + O(1) Rounds. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:576-583 [Conf]
  10. Aravind Srinivasan, David Zuckerman
    Computing with Very Weak Random Sources [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:264-275 [Conf]
  11. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:638-647 [Conf]
  12. David Zuckerman
    General Weak Random Sources [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:534-543 [Conf]
  13. David Zuckerman
    Simulating BPP Using a General Weak Random Source [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:79-89 [Conf]
  14. Michael Luby, Alistair Sinclair, David Zuckerman
    Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:128-133 [Conf]
  15. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
    Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:11-15 [Conf]
  16. Leonard J. Schulman, David Zuckerman
    Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:669-674 [Conf]
  17. Dawn Xiaodong Song, J. D. Tygar, David Zuckerman
    Expander Graphs for Digital Stream Authentication and Robust Overlay Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2002, pp:258-0 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:548-558 [Conf]
  19. Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
    Deterministic extractors for small-space sources. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:691-700 [Conf]
  20. Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in quantum communication and the complexity of set disjointness. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:124-133 [Conf]
  21. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
    Lower bounds for randomized mutual exclusion. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:154-163 [Conf]
  22. Noam Nisan, David Zuckerman
    More deterministic simulation in logspace. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:235-244 [Conf]
  23. Alexander Russell, Michael E. Saks, David Zuckerman
    Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:339-347 [Conf]
  24. Amnon Ta-Shma, Christopher Umans, David Zuckerman
    Loss-less condensers, unbalanced expanders, and extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:143-152 [Conf]
  25. Amnon Ta-Shma, David Zuckerman
    Extractor codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:193-199 [Conf]
  26. David Zuckerman
    Linear degree extractors and the inapproximability of max clique and chromatic number. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:681-690 [Conf]
  27. David Zuckerman
    A Technique for Lower Bounding the Cover Time [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:254-259 [Conf]
  28. David Zuckerman
    Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:286-295 [Conf]
  29. Avi Wigderson, David Zuckerman
    Expanders that beat the eigenvalue bound: explicit construction and applications. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:245-251 [Conf]
  30. David Zuckerman
    Extractors for Weak Random Sources and Their Applications. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:155-157 [Conf]
  31. David Zuckerman
    Simulating BPP Using a General Weak Random Source. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:367-391 [Journal]
  32. Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
    Derandomized Graph Products. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:1, pp:60-75 [Journal]
  33. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:186-227 [Journal]
  34. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
    Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:215-234 [Journal]
  35. Avi Wigderson, David Zuckerman
    Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:1, pp:125-138 [Journal]
  36. Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in Quantum Communication Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  37. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:36, pp:- [Journal]
  38. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:012, pp:- [Journal]
  39. David Zuckerman
    Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:100, pp:- [Journal]
  40. Michael Luby, Alistair Sinclair, David Zuckerman
    Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:4, pp:173-180 [Journal]
  41. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
    Low discrepancy sets yield approximate min-wise independent permutation families. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:1-2, pp:29-32 [Journal]
  42. David Zuckerman
    On the Time to Traverse all Edges of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:6, pp:335-337 [Journal]
  43. Noam Nisan, David Zuckerman
    Randomness is Linear in Space. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:43-52 [Journal]
  44. Alexander Russell, David Zuckerman
    Perfect Information Leader Election in log* n+O (1) Rounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:612-626 [Journal]
  45. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:786-812 [Journal]
  46. David Zuckerman
    Randomness-optimal oblivious sampling. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:345-367 [Journal]
  47. Peter Winkler, David Zuckerman
    Multiple cover time. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:4, pp:403-411 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal]
  49. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
    Lower Bounds for Randomized Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1550-1563 [Journal]
  50. Alexander Russell, Michael E. Saks, David Zuckerman
    Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1645-1662 [Journal]
  51. Aravind Srinivasan, David Zuckerman
    Computing with Very Weak Random Sources. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1433-1459 [Journal]
  52. David Zuckerman
    On Unapproximable Versions of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1293-1304 [Journal]
  53. Jesse Kamp, David Zuckerman
    Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1231-1247 [Journal]
  54. David Zuckerman
    A Technique for Lower Bounding the Cover Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:81-87 [Journal]
  55. Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman
    Combinatorial bounds for list decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1021-1034 [Journal]
  56. Leonard J. Schulman, David Zuckerman
    Asymptotically good codes correcting insertions, deletions, and transpositions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2552-2557 [Journal]
  57. Amnon Ta-Shma, David Zuckerman
    Extractor codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3015-3025 [Journal]
  58. Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
    Interaction in Quantum Communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:1970-1982 [Journal]
  59. Amnon Ta-Shma, Christopher Umans, David Zuckerman
    Lossless Condensers, Unbalanced Expanders, And Extractors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:213-240 [Journal]

  60. Extractors for Three Uneven-Length Sources. [Citation Graph (, )][DBLP]


  61. Small-Bias Spaces for Group Products. [Citation Graph (, )][DBLP]


  62. Fooling Functions of Halfspaces under Product Distributions. [Citation Graph (, )][DBLP]


  63. Network Extractor Protocols. [Citation Graph (, )][DBLP]


  64. List-decoding reed-muller codes over small fields. [Citation Graph (, )][DBLP]


  65. Pseudorandom generators for polynomial threshold functions. [Citation Graph (, )][DBLP]


  66. Pseudorandom Generators for Polynomial Threshold Functions [Citation Graph (, )][DBLP]


  67. Optimal Testing of Reed-Muller Codes [Citation Graph (, )][DBLP]


  68. Fooling functions of halfspaces under product distributions [Citation Graph (, )][DBLP]


  69. Pseudorandom Financial Derivatives [Citation Graph (, )][DBLP]


  70. Can Random Coin Flips Speed Up a Computer? [Citation Graph (, )][DBLP]


  71. Random Selection with an Adversarial Majority. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002