He Sun
TitleCited byYear
Counting Arbitrary Subgraphs in Data Streams
DM Kane, K Mehlhorn, T Sauerwald, H Sun
the 39th International Colloquium on Automata, Languages and Programming …, 2012
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
LZ Richard Peng, He Sun
The 28th Conference on Learning Theory 40, 1423--1455, 2015
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
T Sauerwald, H Sun
Arxiv preprint arXiv:1201.2715, 2012
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
T Sauerwald, H Sun
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 341-350, 2012
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
YT Lee, H Sun
arXiv, 2015
Approximate counting of cycles in streams
M Manjunath, K Mehlhorn, K Panagiotou, H Sun
European Symposium on Algorithms, 677-688, 2011
An sdp-based algorithm for linear-sized spectral sparsification
YT Lee, H Sun
Proceedings of the 49th annual acm sigact symposium on theory of computing …, 2017
Minimum Manhattan Network is NP-Complete
FYL Chin, Z Guo, H Sun
Discrete & Computational Geometry 45 (4), 701-722, 2011
Communication-optimal distributed clustering
J Chen, H Sun, D Woodruff, Q Zhang
Advances in Neural Information Processing Systems, 3727-3735, 2016
Balls into Bins via Local Search
P Bogdan, T Sauerwald, A Stauffer, H Sun
24th ACM-SIAM Symposium on Discrete Algorithms (SODA), 16-34, 2013
Greedy Construction of 2-approximate Minimum Manhattan Networks
Z Guo, H Sun, H Zhu
Int. J. Comp. Geo. Appl. 21 (03), 331-350, 2011
A fast 2-approximation algorithm for the minimum Manhattan network problem
Z Guo, H Sun, H Zhu
International Conference on Algorithmic Applications in Management, 212-223, 2008
Randomized rumour spreading: The effect of the network topology
K Panagiotou, X Perez-Gimenez, T Sauerwald, H Sun
Combinatorics, Probability and Computing 24 (2), 457-479, 2015
Low Randomness Rumor Spreading via Hashing
G Giakkoupis, T Sauerwald, H Sun, P Woelfel
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
Balls into bins via local search: cover time and maximum load
K Bringmann, T Sauerwald, A Stauffer, H Sun
Random Structures & Algorithms 48 (4), 681-702, 2016
Counting hypergraphs in data streams
H Sun
arXiv preprint arXiv:1304.7456, 2013
Distributed graph clustering by load balancing
H Sun, L Zanetti
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
Gossip vs. markov chains, and randomness-efficient rumor spreading
Z Guo, H Sun
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
Two improved range-efficient algorithms for F0 estimation
H Sun, CK Poon
Theoretical Computer Science 410 (11), 1073-1080, 2009
Temporal human action segmentation via dynamic clustering
Y Zhang, H Sun, S Tang, H Neumann
arXiv preprint arXiv:1803.05790, 2018
The system can't perform the operation now. Try again later.
Articles 1–20