Prasad Raghavendra

Publications

2.4K

Citations

H-Index

2004

Active since

Affiliations

University of California, Berkeley(Current)

University of Washington

Princeton University

Microsoft (United States)

Cornell University

Prasad Raghavendra is an author at University of California, Berkeley specializing in engineering, computational complexity, and combinatorial optimization.

ORCID

Top concepts

EngineeringComputer ScienceComputational ComplexityCombinatorial OptimizationDiscrete MathematicsMathematical ProgrammingApproximation TheoryGraph TheoryLinear ProgrammingComputational Geometry

Publications per year

2004–2020

Publications

Optimal algorithms and inapproximability results for every CSP?

Prasad Raghavendra · 2008 · 399 citations

Mathematical Programming, Computational Complexity Theory, Engineering +18

Graph expansion and the unique games conjecture

Prasad Raghavendra, David Steurer · 2010 · 271 citations

Graph Sparsity, Engineering, Graph Theory +15

Lower Bounds on the Size of Semidefinite Programming Relaxations

James R. Lee, Prasad Raghavendra, David Steurer · 2015 · 139 citations

Mathematical Programming, Engineering, Graph Theory +13

Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph

Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra · 2008 · 105 citations

Mathematical Programming, Engineering, Planar Graph +18

Reductions between Expansion Problems

Prasad Raghavendra, David Steurer, Madhur Tulsiani · 2012 · 90 citations

Mathematical Programming, Pade Approximant, Engineering +18

Rows per page

1–5 of 51