Email: shuxinkai@ustc.edu.cn
主要研究方向：理论计算机科学、在线算法设计与分析、最短路算法
束欣凯，中国科学技术大学计算机科学与技术学院特任教授。2019年本科毕业于清华大学姚班，2024年获得香港大学计算机博士学位，后于德国马克斯·普朗克计算机科学研究所担任博士后研究员。研究领域为理论计算机科学，主要方向为超越最坏情况分析的在线算法，并深入探讨在线决策中的匹配、选择与资源分配问题，以及图论中的最短路算法。相关研究成果发表于STOC、FOCS、ICALP、WINE等理论计算机科学一流国际会议。于2025年获得理论计算机科学顶级会议STOC的最佳论文奖。
招生信息：欢迎对理论计算机科学，尤其是对在线算法和最短路算法感兴趣的同学与我联系。
（根据理论计算机科学惯例，以下论文作者按姓氏字母排序）
1. Ran Duan, Xiao Mao, Xinkai Shu, and Longhui Yin. A Faster Directed Single-Source Shortest Path Algorithm. In Proceedings of the 53rd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2026)
2. Zhiyi Huang, Chui Shan Lee, Xinkai Shu, and Zhaozi Wang. The Long Arm of Nashian Allocation in Online p-Mean Welfare Maximization. In Proceedings of the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2025)
3. Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin. Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. In Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2025)
Best Paper Award. Invited to the Journal of the ACM.
4. Zhiyi Huang, Chui Shan Lee, Jianqiao Lu, and Xinkai Shu. Online Matching Meets Sampling Without Replacement. In Proceedings of the 20th Conference on Web and Internet Economics (WINE 2024)
5. Zhiyi Huang, Minming Li, Xinkai Shu, and Tianze Wei. Online Nash Welfare Maximization Without Predictions. In Proceedings of the 19th Conference on Web and Internet Economics (WINE 2023)
6. Ran Duan, Jiayi Mao, Xinkai Shu, and Longhui Yin. A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs. In Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2023)
7. Zhiyi Huang, Xinkai Shu, and Shuyi Yan. The Power of Multiple Choices in Online Stochastic Matching. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022)
8. Zhiyi Huang and Xinkai Shu. Online Stochastic Matching, Poisson Arrivals, and the Natural Linear Program. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2021)
（更新于2026年9月）
