Остановите войну!
for scientists:
default search action
He Sun 0001
- > Home > Persons > He Sun 0001
Publications
- 2023
- [c32]Thomas Sauerwald, He Sun, Danny Vagnozzi:
The Support of Open Versus Closed Random Walks. ICALP 2023: 103:1-103:21 - [i24]He Sun, Danny Vagnozzi:
Three Hardness Results for Graph Similarity Problems. CoRR abs/2309.03810 (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 - 2020
- [c23]Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti:
Hermitian matrices for clustering directed graphs: insights and applications. AISTATS 2020: i - [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) - 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 - [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
- [c11]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. SODA 2013: 16-34 - [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) - 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) - [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
- [c7]Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun:
Approximate Counting of Cycles in Streams. ESA 2011: 677-688
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 2024-04-25 01:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint