Concepedia

Muli Safra

MS

14

Publications

540

Citations

14

H-Index

2003

Active since

Affiliations

Tel Aviv University(Current)

New York University

Princeton University

Muli Safra is an author at Tel Aviv University specializing in combinatorial optimization, engineering, and discrete mathematics.

Top concepts

EngineeringDiscrete MathematicsCombinatorial OptimizationComputational ComplexityComputer ScienceGraph TheoryTheory Of ComputingApproximation TheoryMathematical ProgrammingGames

Publications per year

2003–2023

14

Publications

14

On Non-Approximability for Quadratic Programs

Sanjeev Arora, Eli Berger, Guy Kindler et al. · 2005 · 74 citations

Mathematical Programming, Computational Complexity Theory, Engineering +14

Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

Khot Subhash, Dor Minzer, Muli Safra · 2018 · 71 citations

Engineering, Graph Theory, Random Graph +11

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Per Austrin, Subhash Khot, Muli Safra · 2009 · 60 citations

Engineering, Computational Complexity, Structural Graph Theory +16

On Monotonicity Testing and Boolean Isoperimetric Type Theorems

Subhash Khot, Dor Minzer, Muli Safra · 2015 · 55 citations

Theory Of Computing, Monotonicity Testing, Boolean Function +8

Noise-Resistant Boolean-Functions are Juntas

Guy Kindler, Muli Safra · 2003 · 50 citations

Rows per page

1–5 of 14