Dr. Zhijun Zhang
I am a postdoc researcher at INSAIT, hosted by Bernhard Haeupler. Previously, I earned my Ph.D. in Computer Science at Princeton University, where I was fortunate to be advised by Gillat Kol. Prior to that, I received my B.Eng. in Computer Science and Technology from Yao Class at Tsinghua University.
My research interests broadly lie in algorithms and computational complexity. Recently, I am working mainly on sublinear algorithms, communication complexity, and interactive coding.
Publications
- Multi‑Party Erasure Resilience Beyond 1/n
Klim Efremenko, Gillat Kol, Raghuvansh Saxena, and Zhijun Zhang
Manuscript
- Round‐vs‐Resilience Tradeoffs for Binary Feedback Channels
Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh Saxena, and Zhijun Zhang
ITCS 2025
- Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams
Sepehr Assadi, Gillat Kol, and Zhijun Zhang
STOC 2024
- 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
- 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
Honors & Awards
- 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
Teaching
- Assistant in Instruction, Computational Complexity (COS 522 / MAT 578), Princeton University, Spring 2025
- 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