Follow
Mikhail Makarov
Mikhail Makarov
Verified email at epfl.ch
Title
Cited by
Cited by
Year
Traversing the FFT computation tree for dimension-independent sparse Fourier transforms
K Bringmann, M Kapralov, M Makarov, V Nakos, A Yagudin, A Zandieh
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
3*2023
Toeplitz Low-Rank Approximation with Sublinear Query Complexity
M Kapralov, H Lawrence, M Makarov, C Musco, K Sheth
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
22023
Expander decomposition in dynamic streams
A Filtser, M Kapralov, M Makarov
arXiv preprint arXiv:2211.11384, 2022
22022
Logical complexity of induced subgraph isomorphism for certain families of graphs
ME Zhukovskii, ED Kudryavtsev, MV Makarov, AS Shlychkova
Sbornik: Mathematics 212 (4), 517, 2021
1*2021
On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
M Kapralov, M Makarov, C Sohler
arXiv preprint arXiv:2402.09707, 2024
2024
Motif Cut Sparsifiers
M Kapralov, M Makarov, S Silwal, C Sohler, J Tardos
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
2022
First-order definitions of subgraph isomorphism through the adjacency and order relations
O Grigoryan, M Makarov, M Zhukovskii
Moscow Journal of Combinatorics and Number Theory 9 (3), 293-302, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–7