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.

Publications

Conference papers

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching [pdf]

Matija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

SODA 2026

Undirected Multicast Network Coding Gaps via Locally Decodable Codes [pdf]

Mark Braverman, Zhongtian He

FOCS 2025

Cactus Representation of Minimum Cuts: Derandomize and Speed up [pdf] [tutorial video]

Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

SODA 2024

Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts [pdf] [tutorial video]

Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

SODA 2024

Improved Online Correlated Selection [pdf] [video]

Ruiquan Gao, Zhongtian He, Zhiyi Huang, Zipei Nie, Bijun Yuan, Yan Zhong

FOCS 2021

Teaching Experiences

I have been a teaching assistant in the following courses:

Information Theory and Applications, taught by Ran Raz, Princeton University, Fall 2025
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 Princeton, we run reading groups on Communication Complexity (in 2024), Boolean Function Analysis (in 24/25), and High-Dimensional Expanders (in 2025).

Miscellaneous

I classify my hobbies into four categories, inspired by algorithmic paradigms:

1. "Deterministic": running, cycling, and reading.

2. "Monte Carlo": soccer, snooker, and poker (Texas hold ‘em).

3. "Las Vegas": research.

4. "Adversarial": competitive programming.

Page updated

Google Sites

Report abuse