57 citations · 245 across the 48 of their papers we have counts for
3 papers · 1 filter
Retrieving Top Weighted Triangles in Graphs
Raunak Kumar, Paul Liu, Moses Charikar +1
Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and a number of methods have been developed for scaling subgraph counting to large graphs. Ma…
Efficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
Moses Charikar, Kirankumar Shiragur, Aaron Sidford
Estimating symmetric properties of a distribution, e.g. support size, coverage, entropy, distance to uniformity, are among the most fundamental problems in algorithmic statistics.…
The One-Way Communication Complexity of Dynamic Time Warping Distance
Vladimir Braverman, Moses Charikar, William Kuszmaul +2
We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance. We show that there is an efficient one-way communication protocol using $\widetil…