Hsin-Hao Su

61 papers A* 16A 7B 2C 1Misc 1Journal 31Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Narrowing the LOCAL-CONGEST gaps in sparse networks via expander decompositions.
Distributed Comput.
Yi-Jun Chang, Hsin-Hao Su
2025 A conf
Min-Max Correlation Clustering via Neighborhood Similarity.
ESA
Nairen Cao, Steven Roche, Hsin-Hao Su
2025 J jnl
Min-Max Correlation Clustering via Neighborhood Similarity.
CoRR
Nairen Cao, Steven Roche, Hsin-Hao Su
2024 A* conf
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds.
SODA
Nairen Cao, Shang-En Huang, Hsin-Hao Su
2024 A* conf
Deterministic Expander Routing: Faster and More Versatile.
PODC
Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su
2024 J jnl
Deterministic Expander Routing: Faster and More Versatile.
CoRR
Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su
2024 A conf
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights.
ESA
Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su
2024 J jnl
Rethinking the Expressiveness of GNNs: A Computational Model Perspective.
CoRR
Guanyu Cui, Zhewei Wei, Hsin-Hao Su
2023 A* conf
(1-
PODC
Shang-En Huang, Hsin-Hao Su
2023 J jnl
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds.
CoRR
Nairen Cao, Shang-En Huang, Hsin-Hao Su
2023 B conf
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence.
SPAA
Nairen Cao, Shang-En Huang, Hsin-Hao Su
2023 J jnl
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition.
SIAM J. Discret. Math.
David G. Harris, Hsin-Hao Su, Hoa T. Vu
2023 J jnl
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights.
CoRR
Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su
2022 J jnl
(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings.
CoRR
Shang-En Huang, Hsin-Hao Su
2022 A conf
Adaptive Massively Parallel Constant-Round Tree Contraction.
ITCS
MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su
2022 A* conf
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions.
PODC
Yi-Jun Chang, Hsin-Hao Su
2022 J jnl
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions.
CoRR
Yi-Jun Chang, Hsin-Hao Su
2021 J jnl
Adaptive Massively Parallel Constant-round Tree Contraction.
CoRR
MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su
2021 A* conf
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition.
PODC
David G. Harris, Hsin-Hao Su, Hoa T. Vu
2020 A conf
Distributed Dense Subgraph Detection and Low Outdegree Orientation.
DISC
Hsin-Hao Su, Hoa T. Vu
2020 A* conf
Lower Bounds for Dynamic Distributed Task Allocation.
ICALP
Hsin-Hao Su, Nicole Wein
2020 J jnl
Lower Bounds for Dynamic Distributed Task Allocation.
CoRR
Hsin-Hao Su, Nicole Wein
2020 J jnl
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition.
CoRR
David G. Harris, Hsin-Hao Su, Hoa T. Vu
2019 A conf
Distributed Data Summarization in Well-Connected Networks.
DISC
Hsin-Hao Su, Hoa T. Vu
2019 J jnl
Distributed Data Summarization in Well-Connected Networks.
CoRR
Hsin-Hao Su, Hoa T. Vu
2019 J jnl
Distributed Dense Subgraph Detection and Low Outdegree Orientation.
CoRR
Hsin-Hao Su, Hoa T. Vu
2019 — conf
Reconfigurable Check Node Unit Design of Dual-Standard LDPC Decoding for 60 GHz Wireless Local Area Network.
ICCE-TW
Hsin-Hao Su, Tang-Syun Chen, Cheng-Hung Lin
2019 J jnl
Towards the Locality of Vizing's Theorem.
CoRR
Hsin-Hao Su, Hoa T. Vu
2019 A* conf
Towards the locality of Vizing's theorem.
STOC
Hsin-Hao Su, Hoa T. Vu
2018 J jnl
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds.
J. ACM
David G. Harris, Johannes Schneider, Hsin-Hao Su
2018 A* conf
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations.
PODC
Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su
2018 A conf
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds.
DISC
Merav Parter, Hsin-Hao Su
2018 J jnl
Scaling Algorithms for Weighted Matching in General Graphs.
ACM Trans. Algorithms
Ran Duan, Seth Pettie, Hsin-Hao Su
2017 C conf
Ant-Inspired Dynamic Task Allocation via Gossiping.
SSS
Hsin-Hao Su, Lili Su, Anna R. Dornhaus, Nancy A. Lynch
2017 J jnl
Ant-inspired density estimation via random walks.
Proc. Natl. Acad. Sci. USA
Cameron Musco, Hsin-Hao Su, Nancy A. Lynch
2017 J jnl
Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems.
PLoS Comput. Biol.
Tsvetomira Radeva, Anna R. Dornhaus, Nancy A. Lynch, Radhika Nagpal, Hsin-Hao Su
2017 A* conf
Distributed Degree Splitting, Edge Coloring, and Orientations.
SODA
Mohsen Ghaffari, Hsin-Hao Su
2017 A* conf
Distributed MST and Routing in Almost Mixing Time.
PODC
Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su
2017 J jnl
Distributed algorithms for the Lovász local lemma and graph coloring.
Distributed Comput.
Kai-Min Chung, Seth Pettie, Hsin-Hao Su
2017 J jnl
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations.
CoRR
Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su
2017 A* conf
Scaling Algorithms for Weighted Matching in General Graphs.
SODA
Ran Duan, Seth Pettie, Hsin-Hao Su
2016 J jnl
Ant-Inspired Density Estimation via Random Walks.
CoRR
Cameron Musco, Hsin-Hao Su, Nancy A. Lynch
2016 A* conf
Ant-Inspired Density Estimation via Random Walks: Extended Abstract.
PODC
Cameron Musco, Hsin-Hao Su, Nancy A. Lynch
2016 Misc conf
Clairvoyant Mechanisms for Online Auctions.
COCOON
Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer
2016 J jnl
Distributed (Δ+1)-Coloring in Sublogarithmic Rounds.
CoRR
David G. Harris, Johannes Schneider, Hsin-Hao Su
2016 A* conf
Distributed (∆+1)-coloring in sublogarithmic rounds.
STOC
David G. Harris, Johannes Schneider, Hsin-Hao Su
2016 J jnl
Distributed Degree Splitting, Edge Coloring, and Orientations.
CoRR
Mohsen Ghaffari, Hsin-Hao Su
2015 A* conf
(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting.
SODA
Michael Elkin, Seth Pettie, Hsin-Hao Su
2015 — —
Algorithms for Fundamental Problems in Computer Networks.
Hsin-Hao Su
2015 J jnl
Distributed coloring algorithms for triangle-free graphs.
Inf. Comput.
Seth Pettie, Hsin-Hao Su
2014 J jnl
A Distributed Minimum Cut Approximation Scheme.
CoRR
Hsin-Hao Su
2014 A conf
Almost-Tight Distributed Minimum Cut Algorithms.
DISC
Danupon Nanongkai, Hsin-Hao Su
2014 J jnl
Almost-Tight Distributed Minimum Cut Algorithms.
CoRR
Danupon Nanongkai, Hsin-Hao Su
2014 B conf
Brief annoucement: a distributed minimum cut approximation scheme.
SPAA
Hsin-Hao Su
2014 A* conf
Distributed algorithms for the Lovász local lemma and graph coloring.
PODC
Kai-Min Chung, Seth Pettie, Hsin-Hao Su
2013 — conf
Fast Distributed Coloring Algorithms for Triangle-Free Graphs.
ICALP (2)
Seth Pettie, Hsin-Hao Su
2012 A* conf
A scaling algorithm for maximum weight matching in bipartite graphs.
SODA
Ran Duan, Hsin-Hao Su
2012 J jnl
On uniformly balanced graphs.
Australas. J Comb.
Harris Kwong, Sin-Min Lee, Sheng-Ping Bill Lo, Hsin-Hao Su, Yung-Chin Wang
2011 J jnl
Scaling algorithms for approximate and exact maximum weight matching
CoRR
Ran Duan, Seth Pettie, Hsin-Hao Su
2010 J jnl
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights.
Algorithmica
Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su
2008 J jnl
An improved algorithm for finding a length-constrained maximum-density subtree in a tree.
Inf. Process. Lett.
Hsin-Hao Su, Chin Lung Lu, Chuan Yi Tang