Longhui Yin

Institute for Interdisciplinary Information Science. Beijing, China.

longhui_yin_photo_300_400.jpg

I am a PhD student at Institute for Interdisciplinary Information Science (IIIS), Tsinghua University, where I am very fortunate to be advised by Prof. Andrew Yao.

Prior to that, I obtained my bachelor’s degree from IIIS, Tsinghua University, also known as Yao Class, instructed by Prof. Ran Duan.

I am currently interested in conbinatorical graph algorithms and data structure design problems.

6F, FIT Building, Tsinghua University, Beijing, China
ylh21[AT]mails.tsinghua.edu.cn

selected publications

  1. Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
    Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin
    In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, Jun 2025
    Best Paper Award
    DOI
  2. A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
    Ran Duan, Jiayi Mao, Xinkai Shu, and Longhui Yin
    In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, Nov 2023
    DOI
  3. Optimal vertex connectivity oracles
    Seth Pettie, Thatchaphol Saranurak, and Longhui Yin
    In Proceedings of the 54th Annual ACM Symposium on Theory of Computing, STOC 2022, Rome, Italy, Jun 2022
    DOI
Why suffix 256? Because 256 equals to the number of bit patterns of a byte. Very easy to remember for computer scientists! :)