| Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time YT Lee, H Sun SIAM Journal on Computing 47 (6), 2315-2336, 2018 | 134 | 2018 |
| Partitioning Well-Clustered Graphs: Spectral Clustering Works! R Peng, H Sun, L Zanetti SIAM Journal on Computing 46 (2), 710-743, 2017 | 125 | 2017 |
| An SDP-based algorithm for linear-sized spectral sparsification YT Lee, H Sun 49th Annual ACM Symposium on Theory of Computing (STOC), 678-687, 2017 | 109 | 2017 |
| Counting Arbitrary Subgraphs in Data Streams DM Kane, K Mehlhorn, T Sauerwald, H Sun 39th International Colloquium on Automata, Languages and Programming (ICALP …, 2012 | 97 | 2012 |
| Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies T Sauerwald, H Sun 53rd Annual IEEE Symposium on Foundations of Computer Science, 341-350, 2012 | 66 | 2012 |
| Approximate Counting of Cycles in Streams M Manjunath, K Mehlhorn, K Panagiotou, H Sun European Symposium on Algorithms (ESA), 677-688, 2011 | 62 | 2011 |
| Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ... 49th International Colloquium on Automata, Languages and Programming (ICALP), 2020 | 57 | 2020 |
| 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 | 55 | 2020 |
| Communication-Optimal Distributed Clustering J Chen, H Sun, D Woodruff, Q Zhang Advances in Neural Information Processing Systems (NeurIPS) 29, 2016 | 55 | 2016 |
| Distributed Graph Clustering and Sparsification H Sun, L Zanetti ACM Transactions on Parallel Computing (TOPC) 6 (3), 1-23, 2019 | 42* | 2019 |
| Minimum Manhattan Network is NP-Complete FYL Chin, Z Guo, H Sun Discrete & Computational Geometry 45 (4), 701-722, 2011 | 35 | 2011 |
| 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 | 30 | 2015 |
| Higher-Order Spectral Clustering of Directed Graphs S Laenen, H Sun Advances in Neural Information Processing Systems 33, 941-951, 2020 | 26 | 2020 |
| Greedy construction of 2-approximate minimum Manhattan networks Z Guo, H Sun, H Zhu International Journal of Computational Geometry & Applications 21 (03), 331-350, 2011 | 21* | 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 | 20 | 2013 |
| 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 | 16 | 2008 |
| A Tighter Analysis of Spectral Clustering, and Beyond P Macgregor, H Sun 39th International Conference on Machine Learning (ICML), 14717-14742, 2022 | 15 | 2022 |
| Low Randomness Rumor Spreading via Hashing G Giakkoupis, T Sauerwald, H Sun, P Woelfel 29th International Symposium on Theoretical Aspects of Computer Science …, 2012 | 13 | 2012 |
| Human Motion Parsing by Hierarchical Dynamic Clustering Y Zhang, S Tang, H Sun, H Neumann BMVC, 269, 2018 | 11 | 2018 |
| 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 | 11 | 2016 |
