°¬¿ÉÖ±²¥

Theoretical Computer Science: 

(authors are alphabetically ordered according to theoretical computer science tradition)

• Merav Parter and Hsin-Hao Su. (Δ+1)-Coloring in O(log^*Δ) Congested-Clique Rounds.In Proceedings of 32nd Int’l Symposium on Distributed Computing (DISC 2018).

• Bernhard Haeupler, Jeet Mohapatra, and Hsin-Hao Su. Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. In Proceedings of 37th ACM Symposium on Principles of Distributed Computing (PODC 2018).

• Mohsen Ghaffari, Fabian Kuhn, and Hsin-Hao Su. Distributed MST and Routing in Almost Mixing Time. In Proceedings of 36th ACM Symposium on Principles of Distributed Computing (PODC 2017).

• Mohsen Ghaffari and Hsin-Hao Su. Distributed Degree Splitting, Edge Coloring, and Orientations. In Proceedings of 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017).

• Ran Duan, Seth Pettie, and Hsin-Hao Su. Scaling Algorithms for Weighted Matching in General Graphs. ACM Transactions on Algorithms, 14(1), Article 8, 2018. A preliminary version appeared in Proceedings of 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017).

• Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, and Roger Wattenhofer. Clairvoyant Mechanism for Online Auctions. In Proceedings of 22nd Int’l Computing and Combinatorics Conference (COCOON 2016).

• David G. Harris, Johannes Schneider, and Hsin-Hao Su. Distributed (Δ+1)-coloring in Sublogarithmic Rounds. Journal of the ACM, 65(4), Article 19, 2018. A preliminary appeared in Proceedings of 48th Annual Symposium on the Theory of Computing (STOC 2016).

• Michael Elkin, Seth Pettie, and Hsin-Hao Su. (2Δ- 1)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. In Proceedings of 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015).

• Danupon Nanongkai and Hsin-Hao Su. Almost-Tight Distributed Minimum Cut Algorithms. In Proceedings of 28th Int’l Symposium on Distributed Computing (DISC 2014).

• Kai-Min Chung, Seth Pettie, and Hsin-Hao Su. Distributed Algorithms for the Lovász Local Lemma and Graph Coloring. Distributed Computing 30(4):261-280, 2017. A preliminary version appeared in Proceedings of 33rd ACM Symposium on Principles of Distributed Computing (PODC 2014).

• Seth Pettie and Hsin-Hao Su. Distributed Coloring Algorithms for Triangle-Free Graphs. Information and Computation 243:263-280, 2015. A preliminary version appeared in Proceedings of 40th Int’l Colloq. on Automata, Languages, and Programming (ICALP 2013).

• Ran Duan and Hsin-Hao Su. A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs. In Proceedings of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012).

Interdisciplinary Research between Computer Science and Biology:

• Hsin-Hao Su, Lili Su, Anna Dornhaus, Nancy Lynch. Ant-Inspired Dynamic Task Allocation via Gossiping. In Proceedings of 19th Int’l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2017).

• Cameron Musco, Hsin-Hao Su, and Nancy Lynch. Ant-Inspired Density Estimation via Random Walks. In Proceedings of the National Academy of Sciences (PNAS), 114(40):10534-10541, 2017. A preliminary version appeared in Proceedings of 35th ACM Symposium on Principles of Distributed Computing (PODC 2016).

• Anna Dornhaus, Nancy Lynch, Tsvetomira Radeva, Radhika Nagpal, and Hsin-Hao Su. Effects of colony size and extra workers in social insects and other multi-agent systems. PLOS Computational Biology 13(12):1-29, 2017