( en | de | ru )

 

Disambiguation of "Moshkovitz, Dana"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Approximation Algorithms for Projection Games - (Extended Abstract).

, and . ESA, volume 8125 of Lecture Notes in Computer Science, page 683-694. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Antonios K Danassis

Ataollah Danai

Ingeborg Danai

Michelle Danaher

Antonios K Danassis

 

Other publications of authors with the same name

NP-hardness of approximately solving linear equations over reals., and . STOC, page 413-420. ACM, (2011)Direct Product Testing With Nearly Identical Sets.. Electron. Colloquium Comput. Complex., (2014)Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate., , and . Electron. Colloquium Comput. Complex., (2023)Nearly Optimal Pseudorandomness From Hardness., , , and . Electron. Colloquium Comput. Complex., (2019)Improved Approximation Algorithms for Projection Games - (Extended Abstract)., and . ESA, volume 8125 of Lecture Notes in Computer Science, page 683-694. Springer, (2013)Regularization of Low Error PCPs and an Application to MCSP., and . ISAAC, volume 283 of LIPIcs, page 39:1-39:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Tighter MA/1 Circuit Lower Bounds From Verifier Efficient PCPs for PSPACE., and . Electron. Colloquium Comput. Complex., (2022)Parallel Repetition of Fortified Games.. Electron. Colloquium Comput. Complex., (2014)Mixing Implies Lower Bounds for Space Bounded Learning., and . Electron. Colloquium Comput. Complex., (2017)Nearly Optimal Pseudorandomness From Hardness., , , and . FOCS, page 1057-1068. IEEE, (2020)