Dana Moshkovitz

发表

Inapproximabilty of Densest κ-Subgraph from Average Case Hardness

Sanjeev Arora, N. Alon, Omri Weinstein, 2011 .

Randomness Efficient Noise Stability and Generalized Small Bias Sets

David Zuckerman, Dana Moshkovitz, Justin Oh, 2020, FSTTCS.

Ja n 20 14 AM with Multiple Merlins

R. Impagliazzo, S. Aaronson, Dana Moshkovitz, 2018 .

18.405J S16 Lecture 21: P vs BPP 2

Dana Moshkovitz, 2012 .

Tighter MA/1 Circuit Lower Bounds From Verifier Efficient PCPs for PSPACE

Dana Moshkovitz, Joshua Cook, 2022, Electron. Colloquium Comput. Complex..

Reduction From Non-Unique Games To Boolean Unique Games

Ronen Eldan, Dana Moshkovitz, Ronen Eldan, 2020, Electron. Colloquium Comput. Complex..

Approximating kCSP For Large Alphabets

Dana Moshkovitz, Gil Goldshlager, 2015 .

Minimum Spanning Tree in Deterministic Linear Time For Graphs of High Girth

R. Tarjan, Sarah Eisenstat, Dana Moshkovitz, 2014 .

A No-Go Theorem for Derandomized Parallel Repetition by Govind Ramnarayan

Dana Moshkovitz, Govind Ramnarayan, 2016 .

Almost Chor-Goldreich Sources and Adversarial Random Walks

D. Zuckerman, Dana Moshkovitz, Dean Doron, 2023, Electron. Colloquium Comput. Complex..

398 Approximating Dense Max 2-CSPs

Pasin Manurangsi, Dana Moshkovitz, 2015 .

Strong Parallel Repetition for Unique Games on Small Set Expanders

Dana Moshkovitz, Dana Moshkovitz, 2021, Empirical Software Engineering.

Algorithmic construction of sets for

Noga Alon, Shmuel Safra, Dana Moshkovitz, 2006 .

Two Query PCP with Sub-Constant Error

Ran Raz, Dana Moshkovitz, R. Raz, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Near-Optimal Cayley Expanders for Abelian Groups pdf

Dana Moshkovitz, Akhil Jalan, Dana Moshkovitz, 2021, FSTTCS.

Nearly Optimal Pseudorandomness From Hardness

David Zuckerman, Dean Doron, Dana Moshkovitz, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Low-degree test with polynomially small error

Dana Moshkovitz, Dana Moshkovitz, 2017, computational complexity.

Parallel Repetition from Fortification

Dana Moshkovitz, Dana Moshkovitz, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Algorithmic construction of sets for k-restrictions

Noga Alon, Shmuel Safra, Dana Moshkovitz, 2006, TALG.

Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning

Dana Moshkovitz, Michal Moshkovitz, Dana Moshkovitz, 2018, ITCS.

Mixing Implies Lower Bounds for Space Bounded Learning

Dana Moshkovitz, Michal Moshkovitz, Dana Moshkovitz, 2017, COLT.

The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover

Dana Moshkovitz, Dana Moshkovitz, 2012, Theory Comput..

AM with Multiple Merlins

Russell Impagliazzo, Scott Aaronson, Dana Moshkovitz, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

Sub-constant error low degree test of almost-linear size

Ran Raz, Dana Moshkovitz, R. Raz, 2006, STOC '06.

An Approach To The Sliding Scale Conjecture Via Parallel Repetition For Low Degree Testing

Dana Moshkovitz, Dana Moshkovitz, 2014, Electron. Colloquium Comput. Complex..

Approximation Algorithms for Label Cover and The Log-Density Threshold

Aravindan Vijayaraghavan, Pasin Manurangsi, Dana Moshkovitz, 2017, SODA.

Approximating Dense Max 2-CSPs

Pasin Manurangsi, Dana Moshkovitz, Pasin Manurangsi, 2015, APPROX-RANDOM.

On basing one-way functions on NP-hardness

Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz, 2006, STOC '06.

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian

Govind Ramnarayan, Dana Moshkovitz, Henry Yuen, 2016, APPROX-RANDOM.

Guest column: algebraic construction of projection PCPs

Dana Moshkovitz, Dana Moshkovitz, 2012, SIGA.

Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size

Ran Raz, Dana Moshkovitz, R. Raz, 2010, computational complexity.

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) pdf

Aleksandar Nikolov, David Pritchard, Lisa Zhang, 2010, ArXiv.

Parallel Repetition of Fortified Games

Dana Moshkovitz, Dana Moshkovitz, 2014, Electron. Colloquium Comput. Complex..

Algebraic Construction of Projection PCPs

Dana Moshkovitz, 2012 .

Lecture 19 — November 15 , 2012

Badih Ghazi, Dana Moshkovitz, 2012 .

Sliding Scale Conjectures in PCP

Dana Moshkovitz, Dana Moshkovitz, 2019, SIGACT News.

Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate

Dana Moshkovitz, Geoffrey Mon, Justin Oh, 2023, Electron. Colloquium Comput. Complex..