Zhaienhe Zhou

About Me

I am an undergraduate in Computer Science at the University of Science and Technology of China (USTC), School of the Gifted Young, advised by Prof. Xue Chen.

My research interests broadly lie in theoretical computer science, especially in coding theory, randomized algorithms, and graph theory. I also actively participate in competitive programming, winning a Bronze Medal (9th place) at the ICPC 2025 World Finals in Baku.

Currently, I am visiting Prof. Xin Li’s group at Johns Hopkins University as a research intern.

Publications

1. Xue Chen, Wenxuan Shu and Zhaienhe Zhou. Algorithms for Sparse LPN and LSPN Against Low‑Noise. 38th Annual Conference on Learning Theory (COLT 2025). arXiv:2407.19215
   • Wenxuan’s Presentation at COLT2025: video
2. Zhaienhe Zhou and Zeyu Guo. Improved Decoding of Tanner Codes. IEEE International Symposium on Information Theory (ISIT 2025). arXiv:2501.12293 Conference version
   • My Presentation at ISIT2025: slides

Selected Awards & Honors

Competition

• Bronze Medal, ICPC World Finals 2025 Baku (9th place)
• Highest Honor, ICPC World Finals 2024 Astana (13th place)
• Gold medals x 3, ICPC Asia‑East Continent Final (2022 – 2024), including 5th place in 2024
• Gold medals, CCPC Finals (2024, 5th place)
• Gold medals x 6, ICPC Regionals (2022 – 2024), including 2nd place in ICPC Nanjing 2024
• Gold medal, CCPC Harbin Regional 2024 (2nd place)
• Bronze Medal, National Olympiad in Informatics 2021

Academic

• Silver Scholarship, USTC School of the Gifted Young (2023, 2024)
• Second Prize, National College Student Mathematics Competition 2023

Research Experience

Improved Decoding of Tanner Codes (August 2024) advised by Prof. Zeyu Guo (Ohio State University)

• Developed improved decoding algorithm via weighted voting
• Extended decoding regime from δ d₀ > 3 to δ d₀ > 2
• Derived tighter upper bounds for Tanner code distance using size‑expansion trade‑offs

Algorithms for Sparse LPN/LSPN (February 2024 – May 2025) advised by Prof. Xue Chen (USTC)

• Proposed LSPN algorithm with time complexity O(η·n/k)^k, developed improved sparse LPN algorithms
• Our algorithms combined domain reduction techniques with Gaussian elimination and BKW

Teaching

• Teaching Assistant, Foundations of Algorithms, USTC (Spring 2024)
• Competition Coach, TopsCoding Winter Course 2024

Miscellaneous

• My Blog: blog-e.top includes some notes on algorithms (mostly in Chinese).
• Outside of research, I enjoy playing guitar and running.

Last updated: October 20, 2025