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.
(he/him)
Email: [concat ma and xov] at ttic dot edu
Publications
Also see my Google Scholar.
Approximation Algorithms for ℓp-Shortest Path and ℓp-Group Steiner Tree
Yury Makarychev, MO, Erasmo Tani.
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
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes
Efficient Post-Quantum SNARKs for RSIS and RLWE and their Applications to Privacy