Dana Moshkovitz

Publications

524

Citations

H-Index

2006

Active since

Affiliations

The University of Texas at Austin(Current)

Moscow Institute of Thermal Technology

Weizmann Institute of Science

New York University

Massachusetts Institute of Technology

Dana Moshkovitz is an author at The University of Texas at Austin specializing in engineering, computational complexity, and combinatorial optimization.

ORCID

Top concepts

EngineeringComputational ComplexityComputer ScienceCombinatorial OptimizationDiscrete MathematicsProbabilityTheory Of ComputingMathematical ProgrammingGraph TheoryApproximation Theory

Publications per year

2006–2022

Publications

Algorithmic construction of sets for <i>k</i> -restrictions

Noga Alon, Dana Moshkovitz · ACM Transactions on Algorithms · 2006 · 297 citations

Theory Of Computing, K Positions, Engineering +13

On basing one-way functions on NP-hardness

Adi Akavia, Oded Goldreich, Shafi Goldwasser et al. · 2006 · 72 citations

Circuit Complexity, Mathematical Programming, Computational Complexity Theory +13

AM with Multiple Merlins

Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz · 2014 · 26 citations

Theory Of Computing, Quantum Science, Computational Complexity Theory +14

Small Set Expansion in The Johnson Graph.

Subhash Khot, Dor Minzer, Dana Moshkovitz et al. · Electron. Colloquium Comput. Complex. · 2018 · 24 citations

Graph Minor, Graph Theory, Extremal Graph Theory +4

Nearly Optimal Pseudorandomness from Hardness

Dean Doron, Dana Moshkovitz, Justin Oh et al. · Journal of the ACM · 2022 · 18 citations

Theory Of Computing, Circuit Complexity, Computational Complexity Theory +15

Rows per page

1–5 of 11