Raghu Meka - Concepedia

Author

Raghu Meka

The University of Texas at Austin ORCID

Also Known As

Alman, Josh, Meka, Raghu, Raghu Meka

136

Publications

Citations

H-Index

Concepts

All Affiliations

The University of Texas at Austin University of California, Los Angeles Institute for Advanced Study Microsoft (United States)Silicon Valley Community Foundation

About

Raghu Meka is an author at The University of Texas at Austin specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	22	28	1.1K
2	Computer Science	21	24	1K
3	Data Science	9	9	410
4	Education	1	1	11
5	Management	1	1	31

Raghu Meka

Publications

1.7K

Citations

H-Index

Page 1

	Year	Citations
Guaranteed Rank Minimization via Singular Value Projection Prateek Jain, Raghu Meka, Inderjit S. Dhillon	2010	419
Sum-of-squares Lower Bounds for Planted Clique Raghu Meka, Aaron Potechin, Avi Wigderson Mathematical ProgrammingEngineeringClique VariantComputational ComplexityComplexity	2015	85
Guaranteed Rank Minimization via Singular Value Projection Raghu Meka, Prateek Jain, Inderjit S. Dhillon ArXiv.org Mathematical ProgrammingSparse RepresentationEngineeringMachine LearningData Science	2009	74
Rank minimization via online learning Raghu Meka, Prateek Jain, Constantine Caramanis, Mathematical ProgrammingArtificial IntelligenceRanking AlgorithmEngineeringMachine Learning	2008	70
Pseudorandom generators for polynomial threshold functions Raghu Meka, David Zuckerman Mathematical ProgrammingTheory Of ComputingThreshold FunctionsComputational Complexity TheoryEngineering	2010	62
Constructive Discrepancy Minimization by Walking on the Edges Shachar Lovett, Raghu Meka SIAM Journal on Computing Mathematical ProgrammingComputational Complexity TheoryEngineeringConstructive Discrepancy MinimizationComputational Complexity	2015	59
Pseudorandomness from Shrinkage Russell Impagliazzo, Raghu Meka, David Zuckerman Theory Of ComputingComputational Complexity TheoryEngineeringEntropyPseudo-random Sequence	2012	58
Constructive Discrepancy Minimization by Walking on the Edges Shachar Lovett, Raghu Meka	2012	58
Making the Long Code Shorter Boaz Barak, Parikshit Gopalan, Johan Håstad, Theory Of ComputingComputational Complexity TheoryLong Code ShorterGraph TheoryEngineering	2012	58
An FPTAS for #Knapsack and Related Counting Problems Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Mathematical ProgrammingInteger CapacityEngineeringComputational ComplexityDiscrete Optimization	2011	53

Page 1