Dana Moshkovitz
Professor
Research
Research Areas:
Research Interests:
- Probabilistically Checkable Proofs (PCP)
- Pseudorandomness
- Coding Theory
Research Labs & Affiliations:
Theory Group
Select Publications
Subhash Khot, Dor Minzer, Dana Moshkovitz, Shmuel Safra. April 23 2018. Small Set Expansion in The Johnson Graph. Colloquium on Computational Complexity. Trier, Germany.
Dana Moshkovitz, Michal Moshkovitz. July 5 2018. Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Dana Moshkovitz, Michal Moshkovitz. JUN 18 2017. Mixing Implies Lower Bounds For Space Bounded Learning. Electronic Colloquium on Computational Complexity.
Eden Chlamtáč, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan. JAN 16 2017. Approximation Algorithms for Label Cover and The Log-Density Threshold. Society for Industrial and Applied Mathematics.
Ofer Grossman, Dana Moshkovitz. OCT 9 2016. Amplification and derandomization without slowdown. IEEE. 770-779.