Publications
Theoretical Foundations
(Authors are ordered alphabetically according to theoretical computer science tradition)
Min-Max Correlation Clustering via Neighborhood Similarity
Nairen Cao, Steven Roche, Hsin-Hao Su
ESA 2025 [arXiv:2502.12519]
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
V. Ashvinkumar, A. Bernstein, N. Cao, C. Grunau, B. Haeupler, Y. Jiang, D. Nanongkai, H. Su
ESA 2024
Deterministic Expander Routing: Faster and More Versatile
Yi-Jun Chang, Shang-En Huang, and Hsin-Hao Su
PODC 2024 [arXiv:2405.03908]
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
Nairen Cao, Shang-En Huang, Hsin-Hao Su
SODA 2024 [arXiv:2307.06723]
(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings
Shang-En Huang, and Hsin-Hao Su
PODC 2023 [arXiv:2212.14425]
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence
Nairen Cao, Shang-En Huang, and Hsin-Hao Su
SPAA 2023
Outstanding Paper Award
Narrowing the LOCAL–CONGEST Gaps in Sparse Networks via Expander Decompositions
Yi-Jun Chang, and Hsin-Hao Su
PODC 2022 [arXiv:2205:08093]
Adaptive Massively Parallel Constant-round Tree Contraction
MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, and Hsin-Hao Su
ITCS 2022 [arXiv:2111:01904]
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
David G. Harris, Hsin-Hao Su and Hoa T. Vu
PODC 2021 [arXiv:2009.10761]
Journal version to appear in SIAM Journal on Discrete Mathematics
Distributed Dense Subgraph Detection and Low Outdegree Orientation
Hsin-Hao Su and Hoa T. Vu
DISC 2020 [arXiv:1907.12443]
Lower Bounds for Dynamic Distributed Task Allocation
Hsin-Hao Su and Nicole Wein
ICALP 2020
Distributed Data Summarization in Well-Connected Networks
Hsin-Hao Su and Hoa T. Vu
DISC 2019
Towards the Locality of Vizing's Theorem
Hsin-Hao Su and Hoa T. Vu
STOC 2019 [arXiv:1901.00479]
(Δ+1)-coloring in O(log* Δ) Congested-Clique Rounds
Merav Parter and Hsin-Hao Su
DISC 2018
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
Bernhard Haeupler, Jeet Mohapatra, and Hsin-Hao Su
PODC 2018 [arXiv:1711.09258]
Distributed MST and Routing in Almost Mixing Time
Mohsen Ghaffari, Fabian Kuhn, and Hsin-Hao Su
PODC 2017
Distributed Degree Splitting, Edge Coloring, and Orientations
Mohsen Ghaffari and Hsin-Hao Su
SODA 2017 [arXiv:1608.03220]
Scaling Algorithms for Weighted Matching in General Graphs
Ran Duan, Seth Pettie, and Hsin-Hao Su
SODA 2017 [arXiv:1411.1919]
Journal version appears in ACM Transactions on Algorithms
Clairvoyant Mechanism for Online Auctions
Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, and Roger Wattenhofer
COCOON 2016
Distributed (Δ+1)-coloring in Sublogarithmic Rounds
David G. Harris, Johannes Schneider, and Hsin-Hao Su
STOC 2016 [arXv: 1603.01486]
Journal version appears in Journal of ACM
(2Δ-1)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
Michael Elkin, Seth Pettie, and Hsin-Hao Su
SODA 2015
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai and Hsin-Hao Su
DISC 2014 [arXv: 1408.0557]
Preliminary versions appear as brief announcements at SPAA 2014 and PODC 2014
Distributed Algorithms for the Lovasz Local Lemma and Graph Coloring
Kai-Min Chung, Seth Pettie, and Hsin-Hao Su
PODC 2014
Fast Distributed Coloring Algorithms for Triangle-Free Graphs
Seth Pettie and Hsin-Hao Su
ICALP 2013
Invited to ICALP 2013's special issue of Information and Computation
A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs
Ran Duan and Hsin-Hao Su
SODA 2012 [pdf]
Interdisciplinary Research in CS Theory/Biology
Ant-Inspired Dynamic Task Allocation via Gossiping
Hsin-Hao Su, Lili Su, Anna Dornhaus, Nancy Lynch
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2017)
Ant-Inspired Density Estimation via Random Walks
Cameron Musco, Hsin-Hao Su, and Nancy Lynch
PODC 2016 [arXv: 1603.02981][Press Coverage: MIT News]
Also in Proceedings of the National Academy of Sciences [PNAS version] (all authors contribute equally)
Costs of task allocation with local feedback:
effects of colony size and extra workers in social insects and other multi-agent systems
Tsvetomira Radeva, Anna Dornhaus, Nancy Lynch, Radhika Nagpal, and Hsin-Hao Su
PLOS Computational Biology
Preliminary version appeared as a brief announcement in DISC 2015
Ph.D. Thesis
Algorithms for Fundamental Problems in Computer Networks [link]
ACM-EATCS Principles of Distributed Computing Doctoral Dissertation Award, 2016.