Max Ovsiankin

According to our database, Max Ovsiankin authored at least 5 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes.

Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Approximation Algorithms for 𝓁_p-Shortest Path and 𝓁_p-Group Steiner Tree.

Yury Makarychev, Max Ovsiankin, Erasmo Tani

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

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

Naren Sarayu Manoj, Max Ovsiankin

CoRR, 2023

2022

Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes.

Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2020

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

Cecilia Boschini, Jan Camenisch, Max Ovsiankin, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2020