Prasad Raghavendra - Concepedia

Author

Prasad Raghavendra

University of California, Berkeley ORCID

Also Known As

Ghoshal, Suprovat, PRASAD RAGHAVENDRA, Prasad Raghavendra, R. Lee, Raghavendra Prasad, Raghavendra Prasad S.A, Raghavendra, Prasad

131

Publications

2.8K

Citations

H-Index

Concepts

All Affiliations

University of California, Berkeley University of Washington Princeton University Microsoft (United States)Cornell University

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	25	40	2.2K
2	Business	7	7	940
3	Education	2	2	50
4	Natural Sciences	1	1	13
5	Communication	1	1	12

Prasad Raghavendra

Publications

2.4K

Citations

H-Index

Page 1

	Year	Citations
Optimal algorithms and inapproximability results for every CSP? Prasad Raghavendra Mathematical ProgrammingComputational Complexity TheoryEngineeringSemi-infinite OptimizationGame Theory	2008	399
Graph expansion and the unique games conjecture Prasad Raghavendra, David Steurer Graph SparsityEngineeringGraph TheoryExtremal Graph TheoryStructural Graph Theory	2010	271
Lower Bounds on the Size of Semidefinite Programming Relaxations James R. Lee, Prasad Raghavendra, David Steurer Mathematical ProgrammingEngineeringGraph TheoryStable Set PolytopesSemi-infinite Optimization	2015	139
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra Mathematical ProgrammingEngineeringPlanar GraphComputational ComplexityFeedback Arc	2008	105
Reductions between Expansion Problems Prasad Raghavendra, David Steurer, Madhur Tulsiani Mathematical ProgrammingPade ApproximantEngineeringCombinatorial GameGame Theory	2012	90
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES Prasad Raghavendra, David Steurer Mathematical ProgrammingComputational Complexity TheoryEngineeringGame TheoryComputational Complexity	2009	90
Hardness of Learning Halfspaces with Noise Venkatesan Guruswami, Prasad Raghavendra Mathematical ProgrammingComputational Complexity TheoryEngineeringMachine LearningComputational Complexity	2006	71
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Mathematical ProgrammingEngineeringComputational ComplexitySemidefinite ProgrammingSdp Gaps	2008	69
Hardness of Learning Halfspaces with Noise Venkatesan Guruswami, Prasad Raghavendra SIAM Journal on Computing Mathematical ProgrammingComputational Complexity TheoryEngineeringMachine LearningData Science	2009	59
Approximate Constraint Satisfaction Requires Large LP Relaxations Siu On Chan, James R. Lee, Prasad Raghavendra, Mathematical ProgrammingConstraint SolvingEngineeringConstraint SatisfactionMax Cut	2013	58

Page 1