| CARVIEW |
Select Language
HTTP/2 200
server: GitHub.com
content-type: text/html; charset=utf-8
last-modified: Fri, 19 Dec 2025 02:16:29 GMT
access-control-allow-origin: *
etag: W/"6944b57d-fb2"
expires: Tue, 30 Dec 2025 20:46:49 GMT
cache-control: max-age=600
content-encoding: gzip
x-proxy-cache: MISS
x-github-request-id: CE0E:292AC1:A75E47:BC0597:695437E0
accept-ranges: bytes
date: Tue, 30 Dec 2025 20:36:49 GMT
via: 1.1 varnish
age: 0
x-served-by: cache-bom-vanm7210026-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1767127009.154088,VS0,VE203
vary: Accept-Encoding
x-fastly-request-id: af16f7c926e99abe3bb054b8162d2915c715d871
content-length: 1556
Xiao Mao (毛啸)
Xiao Mao
I am a Ph.D. candidate in Computer Science at Stanford University advised by Professor Aviad Rubinstein. Previously, I received an M.Eng degree in Electrical Engineering and Computer Science and a B.S. degree in Computer Science and Mathematics at MIT. My M.Eng thesis was supervised by Prof. Virginia Vassilevska Williams.
My research interest is in theoretical computer science in general. (CV)
Email: xiaomao at stanford dot edu.
Selected Publications
All authors are listed in lexicographic order.
Conference Papers
-
Breaking the Sorting Barrier for Directed Single-Source Shortest PathsRan Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui YinACM Symposium on Theory of Computing (STOC 2025). Best Paper Award. Invited to the Journal of the ACM
-
Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update TimeXiao MaoACM Symposium on Theory of Computing (STOC 2024)
-
(1−ε)-Approximation of Knapsack in Nearly Quadratic TimeXiao MaoACM Symposium on Theory of Computing (STOC 2024)
-
Approximating Knapsack and Partition via Dense Subset SumsMingyang Deng, Ce Jin, Xiao MaoACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
-
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial ApproachMingyang Deng, Xiao Mao, Ziqian ZhongACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
-
Breaking the Cubic Barrier for (Unweighted) Tree Edit DistanceXiao MaoIEEE Symposium on Foundations of Computer Science (FOCS 2021). Machtey Award for Best Student Paper, sole winner. Invited to the SICOMP Special Issue for FOCS 2021My first peer-reviewed publication
Miscellaneous
Competitive programming: Competitive Programming Hall Of Fame