David Zuckerman
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs 44
- Advanced Graph Theory Research 7
- Artificial Intelligence top 0.5%
- Cryptography and Data Security 33
- Algorithms and Data Compression 19
- Machine Learning and Algorithms 13
- Coding theory and cryptography 9
-
- Optimization and Search Problems 7
- Distributed systems and fault tolerance 6
- Co-authors
- Michael LubyNoam NisanRussell ImpagliazzoAlistair SinclairAmnon Ta‐ShmaAvi WigdersonRichard M. KarpJohannes Blömer
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Journals
- SIAM Journal on Computing (9 papers)Journal of Computer and System Sciences (4 papers)IEEE Transactions on Information Theory (4 papers)
- Partner nations
- United StatesIsraelCanada
In The Last Decade
David Zuckerman
92 papers receiving 3.2k citations
Peers
Comparison fields: 5 of 120
- Computational Theory and Mathematics 1.7k
- Artificial Intelligence 1.8k
- Discrete Mathematics and Combinatorics 166
- Computer Networks and Communications 1.2k
- Computer Graphics and Computer-Aided Design 112
Countries citing papers authored by David Zuckerman
This map shows the geographic impact of David Zuckerman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David Zuckerman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Zuckerman more than expected).
Fields of papers citing papers by David Zuckerman
This network shows the impact of papers produced by David Zuckerman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David Zuckerman. The network helps show where David Zuckerman may publish in the future.
Co-authorship network
The 25 scholars most cited alongside David Zuckerman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2022 | 4 | |
| 3 | 2022 | 4 | |
| 4 | 2019 | 1 | |
| 5 | Mining Circuit Lower Bound Proofs for Meta-Algorithms. | 2013 | 1 |
| 6 | 2012 | 33 | |
| 7 | Non-malleable extractors via character sums | 2011 | 1 |
| 8 | 2010 | 11 | |
| 9 | Fooling functions of halfspaces under product distributions. | 2010 | 0 |
| 10 | Survey taps provider IT strategies. | 2007 | 1 |
| 11 | 2007 | 278 | |
| 12 | Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number | 2005 | 1 |
| 13 | The Use of Peremptory Challenges in Capital Murder Trials: A Legal and Empirical Analysis | 2001 | 41 |
| 14 | 2001 | 2 | |
| 15 | Racial Discrimination and the Death Penalty in the Post-Furman Era: An Empirical and Legal Overview with Recent Findings from Philadelphia | 1998 | 112 |
| 16 | 1997 | 2 | |
| 17 | Another proof that BPP subseteq PH (and more). | 1997 | 7 |
| 18 | 1996 | 268 | |
| 19 | An XOR-based erasure-resilient coding scheme | 1995 | 299 |
| 20 | 1989 | 194 |
About David Zuckerman
David Zuckerman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Statistics and Probability, having authored 96 papers that have together received 3.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (44 papers), Cryptography and Data Security (33 papers), Algorithms and Data Compression (19 papers), Machine Learning and Algorithms (13 papers), Coding theory and cryptography (9 papers), Optimization and Search Problems (7 papers), Advanced Graph Theory Research (7 papers) and Distributed systems and fault tolerance (6 papers). The work is most often cited by research in Computational Theory and Mathematics (1.7k citations), Artificial Intelligence (1.8k citations), Discrete Mathematics and Combinatorics (166 citations), Computer Networks and Communications (1.2k citations) and Computer Graphics and Computer-Aided Design (112 citations). David Zuckerman has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Michael Luby, Noam Nisan, Russell Impagliazzo, Alistair Sinclair, Amnon Ta‐Shma, Avi Wigderson, Richard M. Karp, Johannes Blömer, Marek Karpiński and Raghu Meka. Their work appears in journals such as SIAM Journal on Computing, Journal of Computer and System Sciences, IEEE Transactions on Information Theory, Random Structures and Algorithms and Computational Complexity.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.