Aarhus University Seal / Aarhus Universitets segl

Hsin-Hao Su

  1. 2015
  2. Published

    (2Δ − 1)-edge-coloring is much easier than maximal matching in the distributed setting. / Elkin , Michael ; Pettie, Seth; Su, Hsin-Hao.

    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15. ed. / Piotr Indyk . Society for Industrial and Applied Mathematics, 2015. p. 355-370 .

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  3. 2014
  4. Published

    Distributed algorithms for the Lovász Local Lemma and graph coloring. / Chung, Kai Min; Pettie, Seth; Su, Hsin Hao.

    Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2014. p. 134-143.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  5. 2013
  6. Published

    Fast distributed coloring algorithms for triangle-free graphs. / Pettie, S.; Su, H.-H.

    Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. ed. / Fedor Fomin; Rūsiņš Freivalds; Marta Kwiatkowska ; David Peleg. Springer Publishing Company, 2013. p. 681-693 (Lecture Notes in Computer Science, Vol. 7966).

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearchpeer-review