Dana Moshkovitz

731 total citations
29 papers, 288 citations indexed

About

Dana Moshkovitz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Dana Moshkovitz has authored 29 papers receiving a total of 288 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 17 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in Dana Moshkovitz's work include Complexity and Algorithms in Graphs (23 papers), Advanced Graph Theory Research (10 papers) and Machine Learning and Algorithms (7 papers). Dana Moshkovitz is often cited by papers focused on Complexity and Algorithms in Graphs (23 papers), Advanced Graph Theory Research (10 papers) and Machine Learning and Algorithms (7 papers). Dana Moshkovitz collaborates with scholars based in United States, Israel and Switzerland. Dana Moshkovitz's co-authors include Muli Safra, Noga Alon, Subhash Khot, Shafi Goldwasser, Adi Akavia, Oded Goldreich, Russell Impagliazzo, Scott Aaronson, David Zuckerman and Ran Raz and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and ACM Transactions on Algorithms.

In The Last Decade

Dana Moshkovitz

26 papers receiving 262 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dana Moshkovitz United States 7 184 120 85 29 29 29 288
Elena Grigorescu United States 9 169 0.9× 204 1.7× 86 1.0× 29 1.0× 10 0.3× 48 312
Martha Sideri Greece 10 169 0.9× 126 1.1× 132 1.6× 16 0.6× 17 0.6× 18 348
Ran Duan United States 7 153 0.8× 67 0.6× 138 1.6× 30 1.0× 14 0.5× 18 274
Magnus Wahlström United Kingdom 14 384 2.1× 96 0.8× 135 1.6× 32 1.1× 26 0.9× 49 510
Toshihiro Fujito Japan 10 287 1.6× 45 0.4× 193 2.3× 37 1.3× 50 1.7× 25 386
Robin A. Moser Switzerland 4 191 1.0× 78 0.7× 55 0.6× 21 0.7× 17 0.6× 5 259
Shlomi Rubinstein Israel 10 166 0.9× 53 0.4× 108 1.3× 30 1.0× 37 1.3× 14 314
Luděk Kučera Czechia 8 177 1.0× 102 0.8× 75 0.9× 29 1.0× 12 0.4× 35 303
Yushi Uno Japan 8 188 1.0× 38 0.3× 70 0.8× 52 1.8× 20 0.7× 39 246
Jochen Alber Germany 11 373 2.0× 74 0.6× 193 2.3× 27 0.9× 44 1.5× 17 455

Countries citing papers authored by Dana Moshkovitz

Since Specialization
Citations

This map shows the geographic impact of Dana Moshkovitz'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 Dana Moshkovitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dana Moshkovitz more than expected).

Fields of papers citing papers by Dana Moshkovitz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dana Moshkovitz. 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 Dana Moshkovitz. The network helps show where Dana Moshkovitz may publish in the future.

Co-authorship network of co-authors of Dana Moshkovitz

This figure shows the co-authorship network connecting the top 25 collaborators of Dana Moshkovitz. A scholar is included among the top collaborators of Dana Moshkovitz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dana Moshkovitz. Dana Moshkovitz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Moshkovitz, Dana, et al.. (2023). Almost Chor-Goldreich Sources and Adversarial Random Walks. 1–9. 3 indexed citations
3.
Moshkovitz, Dana, et al.. (2022). Nearly Optimal Pseudorandomness from Hardness. Journal of the ACM. 69(6). 1–55. 4 indexed citations
4.
Moshkovitz, Dana. (2019). Sliding Scale Conjectures in PCP. ACM SIGACT News. 50(3). 25–33. 1 indexed citations
5.
Khot, Subhash, Dor Minzer, Dana Moshkovitz, & Muli Safra. (2018). Small Set Expansion in The Johnson Graph.. 25. 78. 3 indexed citations
6.
Moshkovitz, Dana, et al.. (2018). Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 94. 20. 4 indexed citations
7.
Moshkovitz, Dana, et al.. (2017). Mixing Implies Lower Bounds for Space Bounded Learning.. Conference on Learning Theory. 1516–1566. 1 indexed citations
8.
Moshkovitz, Dana, et al.. (2017). Mixing Implies Lower Bounds for Space Bounded Learning.. 24. 17. 1 indexed citations
9.
Khot, Subhash & Dana Moshkovitz. (2016). Candidate hard unique game. 63–76. 4 indexed citations
10.
Moshkovitz, Dana. (2016). Low-degree test with polynomially small error. Computational Complexity. 26(3). 531–582. 1 indexed citations
11.
Moshkovitz, Dana. (2015). . Theory of Computing. 11(1). 221–235. 30 indexed citations
12.
Moshkovitz, Dana. (2014). An Approach To The Sliding Scale Conjecture Via Parallel Repetition For Low Degree Testing.. Electronic colloquium on computational complexity. 21. 30. 4 indexed citations
13.
Khot, Subhash & Dana Moshkovitz. (2014). Candidate Lasserre Integrality Gap For Unique Games.. Electronic colloquium on computational complexity. 21. 142. 1 indexed citations
14.
Moshkovitz, Dana. (2014). Parallel Repetition of Fortified Games.. Electronic colloquium on computational complexity. 21. 54. 1 indexed citations
15.
Moshkovitz, Dana. (2014). Direct Product Testing With Nearly Identical Sets.. Electronic colloquium on computational complexity. 21. 182. 1 indexed citations
16.
Khot, Subhash & Dana Moshkovitz. (2013). $\mathcal{NP}$-Hardness of Approximately Solving Linear Equations over Reals. SIAM Journal on Computing. 42(3). 752–791. 5 indexed citations
17.
18.
Moshkovitz, Dana. (2011). The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover.. Electronic colloquium on computational complexity. 18. 112.
19.
Moshkovitz, Dana & Subhash Khot. (2010). Hardness of Approximately Solving Linear Equations Over Reals.. Electronic colloquium on computational complexity. 17. 53. 1 indexed citations
20.
Moshkovitz, Dana. (2010). An Alternative Proof of The Schwartz-Zippel Lemma.. Electronic colloquium on computational complexity. 17. 96. 1 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Elena Grigorescu Breakdown of academic impact, for papers by Martha Sideri Breakdown of academic impact, for papers by Ran Duan Breakdown of academic impact, for papers by Magnus Wahlström Breakdown of academic impact, for papers by Toshihiro Fujito Breakdown of academic impact, for papers by Robin A. Moser Breakdown of academic impact, for papers by Shlomi Rubinstein Breakdown of academic impact, for papers by Luděk Kučera Breakdown of academic impact, for papers by Yushi Uno Breakdown of academic impact, for papers by Jochen Alber
Rankless by CCL
2026