default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHe Sun 0001
Person information
- affiliation: University of Edinburgh, UK
- affiliation (former): Max-Planck-Institut für Informatik, Saarbrücken, Germany
Other persons with the same name
- He Sun — disambiguation page
- He Sun 0002 — Yunnan University, School of Information Science and Engineering
- He Sun 0003 — Shanghai Jiao Tong University, Department of Computer Science and Engineering
- He Sun 0004 — Northeastern University (China)
- He Sun 0005 — College of William & Mary, Williamsburg, VA, USA
- He Sun 0006 — Harbin University of Science & Technology, Harbin, China
- He Sun 0007 — Tsinghua University, Beijing, China
- He Sun 0008
![[0000-0002-2886-0438]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-2886-0438")
— National University of Singapore, Department of Electrical Computer Engineering, Singapore (and 1 more) - He Sun 0009 — Chinese Academy of Sciences, Key Laboratory of Computational Optical Imaging Technology, Aerospace Information Research Institute, Beijing, China (and 2 more)
- He Sun 0010 — Peking University, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c34]Ben Jourdan, Gregory Schwartzman, Peter Macgregor, He Sun:
Coreset Spectral Clustering. ICLR 2025- [i30]Ben Jourdan, Gregory Schwartzman, Peter Macgregor, He Sun:
Coreset Spectral Clustering. CoRR abs/2503.07227 (2025) - 2024
- [c33]Steinar Laenen, He Sun:
Dynamic Spectral Clustering with Provable Approximation Guarantee. ICML 2024 - [i29]Ben Jourdan, Peter Macgregor, He Sun:
Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime. CoRR abs/2402.08545 (2024) - [i28]Steinar Laenen, He Sun:
Dynamic Spectral Clustering with Provable Approximation Guarantee. CoRR abs/2406.03152 (2024) - [i27]Peter Macgregor, He Sun:
Spectral Toolkit of Algorithms for Graphs: Technical Report (2). CoRR abs/2407.07096 (2024) - 2023
- [c32]Thomas Sauerwald, He Sun, Danny Vagnozzi:
The Support of Open Versus Closed Random Walks. ICALP 2023: 103:1-103:21 - [c31]Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun:
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs. ICML 2023: 18207-18249 - [c30]Ben Jourdan, Peter Macgregor, He Sun:
Is the Algorithmic Kadison-Singer Problem Hard? ISAAC 2023: 43:1-43:18 - [c29]Peter Macgregor, He Sun:
Fast Approximation of Similarity Graphs with Kernel Density Estimation. NeurIPS 2023 - [i26]Peter Macgregor, He Sun:
Spectral Toolkit of Algorithms for Graphs: Technical Report (1). CoRR abs/2304.03170 (2023) - [i25]Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun:
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs. CoRR abs/2306.09950 (2023) - [i24]He Sun, Danny Vagnozzi:
Three Hardness Results for Graph Similarity Problems. CoRR abs/2309.03810 (2023) - [i23]Peter Macgregor, He Sun:
Fast Approximation of Similarity Graphs with Kernel Density Estimation. CoRR abs/2310.13870 (2023) - 2022
- [c28]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: 20:1-20:20 - [c27]Peter Macgregor, He Sun:
A Tighter Analysis of Spectral Clustering, and Beyond. ICML 2022: 14717-14742 - [i22]Ben Jourdan, Peter Macgregor, He Sun:
Is the Algorithmic Kadison-Singer Problem Hard? CoRR abs/2205.02161 (2022) - [i21]Peter Macgregor, He Sun:
Finding Bipartite Components in Hypergraphs. CoRR abs/2205.02771 (2022) - [i20]Peter Macgregor, He Sun:
A Tighter Analysis of Spectral Clustering, and Beyond. CoRR abs/2208.01724 (2022) - 2021
- [c26]Peter Macgregor, He Sun:
Local Algorithms for Finding Densely Connected Clusters. ICML 2021: 7268-7278 - [c25]Peter Macgregor, He Sun:
Finding Bipartite Components in Hypergraphs. NeurIPS 2021: 7912-7923 - [c24]Bogdan-Adrian Manghiuc, He Sun:
Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs. NeurIPS 2021: 9278-9289 - [i19]Peter Macgregor, He Sun:
Local Algorithms for Finding Densely Connected Clusters. CoRR abs/2106.05245 (2021) - [i18]Bogdan-Adrian Manghiuc, He Sun:
Hierarchical Clustering: O(1)-Approximation for Well-Clustered Graphs. CoRR abs/2112.09055 (2021) - 2020
- [c23]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. AISTATS 2020: i - [c22]Bogdan-Adrian Manghiuc, Pan Peng, He Sun:
Augmenting the Algebraic Connectivity of Graphs. ESA 2020: 70:1-70:22 - [c21]Steinar Laenen, He Sun:
Higher-Order Spectral Clustering of Directed Graphs. NeurIPS 2020 - [i17]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 abs/2004.08432 (2020) - [i16]Bogdan-Adrian Manghiuc, Pan Peng, He Sun:
Augmenting the Algebraic Connectivity of Graphs. CoRR abs/2006.14449 (2020) - [i15]Steinar Laenen, He Sun:
Higher-Order Spectral Clustering of Directed Graphs. CoRR abs/2011.05080 (2020)
2010 – 2019
- 2019
- [j10]He Sun, Luca Zanetti:
Distributed Graph Clustering and Sparsification. ACM Trans. Parallel Comput. 6(3): 17:1-17:23 (2019) - [c20]Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. ESA 2019: 71:1-71:14 - [i14]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. CoRR abs/1908.02096 (2019) - 2018
- [j9]Yin Tat Lee, He Sun:
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. SIAM J. Comput. 47(6): 2315-2336 (2018) - [i13]Huan Li, He Sun, Luca Zanetti:
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem. CoRR abs/1811.10909 (2018) - 2017
- [j8]Richard Peng, He Sun, Luca Zanetti:
Partitioning Well-Clustered Graphs: Spectral Clustering Works! SIAM J. Comput. 46(2): 710-743 (2017) - [c19]He Sun, Luca Zanetti:
Distributed Graph Clustering by Load Balancing. SPAA 2017: 163-171 - [c18]Yin Tat Lee, He Sun:
An SDP-based algorithm for linear-sized spectral sparsification. STOC 2017: 678-687 - [i12]Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang:
Communication-Optimal Distributed Clustering. CoRR abs/1702.00196 (2017) - [i11]Yin Tat Lee, He Sun:
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification. CoRR abs/1702.08415 (2017) - [i10]He Sun, Luca Zanetti:
Distributed Graph Clustering and Sparsification. CoRR abs/1711.01262 (2017) - 2016
- [j7]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48(4): 681-702 (2016) - [c17]Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang:
Communication-Optimal Distributed Clustering. NIPS 2016: 3720-3728 - 2015
- [j6]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): 457-479 (2015) - [c16]Richard Peng, He Sun, Luca Zanetti:
Partitioning Well-Clustered Graphs: Spectral Clustering Works! COLT 2015: 1423-1455 - [c15]Yin Tat Lee, He Sun:
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. FOCS 2015: 250-269 - [c14]Zeyu Guo, He Sun:
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. SODA 2015: 411-430 - [i9]Yin Tat Lee, He Sun:
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. CoRR abs/1508.03261 (2015) - 2014
- [c13]Pavel Kolev, He Sun:
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. ISAAC 2014: 621-632 - [c12]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. STACS 2014: 187-198 - [i8]Richard Peng, He Sun, Luca Zanetti:
Partitioning Well-Clustered Graphs with k-Means and Heat Kernel. CoRR abs/1411.2021 (2014) - 2013
- [j5]Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic polynomial-time algorithms for designing short DNA words. Theor. Comput. Sci. 494: 144-160 (2013) - [c11]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. SODA 2013: 16-34 - [i7]He Sun:
Counting Hypergraphs in Data Streams. CoRR abs/1304.7456 (2013) - [i6]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. CoRR abs/1310.0801 (2013) - [i5]Zeyu Guo, He Sun:
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. CoRR abs/1311.2839 (2013) - 2012
- [c10]Thomas Sauerwald, He Sun:
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. FOCS 2012: 341-350 - [c9]Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun:
Counting Arbitrary Subgraphs in Data Streams. ICALP (2) 2012: 598-609 - [c8]George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel:
Low Randomness Rumor Spreading via Hashing. STACS 2012: 314-325 - [i4]Thomas Sauerwald, He Sun:
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. CoRR abs/1201.2715 (2012) - [i3]Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. CoRR abs/1201.6358 (2012) - [i2]Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun:
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract). CoRR abs/1202.2840 (2012) - [i1]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. CoRR abs/1207.2125 (2012) - 2011
- [j4]Francis Y. L. Chin, Zeyu Guo, He Sun:
Minimum Manhattan Network is NP-Complete. Discret. Comput. Geom. 45(4): 701-722 (2011) - [j3]Zeyu Guo, He Sun, Hong Zhu:
Greedy Construction of 2-Approximate Minimum Manhattan Networks. Int. J. Comput. Geom. Appl. 21(3): 331-350 (2011) - [c7]Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun:
Approximate Counting of Cycles in Streams. ESA 2011: 677-688 - 2010
- [c6]Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. TAMC 2010: 308-319
2000 – 2009
- 2009
- [j2]He Sun, Hong Zhu:
On Construction of Almost-Ramanujan Graphs. Discret. Math. Algorithms Appl. 1(2): 193-204 (2009) - [j1]He Sun, Chung Keung Poon:
Two improved range-efficient algorithms for F0 estimation. Theor. Comput. Sci. 410(11): 1073-1080 (2009) - [c5]He Sun, Hong Zhu:
On Construction of Almost-Ramanujan Graphs. COCOA 2009: 197-207 - [c4]Francis Y. L. Chin, Zeyu Guo, He Sun:
Minimum Manhattan network is NP-complete. SCG 2009: 393-402 - 2008
- [c3]Zeyu Guo, He Sun, Hong Zhu:
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. AAIM 2008: 212-223 - [c2]Zeyu Guo, He Sun, Hong Zhu:
Greedy Construction of 2-Approximation Minimum Manhattan Network. ISAAC 2008: 4-15 - 2007
- [c1]He Sun, Chung Keung Poon:
Two Improved Range-Efficient Algorithms for F 0 Estimation. TAMC 2007: 659-669
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-13 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
