| Algorithmic construction of sets for k-restrictions N Alon, D Moshkovitz, S Safra ACM Transactions on Algorithms (TALG) 2 (2), 153-177, 2006 | 379 | 2006 |
| Two-query PCP with subconstant error D Moshkovitz, R Raz Journal of the ACM (JACM) 57 (5), 1-29, 2008 | 229 | 2008 |
| The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover D Moshkovitz International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 187 | 2012 |
| On basing one-way functions on NP-hardness A Akavia, O Goldreich, S Goldwasser, D Moshkovitz Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 123 | 2006 |
| Inapproximability of densest κ-subgraph from average case hardness N Alon, S Arora, R Manokaran, D Moshkovitz, O Weinstein Unpublished manuscript 1, 6, 2011 | 100 | 2011 |
| Sub-constant error low degree test of almost-linear size D Moshkovitz, R Raz Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing …, 2006 | 68 | 2006 |
| AM with multiple Merlins S Aaronson, R Impagliazzo, D Moshkovitz 2014 IEEE 29th Conference on Computational Complexity (CCC), 44-55, 2014 | 65 | 2014 |
| Mixing implies lower bounds for space bounded learning D Moshkovitz, M Moshkovitz Conference on Learning Theory, 1516-1566, 2017 | 56 | 2017 |
| Nearly optimal pseudorandomness from hardness D Doron, D Moshkovitz, J Oh, D Zuckerman Journal of the ACM 69 (6), 1-55, 2022 | 51 | 2022 |
| Entropy samplers and strong generic lower bounds for space bounded learning D Moshkovitz, M Moshkovitz 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 28 …, 2018 | 44* | 2018 |
| Parallel repetition from fortification D Moshkovitz 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 414-423, 2014 | 37* | 2014 |
| Small set expansion in the Johnson graph S Khot, D Minzer, D Moshkovitz, M Safra Theory of Computing 21 (1), 1-43, 2025 | 34 | 2025 |
| Sub-constant error probabilistically checkable proof of almost-linear size D Moshkovitz, R Raz computational complexity 19 (3), 367-422, 2010 | 32 | 2010 |
| An alternative proof of the Schwartz-Zippel lemma D Moshkovitz Electronic Colloquium on Computational Complexity (ECCC) 17 (96), 34, 2010 | 30 | 2010 |
| Candidate Hard Unique Game S Khot, D Moshkovitz The 48th Annual Symposium on the Theory of Computing (STOC'16), 2016 | 27 | 2016 |
| NP-hardness of approximately solving linear equations over reals S Khot, D Moshkovitz Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 24 | 2011 |
| Approximation algorithms for label cover and the log-density threshold E Chlamtáč, P Manurangsi, D Moshkovitz, A Vijayaraghavan Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 22 | 2017 |
| Improved approximation algorithms for projection games P Manurangsi, D Moshkovitz European Symposium on Algorithms, 683-694, 2013 | 18* | 2013 |
| Approximating dense max 2-CSPs P Manurangsi, D Moshkovitz arXiv preprint arXiv:1507.08348, 2015 | 16 | 2015 |
| Erratum for: On basing one-way functions on NP-hardness A Akavia, O Goldreich, S Goldwasser, D Moshkovitz Proceedings of the forty-second ACM symposium on Theory of computing, 795-796, 2010 | 16 | 2010 |
Ran RazPrinceton UniversityVerified email at princeton.edu
