Följ
Max Ovsiankin
Max Ovsiankin
Verifierad e-postadress på ttic.edu - Startsida
Titel
Citeras av
Citeras av
År
Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
C Boschini, J Camenisch, M Ovsiankin, N Spooner
Post-Quantum Cryptography: 11th International Conference, PQCrypto 2020 …, 2020
292020
Streaming algorithms for ellipsoidal approximation of convex polytopes
Y Makarychev, NS Manoj, M Ovsiankin
Conference on Learning Theory, 3070-3093, 2022
52022
The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms
NS Manoj, M Ovsiankin
arXiv preprint arXiv:2311.10013, 2023
22023
Approximation Algorithms for -Shortest Path and -Group Steiner Tree
Y Makarychev, M Ovsiankin, E Tani
arXiv preprint arXiv:2404.17669, 2024
2024
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes
Y Makarychev, NS Manoj, M Ovsiankin
arXiv preprint arXiv:2311.09460, 2023
2023
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–5