关注
Hsin-Hao Su
Hsin-Hao Su
Boston College
在 umich.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
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
1062016
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
1032012
Distributed degree splitting, edge coloring, and orientations
M Ghaffari, HH Su
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
902017
Distributed algorithms for the Lovász local lemma and graph coloring
KM Chung, S Pettie, HH Su
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
902014
Scaling algorithms for weighted matching in general graphs
R Duan, S Pettie, HH Su
ACM Transactions on Algorithms (TALG) 14 (1), 1-35, 2018
732018
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
582017
Almost-tight distributed minimum cut algorithms
D Nanongkai, HH Su
International Symposium on Distributed Computing, 439-453, 2014
582014
Distributed coloring algorithms for triangle-free graphs
S Pettie, HH Su
Information and Computation 243, 263-280, 2015
54*2015
Ant-inspired density estimation via random walks
C Musco, HH Su, N Lynch
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
422016
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
LP Yeh, BF Wang, HH Su
Algorithmica 56 (3), 297-312, 2010
342010
Randomized (Delta+ 1)-Coloring in O (log* Delta) Congested Clique Rounds
M Parter, HH Su
32nd International Symposium on Distributed Computing (DISC 2018), 2018
302018
(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
302014
Towards the locality of vizing’s theorem
HH Su, HT Vu
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
212019
Distributed dense subgraph detection and low outdegree orientation
HH Su, HT Vu
arXiv preprint arXiv:1907.12443, 2019
202019
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
152008
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
122018
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
122017
On the locality of nash-williams forest decomposition and star-forest decomposition
DG Harris, HH Su, HT Vu
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
92021
Narrowing the LOCAL-CONGEST gaps in sparse networks via expander decompositions
YJ Chang, HH Su
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
72022
Ant-inspired dynamic task allocation via gossiping
HH Su, L Su, A Dornhaus, N Lynch
Stabilization, Safety, and Security of Distributed Systems: 19th …, 2017
72017
系统目前无法执行此操作,请稍后再试。
文章 1–20