#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2007

2018

- This year (4)
- Last 5 years (20)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Thomas Sauerwald, He Sun
- IEEE 53rd Annual Symposium on Foundations ofâ€¦
- 2012

We consider the problem of balancing load items (tokens) on networks. Starting with an arbitrary load distribution, we allow in each round nodes to exchange tokens with their neighbors. The goal isâ€¦ (More)

- Yin Tat Lee, He Sun
- STOC
- 2017

For any undirected and weighted graph <i>G</i>=(<i>V</i>,<i>E</i>,<i>w</i>) with <i>n</i> vertices and <i>m</i> edges, we call a sparse subgraph <i>H</i> of <i>G</i>, with proper reweighting of theâ€¦ (More)

- Francis Y. L. Chin, Zeyu Guo, He Sun
- Discrete & Computational Geometry
- 2011

- Richard Peng, He Sun, Luca Zanetti
- COLT
- 2015

In this work we study the widely used spectral clustering algorithms, i.e. partition a graph into k clusters via (1) embedding the vertices of a graph into a low-dimensional space using the bottomâ€¦ (More)

- George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel
- STACS
- 2012

We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple push-based protocols,â€¦ (More)

Subgraph counting is a fundamental problem in algorithm design and has many applications in data mining, biology, social networks, and many other domains. Over the past years this problem has beenâ€¦ (More)

- Yin Tat Lee, He Sun
- IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2015

We present the first almost-linear time algorithm for constructing linear-sized spectral sparsification for graphs. This improves all previous constructions of linear-sized spectral sparsification,â€¦ (More)

Given a set T of n points in IR, a Manhattan Network G is a network with all its edges horizontal or vertical segments, such that for all p, q âˆˆ T , in G there exists a path (named a Manhattan path)â€¦ (More)

Given a set T of n points in IR, a Manhattan Network G is a network with all its edges horizontal or vertical segments, such that for all p, q âˆˆ T , in G there exists a path (named a Manhattan path)â€¦ (More)

- Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
- SODA
- 2013

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 random. Then the ballâ€¦ (More)