Michael Kapralov
Michael Kapralov
Assistant Professor, EPFL
Verified email at epfl.ch
Title
Cited by
Cited by
Year
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
1272017
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
1172012
Better bounds for matchings in the streaming model
M Kapralov
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete†…, 2013
1052013
On differentially private low rank approximation
M Kapralov, K Talwar
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete†…, 2013
1022013
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
952017
Improved bounds for online stochastic matching
B Bahmani, M Kapralov
European Symposium on Algorithms, 170-181, 2010
912010
Approximating matching size from random streams
M Kapralov, S Khanna, M Sudan
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete†…, 2014
892014
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
782013
Perfect Matchings in Time in Regular Bipartite Graphs
A Goel, M Kapralov, S Khanna
SIAM Journal on Computing 42 (3), 1392-1404, 2013
762013
(Nearly) sample-optimal sparse Fourier transform
P Indyk, M Kapralov, E Price
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete†…, 2014
572014
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
562014
Spanners and sparsifiers in dynamic streams
M Kapralov, D Woodruff
Proceedings of the 2014 ACM symposium on Principles of distributed computing†…, 2014
562014
Spectral sparsification via random spanners
M Kapralov, R Panigrahy
Proceedings of the 3rd Innovations in Theoretical Computer Science†…, 2012
452012
Factor Modeling for Advertisement Targeting.
Y Chen, M Kapralov, D Pavlov, JF Canny
NIPS 9, 324-332, 2009
402009
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
392014
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
372019
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
372016
A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling
S Assadi, M Kapralov, S Khanna
arXiv preprint arXiv:1811.07780, 2018
352018
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
342020
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
M Kapralov, J Nelson, J Pachocki, Z Wang, DP Woodruff, M Yahyazadeh
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS†…, 2017
332017
The system can't perform the operation now. Try again later.
Articles 1–20