Zhongtian He (何中天)
Email: zhongtian.he [at] princeton.edu, hezhongtian1 [at] gmail.com
About me
Hi! I am a PhD student in the theory group at Princeton, advised by Mark Braverman. Before this, I graduated from Yao Class at Tsinghua University in 2022.
I am interested in coding theory and graph algorithms.
Publications
Conference papers
Cactus Representation of Minimum Cuts: Derandomize and Speed up [pdf] [tutorial video]
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
SODA 2024
Summary: A detailed and complete proof of how to construct a cactus in near-linear time. Our approach is more modular and also deterministic.
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts [pdf] [tutorial video]
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
SODA 2024
Summary: Introducing maximal isolating mincuts with its first application: building cactus. We expect to see more applications for this tool.
Improved Online Correlated Selection [pdf] [video]
Ruiquan Gao, Zhongtian He, Zhiyi Huang, Zipei Nie, Bijun Yuan, Yan Zhong
FOCS 2021
Summary: The first multi-way semi-OCS bypassing the positive correlation in sampling without replacement, and improving the OCS.
Manuscripts
Coming soon :)
Teaching Experiences
I have been a teaching assistant in the following courses:
Information Theory and Applications, taught by Ran Raz, Princeton University, Spring 2024
Advanced Algorithm Design, taught by Huacheng Yu, Princeton University, Fall 2023
Theory of Computation, taught by Ran Duan, Tsinghua University, Spring 2022
In 2024, I have been a co-organizer for reading groups on Communication Complexity and Boolean Function Analysis. We cover the books and recent developments in these fields.
Miscellaneous
I like running, biking, playing soccer, competitive programming, and reading books. I love cats.
In my spare time, I enjoy watching soccer and snooker. I am a Liverpool fan, and my favorite player is Mo Salah.