( en | de | ru )

 

Disambiguation of "Su, Hsin-Hao"

Author of the publication

copydeleteadd this publication to your clipboard
Scaling algorithms for approximate and exact maximum weight matching

, , and . CoRR, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

I-hsin Su

Hao-Wei Su

Wenjung Hsing

Chi-Wu Hsing

Ed Huai hsin Chi

 

Other publications of authors with the same name

Ant-Inspired Density Estimation via Random Walks: Extended Abstract., , and . PODC, page 469-478. ACM, (2016)Almost-Tight Distributed Minimum Cut Algorithms., and . DISC, volume 8784 of Lecture Notes in Computer Science, page 439-453. Springer, (2014)Clairvoyant Mechanisms for Online Auctions., , , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 3-14. Springer, (2016)(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings., and . PODC, page 44-54. ACM, (2023)Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions., and . PODC, page 301-312. ACM, (2022)Distributed Dense Subgraph Detection and Low Outdegree Orientation., and . DISC, volume 179 of LIPIcs, page 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds., and . DISC, volume 121 of LIPIcs, page 39:1-39:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Algorithms for Fundamental Problems in Computer Networks.. University of Michigan, USA, (2015)Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds., , and . SODA, page 4124-4154. SIAM, (2024)Towards the locality of Vizing's theorem., and . STOC, page 355-364. ACM, (2019)