I am a Ph.D. candidate majoring in Computer Science at Princeton University, where I am fortunate to be advised by Gillat Kol. I will participate in the Sublinear Algorithms program at Simons Institute for the Theory of Computing this upcoming summer. I earned B.Eng. in Computer Science and Technology from Yao Class of the Institute for Interdisciplinary Information Sciences at Tsinghua University. During the spring and summer of 2019, I made an unforgettable research visit at the University of Michigan, supervised by Seth Pettie.

My research interests lie broadly in most topics in theoretical computer science, especially those related to the design and analysis of algorithms. At present, I am working mainly on streaming/sketching algorithms, communication complexity, and interactive coding.

• Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams

Sepehr Assadi, Gillat Kol, and Zhijun Zhang

STOC 2024, to appear

[abstract] [ECCC] [arXiv]

• Round‐vs‐Resilience Tradeoffs for Binary Feedback Channels

Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh Saxena, and Zhijun Zhang

[abstract] [ECCC]

• Rounds vs Communication Tradeoffs for Maximal Independent Sets

Sepehr Assadi, Gillat Kol, and Zhijun Zhang

SIAM J. Comput., to appear

FOCS 2022

Invited to SICOMP special issue on FOCS 2022

[abstract] [video] [slides] [SICOMP] [FOCS] [ECCC] [arXiv] [BibTeX]

• Binary Codes with Resilience Beyond 1/4 via Interaction

Klim Efremenko, Gillat Kol, Raghuvansh Saxena, and Zhijun Zhang

FOCS 2022

[abstract] [video (Raghuvansh Saxena)] [FOCS] [ECCC] [BibTeX]

• The Communication Complexity of Set Intersection and Multiple Equality Testing

Dawei Huang, Seth Pettie, Yixiang Zhang, and Zhijun Zhang

SIAM J. Comput., 50(2):674-717, 2021

SODA 2020

[abstract] [SICOMP] [SODA] [arXiv] [BibTeX]

• Assistant in Instruction, Information Theory and Applications (COS 585), Princeton University, Spring 2024

• Assistant in Instruction, Computational Complexity (COS 522 / MAT 578), Princeton University, Spring 2023

• Assistant in Instruction, Computational Complexity (COS 522 / MAT 578), Princeton University, Spring 2022

• Assistant in Instruction, Theory of Computation (COS 487 / MAT 407), Princeton University, Fall 2021

• Beijing Outstanding Graduate (Bachelor), Beijing, China, 2020

• Tsinghua Excellent Graduate (Bachelor), Tsinghua University, 2020

• Yao Award (Bronze Medal), Tsinghua University, 2019

• Jiang Nanxiang Scholarship, Tsinghua University, 2018

• Freshman Second Class Scholarship, Tsinghua University, 2016

• Gold Medal (7th Place), 32nd National Olympiad in Informatics, Zhejiang, China, 2015

• Gold Medal (21st Place), 31st National Olympiad in Informatics, Guangdong, China, 2014