Bounded Independence Edge Sampling for Combinatorial Graph Properties
with Aaron L. Putterman and Salil Vadhan. CCC 2026
About
Hi! My name is Vadim Zaripov. I study theoretical computer science, with interests in complexity theory, derandomization, spectral graph theory, and coding theory.
I recently completed my B.A./M.S. degree at Harvard. My undergraduate thesis, advised by Prof. Salil Vadhan, was focused on exploring combinatorial properties of bounded-independence subsampling of edges in graphs. If you have any questions about my research or would like to collaborate, you can reach me with: vadim.r.zaripov at gmail.com.
Research
Bivariate Linear Operator Codes
with Aaron L. Putterman. ISIT 2025
Education
Harvard University (2024-2026)
M.S. in Computer Science.
Harvard University (2022-2026)
B.A. in Computer Science with a Secondary Field in Mathematical Sciences.
Work Experience
Optiver
Worked in the Delta 1 QR/Data Team. Optimized data pipelines generating datasets for the Delta 1 Research team.
Awards
- Graduated with Highest Honors in Computer Science (Harvard University, 2026)
- All-Russian Olympiad in Informatics, 2022, prizewinner.