Dana Moshkovitz
Dana Moshkovitz
Bestätigte E-Mail-Adresse bei cs.utexas.edu
Titel
Zitiert von
Zitiert von
Jahr
Algorithmic construction of sets for k-restrictions
N Alon, D Moshkovitz, S Safra
ACM Transactions on Algorithms (TALG) 2 (2), 153-177, 2006
3152006
Two-query PCP with subconstant error
D Moshkovitz, R Raz
Journal of the ACM (JACM) 57 (5), 1-29, 2008
1792008
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
D Moshkovitz
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
1302012
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
822006
Inapproximability of densest κ-subgraph from average case hardness
N Alon, S Arora, R Manokaran, D Moshkovitz, O Weinstein
Unpublished manuscript 1, 2011
752011
AM with multiple Merlins
S Aaronson, R Impagliazzo, D Moshkovitz
2014 IEEE 29th Conference on Computational Complexity (CCC), 44-55, 2014
562014
Sub-constant error low degree test of almost-linear size
D Moshkovitz, R Raz
SIAM Journal on Computing 38 (1), 140-180, 2008
522008
Mixing implies lower bounds for space bounded learning
D Moshkovitz, M Moshkovitz
Conference on Learning Theory, 1516-1566, 2017
322017
Parallel repetition from fortification
D Moshkovitz
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 414-423, 2014
31*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
25*2018
Sub-constant error probabilistically checkable proof of almost-linear size
D Moshkovitz, R Raz
computational complexity 19 (3), 367-422, 2010
252010
-Hardness of Approximately Solving Linear Equations over Reals
S Khot, D Moshkovitz
SIAM Journal on Computing 42 (3), 752-791, 2013
212013
An Alternative Proof of The Schwartz-Zippel Lemma.
D Moshkovitz
Electronic Colloquium on Computational Complexity (ECCC) 17 (96), 34, 2010
202010
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
182017
Candidate Hard Unique Game
S Khot, D Moshkovitz
The 48th Annual Symposium on the Theory of Computing (STOC'16), 2016
17*2016
Improved approximation algorithms for projection games
P Manurangsi, D Moshkovitz
European Symposium on Algorithms, 683-694, 2013
13*2013
Small Set Expansion in The Johnson Graph.
S Khot, D Minzer, D Moshkovitz, M Safra
Electronic Colloquium on Computational Complexity (ECCC) 25, 78, 2018
122018
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
82020
Low-degree test with polynomially small error
D Moshkovitz
computational complexity 26 (3), 531-582, 2017
8*2017
Approximating dense max 2-CSPs
P Manurangsi, D Moshkovitz
arXiv preprint arXiv:1507.08348, 2015
72015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20