20 citations · 28 across the 4 of their papers we have counts for
4 papers
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
Yin Tat Lee, He Sun
For any undirected and weighted graph with vertices and edges, we call a sparse subgraph of , with proper reweighting of the edges, a -s…
Communication-Optimal Distributed Clustering
Jiecao Chen, He Sun, David P. Woodruff +1
Clustering large datasets is a fundamental problem with a number of applications in machine learning. Data is often collected on different sites and clustering needs to be performe…
Counting Hypergraphs in Data Streams
He Sun
We present the first streaming algorithm for counting an arbitrary hypergraph of constant size in a massive hypergraph . Our algorithm can handle both edge-insertions and ed…
Balls into Bins via Local Search
Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer +1
We propose a natural process for allocating n balls into n bins that are organized as the vertices of an undirected graph G. Each ball first chooses a vertex u in G uniformly at ra…