On basing one-way functions on NP-hardness. - Adi Akavia; Oded Goldreich 001; Shafi Goldwasser; Dana Moshkovitz (STOC, 2006)

Algorithmic construction of sets for k-restrictions. - Noga Alon; Dana Moshkovitz; Shmuel Safra (ACM Trans. Algorithms, 2006)

Two Query PCP with Sub-Constant Error. - Dana Moshkovitz; Ran Raz (Electron. Colloquium Comput. Complex., 2008)

Sub-Constant Error Low Degree Test of Almost-Linear Size. - Dana Moshkovitz; Ran Raz (SIAM J. Comput., 2008)

Erratum for: on basing one-way functions on NP-hardness. - Adi Akavia; Oded Goldreich 001; Shafi Goldwasser; Dana Moshkovitz (STOC, 2010)

Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size. - Dana Moshkovitz; Ran Raz (Comput. Complex., 2010)

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) - Prahladh Harsha; Moses Charikar; Matthew Andrews; Sanjeev Arora; Subhash Khot; Dana Moshkovitz; Lisa Zhang; Ashkan Aazami; Dev Desai; Igor Gorodezky; Geetha Jagannathan; Alexander S. Kulikov; et al. (CoRR, 2010)

NP-Hardness of Approximately Solving Linear Equations Over Reals. - Subhash Khot; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2010)

An Alternative Proof of The Schwartz-Zippel Lemma. - Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2010)

Hardness of Approximately Solving Linear Equations Over Reals. - Dana Moshkovitz; Subhash Khot (Electron. Colloquium Comput. Complex., 2010)

Two-query PCP with subconstant error. - Dana Moshkovitz; Ran Raz (J. ACM, 2010)

The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover. - Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2011)

The tale of the PCP theorem. - Dana Moshkovitz (XRDS, 2012)

Guest column: algebraic construction of projection PCPs. - Dana Moshkovitz (SIGACT News, 2012)

Improved Approximation Algorithms for Projection Games - (Extended Abstract). - Pasin Manurangsi; Dana Moshkovitz (ESA, 2013)

Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel. - Vitaly Abdrashitov; Muriel Médard; Dana Moshkovitz (ISIT, 2013)

NP-Hardness of Approximately Solving Linear Equations over Reals. - Subhash Khot; Dana Moshkovitz (SIAM J. Comput., 2013)

Parallel Repetition from Fortification. - Dana Moshkovitz (FOCS, 2014)

AM with Multiple Merlins. - Scott Aaronson; Russell Impagliazzo; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2014)

Candidate Lasserre Integrality Gap For Unique Games. - Subhash Khot; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2014)

An Approach To The Sliding Scale Conjecture Via Parallel Repetition For Low Degree Testing. - Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2014)

Parallel Repetition of Fortified Games. - Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2014)

Direct Product Testing With Nearly Identical Sets. - Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2014)

Approximating Dense Max 2-CSPs. - Pasin Manurangsi; Dana Moshkovitz (APPROX-RANDOM, 2015)

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian. - Dana Moshkovitz; Govind Ramnarayan; Henry Yuen (APPROX-RANDOM, 2016)

Candidate hard unique game. - Subhash Khot; Dana Moshkovitz (STOC, 2016)

Approximation Algorithms for Label Cover and The Log-Density Threshold. - Eden Chlamtác; Pasin Manurangsi; Dana Moshkovitz; Aravindan Vijayaraghavan (SODA, 2017)

Improved Approximation Algorithms for Projection Games. - Pasin Manurangsi; Dana Moshkovitz (Algorithmica, 2017)

Low-degree test with polynomially small error. - Dana Moshkovitz (Comput. Complex., 2017)

Mixing Implies Lower Bounds for Space Bounded Learning. - Michal Moshkovitz; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2017)

Mixing Implies Strong Lower Bounds for Space Bounded Learning. - Michal Moshkovitz; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2017)

Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning. - Dana Moshkovitz; Michal Moshkovitz (ITCS, 2018)

Small Set Expansion in The Johnson Graph. - Subhash Khot; Dor Minzer; Dana Moshkovitz; Muli Safra (Electron. Colloquium Comput. Complex., 2018)

Nearly Optimal Pseudorandomness From Hardness. - Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Special Section on the Fifty-First Annual ACM Sympositum on the Theory of Computing (STOC 2019). - Dana Moshkovitz; Sushant Sachdeva (SIAM J. Comput., 2019)

Sliding Scale Conjectures in PCP. - Dana Moshkovitz (SIGACT News, 2019)

Randomness Efficient Noise Stability and Generalized Small Bias Sets. - Dana Moshkovitz; Justin Oh; David Zuckerman (FSTTCS, 2020)

Reduction From Non-Unique Games To Boolean Unique Games. - Ronen Eldan; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2020)

Amplification and Derandomization without Slowdown. - Ofer Grossman; Dana Moshkovitz (SIAM J. Comput., 2020)

Near-Optimal Cayley Expanders for Abelian Groups. - Akhil Jalan; Dana Moshkovitz (FSTTCS, 2021)

Strong Parallel Repetition for Unique Games on Small Set Expanders. - Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2021)

Tighter MA/1 Circuit Lower Bounds From Verifier Efficient PCPs for PSPACE. - Joshua Cook; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2022)

Almost Chor-Goldreich Sources and Adversarial Random Walks. - Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman (Electron. Colloquium Comput. Complex., 2022)

Regularization of Low Error PCPs and an Application to MCSP. - Shuichi Hirahara; Dana Moshkovitz (ISAAC, 2023)

Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate. - Geoffrey Mon; Dana Moshkovitz; Justin Oh (Electron. Colloquium Comput. Complex., 2023)

Explicit Time and Space Efficient Encoders Exist Only With Random Access. - Joshua Cook; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2024)

Time and Space Efficient Deterministic Decoders. - Joshua Cook; Dana Moshkovitz (Electron. Colloquium Comput. Complex., 2024)

Online Condensing of Unpredictable Sources via Random Walks. - Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman (Electron. Colloquium Comput. Complex., 2024)