Max Ovsiankin

Max Ovsiankin

Hello! I am a fourth-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.

Email: [concat ma and xov] at ttic dot edu

Publications

All authors are in α-β order as is customary in TCS. Also see my Google Scholar.
2023
The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms
Naren Manoj, MO. arXiv
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes
Yury Makarychev, Naren Manoj, MO. arXiv
2022
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes
Yury Makarychev, Naren Manoj, MO. COLT 2022. arXiv
2020
Efficient Post-Quantum SNARKs for RSIS and RLWE and their Applications to Privacy
Cecilia Boschini, Jan Camenisch, MO, Nicholas Spooner. PQCrypto 2020. IACR ePrint