Hsin-Hao Su

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 42

Top Topics

Data Summarization

Correlation Clustering

Wireless Local Area Network

Density Estimation

Top Venues

Publications

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