Volgen
Dana Moshkovitz
Dana Moshkovitz
Geverifieerd e-mailadres voor cs.utexas.edu
Titel
Geciteerd door
Geciteerd door
Jaar
Algorithmic construction of sets for k-restrictions
N Alon, D Moshkovitz, S Safra
ACM Transactions on Algorithms (TALG) 2 (2), 153-177, 2006
3382006
Two-query PCP with subconstant error
D Moshkovitz, R Raz
Journal of the ACM (JACM) 57 (5), 1-29, 2008
1962008
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
D Moshkovitz
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
1482012
On basing one-way functions on NP-hardness
A Akavia, O Goldreich, S Goldwasser, D Moshkovitz
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
1002006
Inapproximability of densest κ-subgraph from average case hardness
N Alon, S Arora, R Manokaran, D Moshkovitz, O Weinstein
Unpublished manuscript 1, 6, 2011
872011
AM with multiple Merlins
S Aaronson, R Impagliazzo, D Moshkovitz
2014 IEEE 29th Conference on Computational Complexity (CCC), 44-55, 2014
642014
Sub-constant error low degree test of almost-linear size
D Moshkovitz, R Raz
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing …, 2006
572006
Mixing implies lower bounds for space bounded learning
D Moshkovitz, M Moshkovitz
Conference on Learning Theory, 1516-1566, 2017
382017
Parallel repetition from fortification
D Moshkovitz
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 414-423, 2014
34*2014
Entropy samplers and strong generic lower bounds for space bounded learning
D Moshkovitz, M Moshkovitz
9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 2018
30*2018
Sub-constant error probabilistically checkable proof of almost-linear size
D Moshkovitz, R Raz
computational complexity 19 (3), 367-422, 2010
262010
NP-hardness of approximately solving linear equations over reals
S Khot, D Moshkovitz
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
212011
An Alternative Proof of The Schwartz-Zippel Lemma.
D Moshkovitz
Electron. Colloquium Comput. Complex. 17, 96, 2010
212010
Candidate Hard Unique Game
S Khot, D Moshkovitz
The 48th Annual Symposium on the Theory of Computing (STOC'16), 2016
202016
Approximation algorithms for label cover and the log-density threshold
E Chlamtáč, P Manurangsi, D Moshkovitz, A Vijayaraghavan
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
192017
Nearly optimal pseudorandomness from hardness
D Doron, D Moshkovitz, J Oh, D Zuckerman
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
182020
Small Set Expansion in The Johnson Graph.
S Khot, D Minzer, D Moshkovitz, M Safra
Electron. Colloquium Comput. Complex. 25, 78, 2018
182018
Improved approximation algorithms for projection games
P Manurangsi, D Moshkovitz
European Symposium on Algorithms, 683-694, 2013
15*2013
Erratum for: On basing one-way functions on NP-hardness
A Akavia, O Goldreich, S Goldwasser, D Moshkovitz
Proceedings of the forty-second ACM symposium on Theory of computing, 795-796, 2010
112010
Low-degree test with polynomially small error
D Moshkovitz
computational complexity 26 (3), 531-582, 2017
10*2017
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20