Hsin-Hao Su
Hsin-Hao Su
Boston College
Verified email at umich.edu - Homepage
Title
Cited by
Cited by
Year
A scaling algorithm for maximum weight matching in bipartite graphs
R Duan, HH Su
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
772012
Distributed (∆+ 1)-coloring in sublogarithmic rounds
DG Harris, J Schneider, HH Su
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
712016
Distributed algorithms for the Lovász local lemma and graph coloring
KM Chung, S Pettie, HH Su
Distributed Computing 30 (4), 261-280, 2017
682017
Distributed degree splitting, edge coloring, and orientations
M Ghaffari, HH Su
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
562017
Almost-tight distributed minimum cut algorithms
D Nanongkai, HH Su
International Symposium on Distributed Computing, 439-453, 2014
412014
Distributed coloring algorithms for triangle-free graphs
S Pettie, HH Su
Information and Computation 243, 263-280, 2015
34*2015
Scaling algorithms for weighted matching in general graphs
R Duan, S Pettie, HH Su
ACM Transactions on Algorithms (TALG) 14 (1), 1-35, 2018
302018
Ant-inspired density estimation via random walks
C Musco, HH Su, NA Lynch
Proceedings of the National Academy of Sciences 114 (40), 10534-10541, 2017
262017
Distributed MST and routing in almost mixing time
M Ghaffari, F Kuhn, HH Su
Proceedings of the ACM Symposium on Principles of Distributed Computing, 131-140, 2017
252017
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
LP Yeh, BF Wang, HH Su
Algorithmica 56 (3), 297-312, 2010
242010
(2Δ—l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
M Elkin, S Pettie, HH Su
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
192014
Randomized (Delta+ 1)-Coloring in O (log* Delta) Congested Clique Rounds
M Parter, HH Su
32nd International Symposium on Distributed Computing (DISC 2018), 2018
172018
An improved algorithm for finding a length-constrained maximum-density subtree in a tree
HH Su, CL Lu, CY Tang
Information Processing Letters 109 (2), 161-164, 2008
142008
Towards the locality of Vizing’s theorem
HH Su, HT Vu
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
92019
Ant-inspired dynamic task allocation via gossiping
HH Su, L Su, A Dornhaus, N Lynch
International Symposium on Stabilization, Safety, and Security of …, 2017
62017
Optimal gossip algorithms for exact and approximate quantile computations
B Haeupler, J Mohapatra, HH Su
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
52018
Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems
T Radeva, A Dornhaus, N Lynch, R Nagpal, HH Su
PLoS computational biology 13 (12), e1005904, 2017
42017
Brief annoucement: a distributed minimum cut approximation scheme
HH Su
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
42014
Distributed Dense Subgraph Detection and Low Outdegree Orientation
HH Su, HT Vu
arXiv preprint arXiv:1907.12443, 2019
32019
Algorithms for Fundamental Problems in Computer Networks.
HH Su
32015
The system can't perform the operation now. Try again later.
Articles 1–20