World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
46
Citations
11111
World Ranking
6744
National Ranking
2975

Research.com Recognitions

  • 2013 - ACM Fellow For contributions to randomness extraction, pseudorandomness, and their role in complexity theory.
  • 2004 - Fellow of John Simon Guggenheim Memorial Foundation
  • 1996 - Fellow of Alfred P. Sloan Foundation

Overview

David Zuckerman is affiliated with The University of Texas at Austin in the United States. Their research primarily focuses on computer science, with a specialization in computational theory and mathematics.

The scientist has contributed to various subfields, including computational theory and mathematics, artificial intelligence, cognitive neuroscience, inorganic chemistry, and computational mechanics. Their principal research topics encompass complexity and algorithms in graphs, advanced graph theory research, algorithms and data compression, metal-organic frameworks synthesis and applications, sparse and compressive sensing techniques, Markov chains and Monte Carlo methods, and neural dynamics and brain function.

David Zuckerman's recent research publications include:

  • "Nearly Optimal Pseudorandomness from Hardness," 2022, Journal of the ACM
  • "More than a feeling: Scalp EEG and eye signals in conscious tactile perception," 2022, Consciousness and Cognition
  • "The Space Complexity of Sampling," 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Spectral Sparsification via Bounded-Independence Sampling," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Simple Optimal Hitting Sets for Small-Success RL," 2020, SIAM Journal on Computing

Throughout their career, Zuckerman has collaborated frequently with certain researchers, including Dean Doron, Jack Murtagh, Salil Vadhan, M. M. Gusso, and Kate L. Christison-Lagay.

David Zuckerman's work has been published in several venues, including:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Consciousness and Cognition
  • Journal of the ACM
  • SIAM Journal on Computing

Their recognition includes notable awards such as being named an ACM Fellow in 2013 for contributions to randomness extraction, pseudorandomness, and their role in complexity theory. Additional fellowships include the John Simon Guggenheim Memorial Foundation in 2004 and the Alfred P. Sloan Foundation in 1996.

Best Publications

  • Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number

    David Zuckerman

  • Optimal speedup of Las Vegas algorithms

    M. Luby;A. Sinclair;D. Zuckerman

  • Randomness is linear in space

    N. Nisan;D. Zuckerman

  • An XOR-based erasure-resilient coding scheme

    Johannes Blömer;Malik Kalfane;Richard Karp;Marek Karpinski

  • How to recycle random bits

    R. Impagliazzo;D. Zuckerman

  • Explicit two-source extractors and resilient functions

    Eshan Chattopadhyay;David Zuckerman

  • Simulating BPP using a general weak random source

    David Zuckerman

  • Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography

    Jesse Kamp;David Zuckerman

  • Randomness-optimal oblivious sampling

    David Zuckerman

  • Rectangles Are Nonnegative Juntas

    Mika Göös;Shachar Lovett;Raghu Meka;Thomas Watson

  • Computing with Very Weak Random Sources

    Aravind Srinivasan;David Zuckerman

  • Derandomized graph products

    Noga Alon;Noga Alon;Uriel Feige;Avi Wigderson;David Zuckerman

  • Loss-less condensers, unbalanced expanders, and extractors

    Amnon Ta-Shma;Christopher Umans;David Zuckerman

  • On Unapproximable Versions of NP -Complete Problems

    David Zuckerman

  • Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications

    Avi Wigderson;David Zuckerman

  • Expanders that beat the eigenvalue bound: explicit construction and applications

    Avi Wigderson;David Zuckerman

  • Asymptotically good codes correcting insertions, deletions, and transpositions

    L.J. Schulman;D. Zuckerman

  • Security preserving amplification of hardness

    Oded Goldreich;Russell Impagliazzo;Leonid Levin;Ramarathnan Venkatesan

  • General weak random sources

    D. Zuckerman

  • Extractors from Reed-Muller codes

    Amnon Ta-Shma;David Zuckerman;Shmuel Safra

Frequent Co-Authors

Amnon Ta-Shma
Amnon Ta-Shma Tel Aviv University
Salil P. Vadhan
Salil P. Vadhan Harvard University
Eyal Kushilevitz
Eyal Kushilevitz Technion – Israel Institute of Technology
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Michael Luby
Michael Luby BitRipple
Amit Sahai
Amit Sahai University of California, Los Angeles
Manoj Prabhakaran
Manoj Prabhakaran Indian Institute of Technology Bombay
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles
Russell Impagliazzo
Russell Impagliazzo University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens many doors—not only to tech-related jobs but also to interdisciplinary fields that increasingly rely on computing skills. If you're still deciding, you might want to consider what can you do with an environmental science degree. This degree can lead to careers in sustainability, research, and technology-driven environmental solutions—fields where computing is highly relevant.

For those seeking flexibility, online options are expanding. Ambitious learners may benefit from an accelerated computer science degree online, allowing you to complete your education faster without compromising quality. Online learning is also making STEM fields more accessible.

Engineering disciplines share foundational skills with computer science. Students interested in environmental impact can now choose from environmental engineering degrees online, while those with a passion for invention and design may find value in the cheapest online master's mechanical engineering offerings.

Whether you pursue computer science or branch into related fields, these online degrees create flexible pathways and new professional possibilities.

Best Scientists Citing David Zuckerman

Trending Scientists