Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Raghu Meka
Observed name:
Meka, Raghu
Institutions:
University of California, Los Angeles,
Princeton University
Observed institutions:
Microsoft (United States),
Google (United States),
Harvard University,
University of California, Los Angeles,
Princeton University,
Institute for Advanced Study,
The University of Texas at Austin,
University of California, Berkeley
show all 8
ORCID:
0009-0004-7676-2762
Observed ORCID:
0009-0004-7676-2762
OpenAlex ID:
A5044675813
Guaranteed Rank Minimization via Singular Value Projection
2010
·
Prateek Jain
, Raghu Meka
, et al.
·
388
Sum-of-squares Lower Bounds for Planted Clique
2015
·
Raghu Meka
, Aaron Potechin
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
78
Learning Graphical Models Using Multiplicative Weights
2017
·
Adam Klivans
, Raghu Meka
·
Annual Symposium on Foundations of Computer Science
·
76
PDF
Rank minimization via online learning
2008
·
Raghu Meka
, Prateek Jain
, et al.
·
International Conference on Machine Learning
·
68
Guaranteed Rank Minimization via Singular Value Projection
2009
·
Meka, Raghu
, Jain, Prateek
, et al.
·
arXiv (Cornell University)
·
67
PDF
Constructive Discrepancy Minimization by Walking on the Edges
2015
·
Shachar Lovett
, Raghu Meka
·
SIAM Journal on Computing
·
65
Pseudorandom generators for polynomial threshold functions
2010
·
Raghu Meka
, David Zuckerman
·
ACM Symposium on Theory of Computing (STOC)
·
60
Constructive Discrepancy Minimization by Walking on the Edges
2012
·
Shachar Lovett
, Raghu Meka
·
Annual Symposium on Foundations of Computer Science
·
57
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
2012
·
Parikshit Gopalan
, Raghu Meka
, et al.
·
Annual Symposium on Foundations of Computer Science
·
55
Making the Long Code Shorter
2012
·
Boaz Barak
, Parikshit Gopalan
, et al.
·
Annual Symposium on Foundations of Computer Science
·
55
Pseudorandomness from Shrinkage
2012
·
Russell Impagliazzo
, Raghu Meka
, et al.
·
Annual Symposium on Foundations of Computer Science
·
54
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
2010
·
Ilias Diakonikolas
, Prahladh Harsha
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
54
An FPTAS for #Knapsack and Related Counting Problems
2011
·
Parikshit Gopalan
, Adam Klivans
, et al.
·
Annual Symposium on Foundations of Computer Science
·
52
Rectangles Are Nonnegative Juntas
2016
·
Mika Göös
, Shachar Lovett
, et al.
·
SIAM Journal on Computing
·
47
Simultaneous Unsupervised Learning of Disparate Clusterings
2008
·
Prateek Jain
, Raghu Meka
, et al.
·
Statistical Analysis and Data Mining The ASA Data Science Journal
·
47
Matrix Completion from Power-Law Distributed Samples
2009
·
Raghu Meka
, Prateek Jain
, et al.
·
neural information processing systems
·
44
Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
2017
·
Pravesh K. Kothari
, Raghu Meka
, et al.
·
ACM SIGACT Symposium on Theory of Computing (STOC)
·
42
Untitled
2016
·
Raghu Meka
, Oanh Nguyen
, et al.
·
Theory of Computing
·
42
PDF
Almost Optimal Explicit Johnson-Lindenstrauss Families
2011
·
Daniel Kane
, Raghu Meka
, et al.
·
Lecture notes in computer science
·
39
Learning One Convolutional Layer with Overlapping Patches
2018
·
Goel, Surbhi
, Klivans, Adam
, et al.
·
arXiv (Cornell University)
·
38
PDF
DNF sparsification and a faster deterministic counting algorithm
2013
·
Parikshit Gopalan
, Raghu Meka
, et al.
·
Computational Complexity
·
37
Bounding the sensitivity of polynomial threshold functions
2009
·
Prahladh Harsha
, Adam Klivans
, et al.
·
37
Pseudorandom Generators for Polynomial Threshold Functions
2013
·
Raghu Meka
, David Zuckerman
·
SIAM Journal on Computing
·
35
Computational Limits for Matrix Completion
2014
·
Hardt, Moritz
, Meka, Raghu
, et al.
·
arXiv (Cornell University)
·
32
PDF
Pseudorandom Generators for Combinatorial Shapes
2011
·
Parikshit Gopalan
, Raghu Meka
, et al.
·
SIAM Journal on Computing
·
32
Show more works
View as search
Works count:
146
Citation count:
2,236
H-index:
27
I10-index:
53
Year
Topic
Type
