Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Hsin-Hao Su
Observed names:
Hsin-Hao SU,
Hsin-hao Su,
Su, Hsin-Hao
Institution:
Boston College
Observed institutions:
University of North Carolina at Charlotte,
Boston College,
West Virginia University,
National Tsing Hua University,
University of Michigan,
MIT Computer Science and Artificial Intelligence Laboratory,
Massachusetts Institute of Technology
show all 7
ORCID:
0009-0002-7970-9604
Observed ORCIDs:
0009-0002-7970-9604,
0000-0003-3838-8349
OpenAlex ID:
A5005437771
Works
51
Awards
1
Distributed Degree Splitting, Edge Coloring, and Orientations
2017
·
Mohsen Ghaffari
, Hsin-Hao Su
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
87
Distributed (∆+1)-coloring in sublogarithmic rounds
2016
·
David G. Harris
, Johannes Schneider
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
75
Scaling Algorithms for Weighted Matching in General Graphs
2018
·
Ran Duan
, Seth Pettie
, et al.
·
ACM Transactions on Algorithms
·
65
PDF
Distributed MST and Routing in Almost Mixing Time
2017
·
Mohsen Ghaffari
, Fabian Kuhn
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
64
A scaling algorithm for maximum weight matching in bipartite graphs
2012
·
Ran Duan
, Hsin-hao Su
·
53
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
2018
·
David G. Harris
, Johannes Schneider
, et al.
·
Journal of the ACM
·
48
PDF
Distributed algorithms for the Lovász local lemma and graph coloring
2016
·
Kai-Min Chung
, Seth Pettie
, et al.
·
Distributed Computing
·
48
(2Δ − 1)-edge-coloring is much easier than maximal matching in the distributed setting
2015
·
Elkin , Michael
, Pettie, Seth
, et al.
·
48
A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs
2012
·
Ran Duan
, Hsin-Hao Su
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
48
Almost-Tight Distributed Minimum Cut Algorithms
2014
·
Danupon Nanongkai
, Hsin-Hao Su
·
Lecture notes in computer science
·
45
PDF
Distributed coloring algorithms for triangle-free graphs
2014
·
Seth Pettie
, Hsin-Hao Su
·
Information and Computation
·
44
(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
2014
·
Michael Elkin
, Seth Pettie
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
42
Distributed algorithms for the Lovász local lemma and graph coloring
2014
·
Kai-Min Chung
, Seth Pettie
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
33
Ant-Inspired Density Estimation via Random Walks
2016
·
Cameron Musco
, Hsin-Hao Su
, et al.
·
Proceedings of the National Academy of Sciences
·
32
PDF
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights
2009
·
Li-Pu Yeh
, Biing-Feng Wang
, et al.
·
Algorithmica
·
25
Towards the locality of Vizing’s theorem
2019
·
Hsin-Hao Su
, Hoa T. Vu
·
ACM Symposium on Theory of Computing (STOC)
·
23
PDF
Distributed Dense Subgraph Detection and Low Outdegree Orientation
2019
·
Su, Hsin-Hao
, Vu, Hoa T.
·
arXiv (Cornell University)
·
19
PDF
Scaling algorithms for approximate and exact maximum weight matching
2011
·
Duan, Ran
, Pettie, Seth
, et al.
·
arXiv (Cornell University)
·
15
PDF
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
2018
·
Bernhard Haeupler
, Jeet Mohapatra
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
14
PDF
Scaling Algorithms for Weighted Matching in General Graphs
2017
·
Ran Duan
, Seth Pettie
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
14
Fast Distributed Coloring Algorithms for Triangle-Free Graphs
2013
·
Seth Pettie
, Hsin-Hao Su
·
Lecture notes in computer science
·
13
(1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings
2023
·
Shang-En Huang
, Hsin-Hao Su
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
11
PDF
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
2018
·
Parter, Merav
, Su, Hsin-Hao
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
11
PDF
An improved algorithm for finding a length-constrained maximum-density subtree in a tree
2008
·
Hsin-Hao Su
, Chin Lung Lu
, et al.
·
Information Processing Letters
·
10
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
2024
·
Nairen Cao
, Shang-En Huang
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
9
PDF
Show more works
View as search
Works count:
51
Citation count:
994
H-index:
17
I10-index:
24
Year
Topic
Type
