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 | 178 | 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 | 168 | 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 | 166 | 2017 |

Better bounds for matchings in the streaming model M Kapralov Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 151 | 2013 |

On differentially private low rank approximation M Kapralov, K Talwar Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 138 | 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 | 118 | 2014 |

Improved bounds for online stochastic matching B Bahmani, M Kapralov European Symposium on Algorithms, 170-181, 2010 | 108 | 2010 |

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 | 102 | 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 | 100 | 2013 |

Perfect matchings in o(*n* log *n*) time in regular bipartite graphsA Goel, M Kapralov, S Khanna Proceedings of the Forty-second ACM Symposium on Theory of Computing, 39-46, 2010 | 91 | 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 | 82 | 2021 |

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 |

Spanners and sparsifiers in dynamic streams M Kapralov, D Woodruff Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 78 | 2014 |

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 | 74 | 2019 |

A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling S Assadi, M Kapralov, S Khanna arXiv preprint arXiv:1811.07780, 2018 | 69 | 2018 |

(Nearly) sample-optimal sparse Fourier transform P Indyk, M Kapralov, E Price Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 68 | 2014 |

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 | 62 | 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 | 55 | 2016 |

Spectral sparsification via random spanners M Kapralov, R Panigrahy Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 53 | 2012 |

Factor modeling for advertisement targeting Y Chen, M Kapralov, J Canny, D Pavlov Advances in neural information processing systems 22, 2009 | 48 | 2009 |