pith. sign in

Raghu Meka

Identifiers

  • name variant Raghu Meka 0.60 · backfill

Papers (28)

  1. Moonflowers and efficient code sparsification math.CO · 2026 · author #2
  2. Average Bias and Polynomial Sources cs.CC · 2019 · author #4
  3. On the discrepancy of random low degree set systems cs.DS · 2018 · author #2
  4. Pseudorandom Generators for Width-3 Branching Programs cs.CC · 2018 · author #1
  5. Learning One Convolutional Layer with Overlapping Patches cs.LG · 2018 · author #3
  6. Learning Graphical Models Using Multiplicative Weights cs.LG · 2017 · author #2
  7. Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs cs.CC · 2016 · author #2
  8. Explicit resilient functions matching Ajtai-Linial cs.CC · 2015 · author #1
  9. Anti-concentration for polynomials of independent random variables math.PR · 2015 · author #1
  10. Pseudorandomness via the discrete Fourier transform cs.CC · 2015 · author #3
  11. Sum-of-squares lower bounds for planted clique cs.CC · 2015 · author #1
  12. Almost Optimal Pseudorandom Generators for Spherical Caps cs.CC · 2014 · author #2
  13. Pseudorandomness for concentration bounds and signed majorities cs.CC · 2014 · author #3
  14. Computational Limits for Matrix Completion cs.CC · 2014 · author #2
  15. Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique cs.CC · 2013 · author #1
  16. Moment-Matching Polynomials cs.CC · 2013 · author #2
  17. A PRG for Lipschitz Functions of Polynomials with Applications to Sparsest Cut cs.CC · 2012 · author #2
  18. Better Pseudorandom Generators from Milder Pseudorandom Restrictions cs.CC · 2012 · author #2
  19. DNF Sparsification and a Faster Deterministic Counting Algorithm cs.CC · 2012 · author #2
  20. Constructive Discrepancy Minimization by Walking on The Edges cs.DS · 2012 · author #2
  21. A polynomial time approximation scheme for computing the supremum of Gaussian processes cs.DS · 2012 · author #1
  22. Making the long code shorter, with applications to the Unique Games Conjecture cs.CC · 2011 · author #4
  23. Almost Optimal Explicit Johnson-Lindenstrauss Transformations cs.DS · 2010 · author #1
  24. Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs cs.DS · 2010 · author #3
  25. An Invariance Principle for Polytopes cs.CC · 2009 · author #3
  26. Pseudorandom Generators for Polynomial Threshold Functions cs.CC · 2009 · author #1
  27. Guaranteed Rank Minimization via Singular Value Projection cs.LG · 2009 · author #1
  28. Bounding the Sensitivity of Polynomial Threshold Functions cs.CC · 2009 · author #3

Mentions

  • 1307.7615 #1 · backfill · confidence 0.70 Raghu Meka
  • 1301.0820 #2 · backfill · confidence 0.70 Raghu Meka
  • 1211.1109 #2 · backfill · confidence 0.70 Raghu Meka
  • 1210.0049 #2 · backfill · confidence 0.70 Raghu Meka
  • 1205.3534 #2 · backfill · confidence 0.70 Raghu Meka
  • 1203.5747 #2 · backfill · confidence 0.70 Raghu Meka
  • 1202.4970 #1 · backfill · confidence 0.70 Raghu Meka
  • 1111.0405 #4 · backfill · confidence 0.70 Raghu Meka
  • 1011.6397 #1 · backfill · confidence 0.70 Raghu Meka
  • 1008.3187 #3 · backfill · confidence 0.70 Raghu Meka
  • 0912.4884 #3 · backfill · confidence 0.70 Raghu Meka
  • 0910.4122 #1 · backfill · confidence 0.70 Raghu Meka
  • 0909.5457 #1 · backfill · confidence 0.70 Raghu Meka
  • 0909.5175 #3 · backfill · confidence 0.70 Raghu Meka

Frequent Coauthors