| 2025 | STOC | Time and Space Efficient Deterministic Decoders. | Joshua Cook, Dana Moshkovitz |
| 2024 | ISIT | Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate. | Geoffrey Mon, Dana Moshkovitz, Justin Oh |
| 2023 | ISAAC | Regularization of Low Error PCPs and an Application to MCSP. | Shuichi Hirahara, Dana Moshkovitz |
| 2023 | STOC | Almost Chor-Goldreich Sources and Adversarial Random Walks. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2020 | FOCS | Nearly Optimal Pseudorandomness From Hardness. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2017 | COLT | Mixing Implies Lower Bounds for Space Bounded Learning. | Dana Moshkovitz, Michal Moshkovitz |
| 2017 | SODA | Approximation Algorithms for Label Cover and The Log-Density Threshold. | Eden Chlamtc, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan |
| 2016 | FOCS | Amplification and Derandomization without Slowdown. | Ofer Grossman, Dana Moshkovitz |
| 2016 | STOC | Candidate hard unique game. | Subhash Khot, Dana Moshkovitz |
| 2014 | FOCS | Parallel Repetition from Fortification. | Dana Moshkovitz |
| 2013 | ESA | Improved Approximation Algorithms for Projection Games - (Extended Abstract). | Pasin Manurangsi, Dana Moshkovitz |
| 2013 | ISIT | Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel. | Vitaly Abdrashitov, Muriel Mdard, Dana Moshkovitz |
| 2011 | STOC | NP-hardness of approximately solving linear equations over reals. | Subhash Khot, Dana Moshkovitz |
| 2010 | STOC | Erratum for: on basing one-way functions on NP-hardness. | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
| 2008 | FOCS | Two Query PCP with Sub-Constant Error. | Dana Moshkovitz, Ran Raz |
| 2006 | STOC | On basing one-way functions on NP-hardness. | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
| 2006 | STOC | Sub-constant error low degree test of almost-linear size. | Dana Moshkovitz, Ran Raz |