Partitioning Well-Clustered Graphs: Spectral Clustering Works! LZ Richard Peng, He Sun The 28th Conference on Learning Theory 40, 1423--1455, 2015 | 61 | 2015 |

Counting Arbitrary Subgraphs in Data Streams DM Kane, K Mehlhorn, T Sauerwald, H Sun the 39th International Colloquium on Automata, Languages and Programming …, 2012 | 59 | 2012 |

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time YT Lee, H Sun arXiv, 2015 | 58 | 2015 |

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 | 51 | 2017 |

Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies T Sauerwald, H Sun Arxiv preprint arXiv:1201.2715, 2012 | 45 | 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 | 45 | 2012 |

Approximate counting of cycles in streams M Manjunath, K Mehlhorn, K Panagiotou, H Sun European Symposium on Algorithms, 677-688, 2011 | 43 | 2011 |

Communication-optimal distributed clustering J Chen, H Sun, D Woodruff, Q Zhang Advances in Neural Information Processing Systems, 3727-3735, 2016 | 28 | 2016 |

Minimum Manhattan Network is NP-Complete FYL Chin, Z Guo, H Sun Discrete & Computational Geometry 45 (4), 701-722, 2011 | 27 | 2011 |

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 | 18 | 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 | 17* | 2011 |

Randomized rumour spreading: The effect of the network topology K Panagiotou, X Perez-Gimenez, T Sauerwald, H Sun Combinatorics, Probability and Computing, 457-479, 2015 | 16 | 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 | 14 | 2012 |

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 | 14 | 2008 |

Distributed graph clustering and sparsification H Sun, L Zanetti ACM Transactions on Parallel Computing (TOPC) 6 (3), 1-23, 2019 | 10 | 2019 |

Distributed graph clustering by load balancing H Sun, L Zanetti Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017 | 8 | 2017 |

Counting hypergraphs in data streams H Sun arXiv preprint arXiv:1304.7456, 2013 | 7 | 2013 |

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 | 6 | 2016 |

Hermitian matrices for clustering directed graphs: insights and applications M Cucuringu, H Li, H Sun, L Zanetti International Conference on Artificial Intelligence and Statistics, 983-992, 2020 | 4 | 2020 |

Gossip vs. markov chains, and randomness-efficient rumor spreading Z Guo, H Sun Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 4 | 2014 |