Sublinear Algorithms for Modern Data Analysis

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

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

Author(s): Kapralov, Michael
Published in: 2021
Publisher: SIAM Symposium on Discrete Algorithms

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
Publisher: Advanced in Neural Information and Processing Systems (NeurIPS 2020)

On Constructing Spanners from Random Gaussian Projections

Author(s): Sepehr Assadi, Michael Kapralov, Huacheng Yu
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2023
Publisher: LIPI

The complexity of testing all properties of planar graphs, and the role of isomorphism

Author(s): Sabyasachi Basu, Akash Kumar, C. Seshadhri
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms, 2022
Publisher: SIAM

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes

Author(s): Akash Kumar, C. Seshadhri, Andrew Stolman
Published in: 62nd Annual Symposium on Foundations of Computer Science, 2021
Publisher: IEEE

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Author(s): Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida
Published in: 2021
Publisher: IEEE
DOI: 10.1109/focs52979.2021.00114

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

Author(s): Arnold Filtser, Michael Kapralov, Navid Nouri
Published in: Thirty Second ACM Symposium on Discrete Algorithms, 2021
Publisher: SIAM

Efficient and Local Parallel Random Walks

Author(s): Michael Kapralov, Silvio Lattanzi, Navid Nouri, Jakab Tardos
Published in: 35th Conference on Neural Information Processing Systems, 2021
Publisher: JMLR

Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms

Author(s): Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 2023
Publisher: SIAM

Simulating Random Walks in Random Streams

Author(s): John Kallaugher, Michael Kapralov, Eric Price
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms, 2022
Publisher: SIAM

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

Author(s): Michael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 2023
Publisher: SIAM

Online metric algorithms with untrusted predictions

Author(s): Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand
Published in: 2020
Publisher: Thirty-eighth International Conference on Machine Learning

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, ISBN 978-1-5386-4230-6
Publisher: IEEE
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, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316364

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, ISBN 9781-450367059
Publisher: ACM Press
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
Publisher: 10th Innovations in Theoretical Computer Science Conference (ITCS 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
Publisher: SIAM

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
Publisher: IEEE

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
Publisher: SIAM

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
Publisher: SIAM

Motif Cut Sparsifiers

Author(s): Michael Kapralov, Mikhail Makarov, Sandeep Silwal, Christian Sohler, Jakab Tardos
Published in: 63rd Annual Symposium on Foundations of Computer Science, 2022
Publisher: IEEE

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

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

Noisy Boolean Hidden Matching with Applications

Author(s): Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou
Published in: 2022
Publisher: LIPI

Factorial Lower Bounds for (Almost) Random Order Streams

Author(s): Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price
Published in: 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022
Publisher: IEEE

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
Publisher: IEEE

Expander Decomposition in Dynamic Streams

Author(s): Arnold Filtser, Michael Kapralov, Mikhail Makarov
Published in: 2023
Publisher: LIPI

Communication Efficient Coresets for Maximum Matching

Author(s): Michael Kapralov, Gilbert Maystre, Jakab Tardos
Published in: Symposium on Simplicity in Algorithms, 2021
Publisher: SIAM

Spectral Clustering Oracles in Sublinear Time

Author(s): Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler
Published in: 2021
Publisher: SIAM Symposium on Discrete Algorithms

Kernel Density Estimation through Density Constrained Near Neighbor Search

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

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, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.168

Searching for OpenAIRE data...

Publications

Share this page

Download