Max Ovsiankin

Hello! I am a fifth-year Ph.D. student at TTIC, fortunate to be advised by Yury Makarychev. I am broadly interested in mathematics and theoretical computer science. My research focuses on using tools from probability, geometry, and analysis to design efficient algorithms for combinatorial optimization.

(he/him)
Email: [concat ma and xov] at ttic dot edu

Publications

Also see my Google Scholar.

The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms

Naren Manoj, MO. SODA 2025. arXiv

Approximation Algorithms for ℓp-Shortest Path and ℓp-Group Steiner Tree

Yury Makarychev, MO, Erasmo Tani. ICALP 2024. arXiv

Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes

Yury Makarychev, Naren Manoj, MO. STOC 2024. arXiv

Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes

Yury Makarychev, Naren Manoj, MO. COLT 2022. arXiv

Efficient Post-Quantum SNARKs for RSIS and RLWE and their Applications to Privacy

Cecilia Boschini, Jan Camenisch, MO, Nicholas Spooner. PQCrypto 2020. IACR ePrint