73 citations · 347 across the 51 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012★ 11 cited
Constructive Discrepancy Minimization by Walking on The Edges
Shachar Lovett, Raghu Meka
Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cornerstones in this area is the celebrated six standard deviations result of Spenc…
cs.DS2012★ 5 cited
A polynomial time approximation scheme for computing the supremum of Gaussian processes
Raghu Meka
We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors , we compute…