Follow
He Sun
He Sun
Reader in Algorithms & Complexity, University of Edinburgh
Verified email at ed.ac.uk - Homepage
Title
Cited by
Cited by
Year
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
YT Lee, H Sun
SIAM Journal on Computing 47 (6), 2315-2336, 2018
972018
Partitioning well-clustered graphs: Spectral clustering works!
R Peng, H Sun, L Zanetti
SIAM Journal on Computing 46 (2), 710-743, 2017
922017
Counting Arbitrary Subgraphs in Data Streams
DM Kane, K Mehlhorn, T Sauerwald, H Sun
39th International Colloquium on Automata, Languages and Programming (ICALP …, 2012
892012
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
822017
Approximate Counting of Cycles in Streams
M Manjunath, K Mehlhorn, K Panagiotou, H Sun
European Symposium on Algorithms (ESA), 677-688, 2011
592011
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
582012
Communication-Optimal Distributed Clustering
J Chen, H Sun, D Woodruff, Q Zhang
Advances in Neural Information Processing Systems (NeurIPS) 29, 2016
442016
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
422020
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
372020
Minimum Manhattan Network is NP-Complete
FYL Chin, Z Guo, H Sun
Discrete & Computational Geometry 45 (4), 701-722, 2011
332011
Distributed Graph Clustering and Sparsification
H Sun, L Zanetti
ACM Transactions on Parallel Computing (TOPC) 6 (3), 1-23, 2019
272019
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
262015
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
192013
Higher-Order Spectral Clustering of Directed Graphs
S Laenen, H Sun
Advances in Neural Information Processing Systems 33, 941-951, 2020
172020
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
152008
Low Randomness Rumor Spreading via Hashing
G Giakkoupis, T Sauerwald, H Sun, P Woelfel
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
132012
Greedy Construction of 2-Approximation Minimum Manhattan Network
Z Guo, H Sun, H Zhu
International Symposium on Algorithms and Computation, 4-15, 2008
122008
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
92016
Counting Hypergraphs in Data Streams
H Sun
arXiv preprint arXiv:1304.7456, 2013
92013
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
92011
The system can't perform the operation now. Try again later.
Articles 1–20