| Random Fourier features for kernel ridge regression: Approximation bounds and statistical guarantees H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh International conference on machine learning, 253-262, 2017 | 194 | 2017 |
| On the communication and streaming complexity of maximum bipartite matching A Goel, M Kapralov, S Khanna Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 183 | 2012 |
| Single pass spectral sparsification in dynamic streams M Kapralov, YT Lee, CN Musco, CP Musco, A Sidford SIAM Journal on Computing 46 (1), 456-477, 2017 | 177 | 2017 |
| Better bounds for matchings in the streaming model M Kapralov Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 161 | 2013 |
| On differentially private low rank approximation M Kapralov, K Talwar Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 148 | 2013 |
| Approximating matching size from random streams M Kapralov, S Khanna, M Sudan Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 131 | 2014 |
| Oblivious sketching of high-degree polynomial kernels TD Ahle, M Kapralov, JBT Knudsen, R Pagh, A Velingker, DP Woodruff, ... Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 125 | 2020 |
| Online submodular welfare maximization: Greedy is optimal M Kapralov, I Post, J Vondrák Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 116 | 2013 |
| Improved bounds for online stochastic matching B Bahmani, M Kapralov European Symposium on Algorithms, 170-181, 2010 | 111 | 2010 |
| Practice of streaming processing of dynamic graphs: Concepts, models, and systems M Besta, M Fischer, V Kalavri, M Kapralov, T Hoefler IEEE Transactions on Parallel and Distributed Systems 34 (6), 1860-1876, 2021 | 98 | 2021 |
| Perfect matchings in o(n log n) time in regular bipartite graphs A Goel, M Kapralov, S Khanna Proceedings of the Forty-second ACM Symposium on Theory of Computing, 39-46, 2010 | 97 | 2010 |
| Online matching with general arrivals B Gamlath, M Kapralov, A Maggiori, O Svensson, D Wajc 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 26-37, 2019 | 86 | 2019 |
| Spanners and sparsifiers in dynamic streams M Kapralov, D Woodruff Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 82 | 2014 |
| Sample-optimal Fourier sampling in any constant dimension P Indyk, M Kapralov 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 514-523, 2014 | 81 | 2014 |
| A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling S Assadi, M Kapralov, S Khanna arXiv preprint arXiv:1811.07780, 2018 | 77 | 2018 |
| Streaming lower bounds for approximating MAX-CUT M Kapralov, S Khanna, M Sudan Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 71 | 2014 |
| (Nearly) sample-optimal sparse Fourier transform P Indyk, M Kapralov, E Price Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 70 | 2014 |
| Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time M Kapralov Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 57 | 2016 |
| Spectral sparsification via random spanners M Kapralov, R Panigrahy Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 53 | 2012 |
| Space efficient approximation to maximum matching size from uniform edge samples M Kapralov, S Mitrović, A Norouzi-Fard, J Tardos Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 52 | 2020 |