Skip to main content

Sublinear Algorithms for Modern Data Analysis

Searching for OpenAIRE data...

Publications

Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model,

Author(s): Kapralov, Michael
Published in: 2021

Fairness in Streaming Submodular Maximization: Algorithms and Hardness

Author(s): Halabi, Marwa El; Mitrović, Slobodan; Norouzi-Fard, Ashkan; Tardos, Jakab; Tarnawski, Jakub
Published in: 2019

Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model

Author(s): Arnold Filtser, Michael Kapralov, Navid Nouri
Published in: accepted for publication in the Thirty Second ACM Symposium on Discrete Algorithms (SODA 2021), 2021

Online metric algorithms with untrusted predictions

Author(s): Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand
Published in: 2020

The Sketching Complexity of Graph and Hypergraph Counting

Author(s): John Kallaugher, Michael Kapralov, Eric Price
Published in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Page(s) 556-567
DOI: 10.1109/focs.2018.00059

An optimal space lower bound for approximating MAX-CUT

Author(s): Michael Kapralov, Dmitry Krachun
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 277-288
DOI: 10.1145/3313276.3316364

Differentially Private Release of Synthetic Graphs

Author(s): M. Elias, M. Kapralov, J. Kulkarni and Y. T. Lee
Published in: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020

Efficiently Learning Fourier Sparse Set Functions

Author(s): A. Amrollahi, A. Zandieh, M. Kapralov, A. Krause
Published in: Thirty-third Conference on Neural Information Processing Systems, 2019

A universal sampling method for reconstructing signals with simple Fourier transforms

Author(s): Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1051-1063
DOI: 10.1145/3313276.3316363

A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling

Author(s): S. Assadi, M. Kapralov, S. Khanna
Published in: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019
DOI: 10.4230/lipics.itcs.2019.6

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Author(s): M. Kapralov, A. Mousavifar, C. Musco, C. Musco, N. Nouri, A. Sidford, J. Tardos
Published in: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020

Online Matching with General Arrivals

Author(s): Gamlath, Buddhima; Kapralov, Michael; Maggiori, Andreas; Svensson, Ola; Wajc, David
Published in: IEEE Symposium on Foundations of Computer Science (FOCS 2019), 2019

Oblivious Sketching of High-Degree Polynomial Kernels

Author(s): T. D. Ahle, M. Kapralov, J. B. T. Knudsen, R. Pagh, A. Velingker, D. Woodruff and A. Zandieh
Published in: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Author(s): M. Kapralov, S. Mitrovic, A. Norouzi-Fard, J. Tardos
Published in: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Author(s): Kapralov, Michael; Krauthgamer, Robert; Tardos, Jakab; Yoshida, Yuichi
Published in: Accepted for publication in the 53rd ACM Symposium on the Theory of Computing, 2021

Testing Graph Clusterability: Algorithms and Lower Bounds

Author(s): Chiplunkar, Ashish; Kapralov, Michael; Mousavifar, Aida; Peres, Yuval
Published in: the 59th Annual Symposium on Foundations of Computer Science, 2018

Communication Efficient Coresets for Maximum Matching

Author(s): Michael Kapralov, Gilbert Maystre, Jakab Tardos
Published in: 2021

Spectral Clustering Oracles in Sublinear Time

Author(s): Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler
Published in: 2021

Kernel Density Estimation through Density Constrained Near Neighbor Search

Author(s): Moses Charikar, Michael Kapralov, Navid Nouri, Paris Siminelakis
Published in: accepted to the 58th Annual IEEE Symposium on Foundations of Computer Science, 2021

Dimension-independent Sparse Fourier Transform

Author(s): Michael Kapralov, Ameya Velingker, Amir Zandieh
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 2709-2728
DOI: 10.1137/1.9781611975482.168