Publications

• Richard Peng and He Sun and Luca Zanetti Partitioning Well-Clustered Graphs: Spectral Clustering Works! In: SIAM J. Comput., 2017
• He Sun and Luca Zanetti Distributed Graph Clustering by Load Balancing In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, 2017
• Yin Tat Lee and He Sun An SDP-based algorithm for linear-sized spectral sparsification In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, 2017
• Karl Bringmann and Thomas Sauerwald and Alexandre Stauffer and He Sun Balls into bins via local search: Cover time and maximum load In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, 2016
• Jiecao Chen and He Sun and David P. Woodruff and Qin Zhang Communication-Optimal Distributed Clustering In: Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, 2016
• Konstantinos Panagiotou and Xavier Pérez-Giménez and Thomas Sauerwald and He Sun Randomized Rumour Spreading: The Effect of the Network Topology In: Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, 2015
• Richard Peng and He Sun and Luca Zanetti Partitioning Well-Clustered Graphs: Spectral Clustering Works! In: Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015, 2015
• Yin Tat Lee and He Sun Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, 2015
• Zeyu Guo and He Sun Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, 2015
• Pavel Kolev and He Sun Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs In: Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, 2014
• Karl Bringmann and Thomas Sauerwald and Alexandre Stauffer and He Sun Balls into bins via local search: cover time and maximum load In: STACS, 2014
• Paul Bogdan and Thomas Sauerwald and Alexandre Stauffer and He Sun Balls into Bins via Local Search In: SODA, 2013
• Ming-Yang Kao and Henry C. M. Leung and He Sun and Yong Zhang Deterministic polynomial-time algorithms for designing short DNA words In: Theor. Comput. Sci., 2013
• Thomas Sauerwald and He Sun Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies In: FOCS, 2012
• Daniel M. Kane and Kurt Mehlhorn and Thomas Sauerwald and He Sun Counting Arbitrary Subgraphs in Data Streams In: ICALP (2), 2012
• George Giakkoupis and Thomas Sauerwald and He Sun and Philipp Woelfel Low Randomness Rumor Spreading via Hashing In: STACS, 2012
• Zeyu Guo and He Sun and Hong Zhu Greedy Construction of 2-Approximate Minimum Manhattan Networks In: Int. J. Comput. Geometry Appl., 2011
• Francis Y. L. Chin and Zeyu Guo and He Sun Minimum Manhattan Network is NP-Complete In: Discrete & Computational Geometry, 2011
• Ming-Yang Kao and Henry C. M. Leung and He Sun and Yong Zhang Deterministic Polynomial-Time Algorithms for Designing Short DNA Words In: TAMC, 2010
• He Sun and Hong Zhu On Construction of Almost-Ramanujan Graphs In: Discrete Math., Alg. and Appl., 2009
• He Sun and Chung Keung Poon Two improved range-efficient algorithms for F$_{\mbox{0}}$ estimation In: Theor. Comput. Sci., 2009
• Francis Y. L. Chin and Zeyu Guo and He Sun Minimum Manhattan network is NP-complete In: Symposium on Computational Geometry, 2009
• He Sun and Hong Zhu On Construction of Almost-Ramanujan Graphs In: Discrete Math., Alg. and Appl., 2009
• He Sun and Chung Keung Poon Two improved range-efficient algorithms for F$_{\mbox{0}}$ estimation In: Theor. Comput. Sci., 2009
• He Sun and Hong Zhu On Construction of Almost-Ramanujan Graphs In: COCOA, 2009
• Zeyu Guo and He Sun and Hong Zhu Greedy Construction of 2-Approximation Minimum Manhattan Network In: ISAAC, 2008
• Zeyu Guo and He Sun and Hong Zhu A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem In: AAIM, 2008
• Zeyu Guo and He Sun and Hong Zhu Greedy Construction of 2-Approximation Minimum Manhattan Network In: ISAAC, 2008
• He Sun and Chung Keung Poon Two Improved Range-Efficient Algorithms for {\it F} $_{\mbox{0}}$ Estimation In: TAMC, 2007