Dana Moshkovitz

Dana Moshkovitz: The tale of the PCP theorem. ACM Crossroads 18(3): 23-26 (2012)

Dana Moshkovitz: Guest column: algebraic construction of projection PCPs. SIGACT News 43(1): 62-81 (2012)

Dana Moshkovitz: The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover. APPROX-RANDOM 2012: 276-287

Subhash Khot, Dana Moshkovitz: NP-hardness of approximately solving linear equations over reals. STOC 2011: 413-420

Dana Moshkovitz: The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover. Electronic Colloquium on Computational Complexity (ECCC) 18: 112 (2011)

Dana Moshkovitz, Ran Raz: Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size. Computational Complexity 19(3): 367-422 (2010)

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

Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz: Erratum for: on basing one-way functions on NP-hardness. STOC 2010: 795-796

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, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer: Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010)

Dana Moshkovitz, Subhash Khot: Hardness of Approximately Solving Linear Equations Over Reals. Electronic Colloquium on Computational Complexity (ECCC) 17: 53 (2010)

Dana Moshkovitz: An Alternative Proof of The Schwartz-Zippel Lemma. Electronic Colloquium on Computational Complexity (ECCC) 17: 96 (2010)

Subhash Khot, Dana Moshkovitz: NP-Hardness of Approximately Solving Linear Equations Over Reals. Electronic Colloquium on Computational Complexity (ECCC) 17: 112 (2010)

Dana Moshkovitz, Ran Raz: Sub-Constant Error Low Degree Test of Almost-Linear Size. SIAM J. Comput. 38(1): 140-180 (2008)

Dana Moshkovitz, Ran Raz: Two Query PCP with Sub-Constant Error. FOCS 2008: 314-323

Dana Moshkovitz, Ran Raz: Two Query PCP with Sub-Constant Error. Electronic Colloquium on Computational Complexity (ECCC) 15(071) (2008)

Dana Moshkovitz, Ran Raz: Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size. Electronic Colloquium on Computational Complexity (ECCC) 14(026) (2007)

Noga Alon, Dana Moshkovitz, Shmuel Safra: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2(2): 153-177 (2006)

Dana Moshkovitz, Ran Raz: Sub-constant error low degree test of almost-linear size. STOC 2006: 21-30

Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz: On basing one-way functions on NP-hardness. STOC 2006: 701-710

Dana Moshkovitz, Ran Raz: Sub-Constant Error Low Degree Test of Almost Linear Size. Electronic Colloquium on Computational Complexity (ECCC)(086) (2005)