Hello, I’m Zhaienhe Zhou, a third-year undergraduate student majoring in Computer Science at the University of Science and Technology of China (USTC). My research interests focus on theoretical computer science, including randomized algorithms, coding theory, and graph theory.
I recently participated in the 2024 ICPC World Finals, achieving 13th place (solving the same number of problems as the 12th place bronze medal team). Besides competitive programming, I actively contribute to research under the mentorship of distinguished professors.
Improved Decoding of Tanner Codes (2024.8, in submission, Draft)
Advisor: Prof. Zeyu Guo (Assistant Professor, the Ohio State University)
Enhanced decoding algorithms for Tanner codes, extending the decoding regime and improving deterministic decoding radius. Derived tighter upper bounds for Tanner code distances.
Algorithms for Sparse LPN and LSPN Against Low-Noise (2024.2 - present, in submission, Draft)
Advisor: Prof. Xue Chen (Professor, USTC), with Wenxuan Shu
Proposed improved learning algorithms for Sparse LPN and LSPN, significantly improving time and sample complexity for a range of noise rate.
Expansion on Regular Graphs (2023.9 – 2024.1)
Advisor: Prof. Xue Chen (Professor, USTC)
Explored methods to establish lower bounds on graph expansion using eigenvalue and girth-based techniques, proposing enhancements for stronger bounds.
Teaching Assistant, Foundations of Algorithms, USTC (2024.2 – 2024.6)
Designed lab assignments and conducted weekly office hours to support students.
Competition Coach, Winter 2024 Coding Course at TopsCoding (2024.1 – 2024.2)
Present tutorials on string algorithms and number theory.