| 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 | 29 | 2020 |
| Streaming algorithms for ellipsoidal approximation of convex polytopes Y Makarychev, NS Manoj, M Ovsiankin Conference on Learning Theory, 3070-3093, 2022 | 8 | 2022 |
| The change-of-measure method, block lewis weights, and approximating matrix block norms NS Manoj, M Ovsiankin arXiv preprint arXiv:2311.10013, 2023 | 3 | 2023 |
| Near-optimal streaming ellipsoidal rounding for general convex polytopes Y Makarychev, NS Manoj, M Ovsiankin Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1526-1537, 2024 | 2 | 2024 |
| Approximation Algorithms for -Shortest Path and -Group Steiner Tree Y Makarychev, M Ovsiankin, E Tani arXiv preprint arXiv:2404.17669, 2024 | | 2024 |
| Approximation Algorithms for 𝓁_p-Shortest Path and 𝓁_p-Group Steiner Tree Y Makarychev, M Ovsiankin, E Tani 51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024 | | 2024 |
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at ChicagoVerified email at ttic.edu
