He Sun

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 40

Top Topics

Spectral Clustering

Top Venues

Publications

Steinar Laenen, He Sun
Dynamic Spectral Clustering with Provable Approximation Guarantee. CoRR (2024)
Ben Jourdan, Peter Macgregor, He Sun
Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime. CoRR (2024)
Peter Macgregor, He Sun
Spectral Toolkit of Algorithms for Graphs: Technical Report (2). CoRR (2024)
Ben Jourdan, Peter Macgregor, He Sun
Is the Algorithmic Kadison-Singer Problem Hard? ISAAC (2023)
Peter Macgregor, He Sun
Fast Approximation of Similarity Graphs with Kernel Density Estimation. CoRR (2023)
Thomas Sauerwald, He Sun, Danny Vagnozzi
The Support of Open Versus Closed Random Walks. ICALP (2023)
Peter Macgregor, He Sun
Spectral Toolkit of Algorithms for Graphs: Technical Report (1). CoRR (2023)
Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs. ICML (2023)
He Sun, Danny Vagnozzi
Three Hardness Results for Graph Similarity Problems. CoRR (2023)
Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs. CoRR (2023)
Peter Macgregor, He Sun
Fast Approximation of Similarity Graphs with Kernel Density Estimation. NeurIPS (2023)
Peter Macgregor, He Sun
A Tighter Analysis of Spectral Clustering, and Beyond. ICML (2022)
Peter Macgregor, He Sun
A Tighter Analysis of Spectral Clustering, and Beyond. CoRR (2022)
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP (2022)
Peter Macgregor, He Sun
Finding Bipartite Components in Hypergraphs. CoRR (2022)
Ben Jourdan, Peter Macgregor, He Sun
Is the Algorithmic Kadison-Singer Problem Hard? CoRR (2022)
Peter Macgregor, He Sun
Local Algorithms for Finding Densely Connected Clusters. ICML (2021)
Bogdan-Adrian Manghiuc, He Sun
Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs. NeurIPS (2021)
Bogdan-Adrian Manghiuc, He Sun
Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs. CoRR (2021)
Peter Macgregor, He Sun
Local Algorithms for Finding Densely Connected Clusters. CoRR (2021)
Peter Macgregor, He Sun
Finding Bipartite Components in Hypergraphs. NeurIPS (2021)
Steinar Laenen, He Sun
Higher-Order Spectral Clustering of Directed Graphs. NeurIPS (2020)
Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti
Hermitian matrices for clustering directed graphs: insights and applications. AISTATS (2020)
Bogdan-Adrian Manghiuc, Pan Peng, He Sun
Augmenting the Algebraic Connectivity of Graphs. ESA (2020)
Steinar Laenen, He Sun
Higher-Order Spectral Clustering of Directed Graphs. CoRR (2020)
Bogdan-Adrian Manghiuc, Pan Peng, He Sun
Augmenting the Algebraic Connectivity of Graphs. CoRR (2020)
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR (2020)
Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti
Hermitian matrices for clustering directed graphs: insights and applications. CoRR (2019)
Huan Li, He Sun, Luca Zanetti
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. ESA (2019)
He Sun, Luca Zanetti
Distributed Graph Clustering and Sparsification. ACM Trans. Parallel Comput. 6 (3) (2019)
Huan Li, He Sun, Luca Zanetti
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem. CoRR (2018)
Yin Tat Lee, He Sun
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. SIAM J. Comput. 47 (6) (2018)
Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang
Communication-Optimal Distributed Clustering. CoRR (2017)
Richard Peng, He Sun, Luca Zanetti
Partitioning Well-Clustered Graphs: Spectral Clustering Works! SIAM J. Comput. 46 (2) (2017)
He Sun, Luca Zanetti
Distributed Graph Clustering by Load Balancing. SPAA (2017)
He Sun, Luca Zanetti
Distributed Graph Clustering and Sparsification. CoRR (2017)
Yin Tat Lee, He Sun
An SDP-based algorithm for linear-sized spectral sparsification. STOC (2017)
Yin Tat Lee, He Sun
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification. CoRR (2017)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48 (4) (2016)
Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang
Communication-Optimal Distributed Clustering. NIPS (2016)
Yin Tat Lee, He Sun
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. CoRR (2015)
Richard Peng, He Sun, Luca Zanetti
Partitioning Well-Clustered Graphs: Spectral Clustering Works! COLT (2015)
Konstantinos Panagiotou, Xavier Pérez-Giménez, Thomas Sauerwald, He Sun
Randomized Rumour Spreading: The Effect of the Network Topology. Comb. Probab. Comput. 24 (2) (2015)
Yin Tat Lee, He Sun
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. FOCS (2015)
Zeyu Guo, He Sun
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. SODA (2015)
Pavel Kolev, He Sun
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. ISAAC (2014)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into bins via local search: cover time and maximum load. STACS (2014)
Richard Peng, He Sun, Luca Zanetti
Partitioning Well-Clustered Graphs with k-Means and Heat Kernel. CoRR (2014)
Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
Deterministic polynomial-time algorithms for designing short DNA words. Theor. Comput. Sci. 494 (2013)
Zeyu Guo, He Sun
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. CoRR (2013)
He Sun
Counting Hypergraphs in Data Streams CoRR (2013)
Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into Bins via Local Search. SODA (2013)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into bins via local search: cover time and maximum load. CoRR (2013)
Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun
Counting Arbitrary Subgraphs in Data Streams. ICALP (2) (2012)
Thomas Sauerwald, He Sun
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies CoRR (2012)
Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract) CoRR (2012)
George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel
Low Randomness Rumor Spreading via Hashing. STACS (2012)
Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words CoRR (2012)
Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into Bins via Local Search CoRR (2012)
Thomas Sauerwald, He Sun
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. FOCS (2012)
Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun
Approximate Counting of Cycles in Streams. ESA (2011)
Francis Y. L. Chin, Zeyu Guo, He Sun
Minimum Manhattan Network is NP-Complete. Discret. Comput. Geom. 45 (4) (2011)
Zeyu Guo, He Sun, Hong Zhu
Greedy Construction of 2-Approximate Minimum Manhattan Networks. Int. J. Comput. Geom. Appl. 21 (3) (2011)
Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. TAMC (2010)
He Sun, Chung Keung Poon
estimation. Theor. Comput. Sci. 410 (11) (2009)
He Sun, Hong Zhu
On Construction of Almost-Ramanujan Graphs. COCOA (2009)
He Sun, Hong Zhu
On Construction of Almost-Ramanujan Graphs. Discret. Math. Algorithms Appl. 1 (2) (2009)
Francis Y. L. Chin, Zeyu Guo, He Sun
Minimum Manhattan network is NP-complete. SCG (2009)
Zeyu Guo, He Sun, Hong Zhu
Greedy Construction of 2-Approximation Minimum Manhattan Network. ISAAC (2008)
Zeyu Guo, He Sun, Hong Zhu
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. AAIM (2008)
He Sun, Chung Keung Poon
Estimation. TAMC (2007)