M. Charikar

activity

20102023

most citedA Hitting Time Analysis of Stochastic Gradient Langevin Dynamics

57 citations · 245 across the 48 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

cs.DS2010

Vertex Sparsifiers and Abstract Rounding Algorithms

Moses Charikar, Tom Leighton, Shi Li +1

The notion of vertex sparsification is introduced in \cite{M}, where it was shown that for any graph $G = (V, E)$ and a subset of $k$ terminals $K \subset V$ , there is a polynomial…

cs.CC2010★ 4 cited

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

Prahladh Harsha, Moses Charikar, Matthew Andrews +14

These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-2…