default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHsin-Hao Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. ESA 2024: 13:1-13:15- [c27]Yi-Jun Chang
, Shang-En Huang, Hsin-Hao Su:
Deterministic Expander Routing: Faster and More Versatile. PODC 2024: 194-204 - [c26]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. SODA 2024: 4124-4154 - [i18]Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su:
Deterministic Expander Routing: Faster and More Versatile. CoRR abs/2405.03908 (2024) - 2023
- [j10]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): 800-830 (2023) - [c25]Shang-En Huang, Hsin-Hao Su:
(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings. PODC 2023: 44-54 - [c24]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. SPAA 2023: 249-259 - [i17]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 abs/2303.00811 (2023) - [i16]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. CoRR abs/2307.06723 (2023) - 2022
- [c23]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-Round Tree Contraction. ITCS 2022: 83:1-83:23 - [c22]Yi-Jun Chang, Hsin-Hao Su:
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. PODC 2022: 301-312 - [i15]Yi-Jun Chang, Hsin-Hao Su:
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. CoRR abs/2205.08093 (2022) - [i14]Shang-En Huang, Hsin-Hao Su:
(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings. CoRR abs/2212.14425 (2022) - 2021
- [c21]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. PODC 2021: 295-305 - [i13]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-round Tree Contraction. CoRR abs/2111.01904 (2021) - 2020
- [c20]Hsin-Hao Su, Nicole Wein:
Lower Bounds for Dynamic Distributed Task Allocation. ICALP 2020: 99:1-99:14 - [c19]Hsin-Hao Su, Hoa T. Vu:
Distributed Dense Subgraph Detection and Low Outdegree Orientation. DISC 2020: 15:1-15:18 - [i12]Hsin-Hao Su, Nicole Wein:
Lower Bounds for Dynamic Distributed Task Allocation. CoRR abs/2006.16898 (2020) - [i11]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. CoRR abs/2009.10761 (2020)
2010 – 2019
- 2019
- [c18]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: 1-2 - [c17]Hsin-Hao Su, Hoa T. Vu:
Towards the locality of Vizing's theorem. STOC 2019: 355-364 - [c16]Hsin-Hao Su, Hoa T. Vu:
Distributed Data Summarization in Well-Connected Networks. DISC 2019: 33:1-33:16 - [i10]Hsin-Hao Su, Hoa T. Vu:
Towards the Locality of Vizing's Theorem. CoRR abs/1901.00479 (2019) - [i9]Hsin-Hao Su, Hoa T. Vu:
Distributed Dense Subgraph Detection and Low Outdegree Orientation. CoRR abs/1907.12443 (2019) - [i8]Hsin-Hao Su, Hoa T. Vu:
Distributed Data Summarization in Well-Connected Networks. CoRR abs/1908.00236 (2019) - 2018
- [j9]David G. Harris, Johannes Schneider, Hsin-Hao Su:
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. J. ACM 65(4): 19:1-19:21 (2018) - [j8]Ran Duan, Seth Pettie, Hsin-Hao Su:
Scaling Algorithms for Weighted Matching in General Graphs. ACM Trans. Algorithms 14(1): 8:1-8:35 (2018) - [c15]Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su:
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. PODC 2018: 179-188 - [c14]Merav Parter, Hsin-Hao Su:
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. DISC 2018: 39:1-39:18 - 2017
- [j7]Kai-Min Chung, Seth Pettie, Hsin-Hao Su:
Distributed algorithms for the Lovász local lemma and graph coloring. Distributed Comput. 30(4): 261-280 (2017) - [j6]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) - [j5]Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-inspired density estimation via random walks. Proc. Natl. Acad. Sci. USA 114(40): 10534-10541 (2017) - [c13]Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su:
Distributed MST and Routing in Almost Mixing Time. PODC 2017: 131-140 - [c12]Ran Duan, Seth Pettie, Hsin-Hao Su:
Scaling Algorithms for Weighted Matching in General Graphs. SODA 2017: 781-800 - [c11]Mohsen Ghaffari, Hsin-Hao Su:
Distributed Degree Splitting, Edge Coloring, and Orientations. SODA 2017: 2505-2523 - [c10]Hsin-Hao Su, Lili Su, Anna R. Dornhaus, Nancy A. Lynch:
Ant-Inspired Dynamic Task Allocation via Gossiping. SSS 2017: 157-171 - [i7]Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su:
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. CoRR abs/1711.09258 (2017) - 2016
- [c9]Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer:
Clairvoyant Mechanisms for Online Auctions. COCOON 2016: 3-14 - [c8]Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-Inspired Density Estimation via Random Walks: Extended Abstract. PODC 2016: 469-478 - [c7]David G. Harris, Johannes Schneider, Hsin-Hao Su:
Distributed (∆+1)-coloring in sublogarithmic rounds. STOC 2016: 465-478 - [i6]David G. Harris, Johannes Schneider, Hsin-Hao Su:
Distributed (Δ+1)-Coloring in Sublogarithmic Rounds. CoRR abs/1603.01486 (2016) - [i5]Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-Inspired Density Estimation via Random Walks. CoRR abs/1603.02981 (2016) - [i4]Mohsen Ghaffari, Hsin-Hao Su:
Distributed Degree Splitting, Edge Coloring, and Orientations. CoRR abs/1608.03220 (2016) - 2015
- [b1]Hsin-Hao Su:
Algorithms for Fundamental Problems in Computer Networks. University of Michigan, USA, 2015 - [j4]Seth Pettie, Hsin-Hao Su:
Distributed coloring algorithms for triangle-free graphs. Inf. Comput. 243: 263-280 (2015) - [c6]Michael Elkin, Seth Pettie, Hsin-Hao Su:
(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. SODA 2015: 355-370 - 2014
- [c5]Kai-Min Chung, Seth Pettie, Hsin-Hao Su:
Distributed algorithms for the Lovász local lemma and graph coloring. PODC 2014: 134-143 - [c4]Hsin-Hao Su:
Brief annoucement: a distributed minimum cut approximation scheme. SPAA 2014: 217-219 - [c3]Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. DISC 2014: 439-453 - [i3]Hsin-Hao Su:
A Distributed Minimum Cut Approximation Scheme. CoRR abs/1401.5316 (2014) - [i2]Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. CoRR abs/1408.0557 (2014) - 2013
- [c2]Seth Pettie, Hsin-Hao Su:
Fast Distributed Coloring Algorithms for Triangle-Free Graphs. ICALP (2) 2013: 681-693 - 2012
- [j3]Harris Kwong, Sin-Min Lee, Sheng-Ping Bill Lo, Hsin-Hao Su, Yung-Chin Wang:
On uniformly balanced graphs. Australas. J Comb. 53: 83-96 (2012) - [c1]Ran Duan, Hsin-Hao Su:
A scaling algorithm for maximum weight matching in bipartite graphs. SODA 2012: 1413-1424 - 2011
- [i1]Ran Duan, Seth Pettie, Hsin-Hao Su:
Scaling algorithms for approximate and exact maximum weight matching. CoRR abs/1112.0790 (2011) - 2010
- [j2]Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su:
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. Algorithmica 56(3): 297-312 (2010)
2000 – 2009
- 2008
- [j1]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): 161-164 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
