Daniel Dadush
- Numerical Analysis top 10%
- Advanced Optimization Algorithms Research 7
-
- Computational Geometry and Mesh Generation 10
-
- Complexity and Algorithms in Graphs 20
- Advanced Graph Theory Research 11
- Statistics and Probability top 10%
-
- Point processes and geometric inequalities 8
-
- Cryptography and Data Security 8
- Privacy-Preserving Technologies in Data 6
-
- Optimization and Search Problems 6
- Co-authors
- Santosh VempalaNoah Stephens-DavidowitzJuan Pablo VielmaSantanu S. DeyChris PeikertDivesh AggarwalShashwat GargOded Regev
- Cited by
- Numerical AnalysisComputer Graphics and Computer-Aided DesignComputational Theory and Mathematics
- Journals
- Mathematical Programming (6 papers)Theory of Computing (3 papers)Mathematics of Operations Research (2 papers)
- Partner nations
- NetherlandsUnited StatesUnited Kingdom
In The Last Decade
Daniel Dadush
34 papers receiving 258 citations
Peers
Comparison fields: 5 of 40
- Numerical Analysis 82
- Computer Graphics and Computer-Aided Design 39
- Computational Theory and Mathematics 160
- Discrete Mathematics and Combinatorics 18
- Statistics and Probability 38
Countries citing papers authored by Daniel Dadush
This map shows the geographic impact of Daniel Dadush'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 Daniel Dadush with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Dadush more than expected).
Fields of papers citing papers by Daniel Dadush
This network shows the impact of papers produced by Daniel Dadush. 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 Daniel Dadush. The network helps show where Daniel Dadush may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Daniel Dadush, 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 | 2024 | 0 | |
| 3 | 2024 | 0 | |
| 4 | 2023 | 1 | |
| 5 | 2023 | 4 | |
| 6 | 2022 | 2 | |
| 7 | 2022 | 1 | |
| 8 | 2022 | 4 | |
| 9 | 2020 | 6 | |
| 10 | 2019 | 3 | |
| 11 | 2019 | 2 | |
| 12 | 2019 | 2 | |
| 13 | 2019 | 8 | |
| 14 | 2016 | 3 | |
| 15 | 2015 | 27 | |
| 16 | 2015 | 22 | |
| 17 | 2014 | 10 | |
| 18 | 2013 | 11 | |
| 19 | 2011 | 12 | |
| 20 | Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings | 2010 | 4 |
About Daniel Dadush
Daniel Dadush is a scholar working on Computer Graphics and Computer-Aided Design, Numerical Analysis, Computational Theory and Mathematics, Algebra and Number Theory and Applied Mathematics, having authored 37 papers that have together received 282 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (11 papers), Computational Geometry and Mesh Generation (10 papers), Point processes and geometric inequalities (8 papers), Cryptography and Data Security (8 papers), Advanced Optimization Algorithms Research (7 papers), Optimization and Search Problems (6 papers) and Privacy-Preserving Technologies in Data (6 papers). The work is most often cited by research in Numerical Analysis (82 citations), Computer Graphics and Computer-Aided Design (39 citations), Computational Theory and Mathematics (160 citations), Discrete Mathematics and Combinatorics (18 citations) and Statistics and Probability (38 citations). Daniel Dadush has collaborated with scholars based in Netherlands, United States and United Kingdom. Frequent co-authors include Santosh Vempala, Noah Stephens-Davidowitz, Juan Pablo Vielma, Santanu S. Dey, Chris Peikert, Divesh Aggarwal, Shashwat Garg, Oded Regev, Nikhil Bansal and László A. Végh. Their work appears in journals such as Mathematical Programming, Theory of Computing, Mathematics of Operations Research, Operations Research Letters and Algorithmica.
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.