Sublinear Algorithms for Modern Data Analysis

Información del proyecto

SUBLINEAR

Identificador del acuerdo de subvención: 759471

DOI

10.3030/759471

Proyecto cerrado

Fecha de la firma de la CE 30 Agosto 2017

Fecha de inicio 1 Marzo 2018

Fecha de finalización 31 Agosto 2023

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 473 175,00

Aportación de la UE

€ 1 473 175,00

Coordinado por

ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE
Switzerland

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Conference proceedings (29)

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

Autores: Kapralov, Michael
Publicado en: 2021
Editor: SIAM Symposium on Discrete Algorithms

Fairness in Streaming Submodular Maximization: Algorithms and Hardness

Autores: Halabi, Marwa El; Mitrović, Slobodan; Norouzi-Fard, Ashkan; Tardos, Jakab; Tarnawski, Jakub
Publicado en: 2019
Editor: Advanced in Neural Information and Processing Systems (NeurIPS 2020)

On Constructing Spanners from Random Gaussian Projections

Autores: Sepehr Assadi, Michael Kapralov, Huacheng Yu
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2023
Editor: LIPI

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

Autores: Sabyasachi Basu, Akash Kumar, C. Seshadhri
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms, 2022
Editor: SIAM

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

Autores: Akash Kumar, C. Seshadhri, Andrew Stolman
Publicado en: 62nd Annual Symposium on Foundations of Computer Science, 2021
Editor: IEEE

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Autores: Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida
Publicado en: 2021
Editor: IEEE
DOI: 10.1109/focs52979.2021.00114

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

Autores: Arnold Filtser, Michael Kapralov, Navid Nouri
Publicado en: Thirty Second ACM Symposium on Discrete Algorithms, 2021
Editor: SIAM

Efficient and Local Parallel Random Walks

Autores: Michael Kapralov, Silvio Lattanzi, Navid Nouri, Jakab Tardos
Publicado en: 35th Conference on Neural Information Processing Systems, 2021
Editor: JMLR

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

Autores: Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
Publicado en: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 2023
Editor: SIAM

Simulating Random Walks in Random Streams

Autores: John Kallaugher, Michael Kapralov, Eric Price
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms, 2022
Editor: SIAM

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

Autores: Michael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth
Publicado en: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 2023
Editor: SIAM

Online metric algorithms with untrusted predictions

Autores: Antoniadis, Antonios; Coester, Christian; Elias, Marek; Polak, Adam; Simon, Bertrand
Publicado en: 2020
Editor: Thirty-eighth International Conference on Machine Learning

The Sketching Complexity of Graph and Hypergraph Counting

Autores: John Kallaugher, Michael Kapralov, Eric Price
Publicado en: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Página(s) 556-567, ISBN 978-1-5386-4230-6
Editor: IEEE
DOI: 10.1109/focs.2018.00059

An optimal space lower bound for approximating MAX-CUT

Autores: Michael Kapralov, Dmitry Krachun
Publicado en: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Página(s) 277-288, ISBN 9781-450367059
Editor: ACM Press
DOI: 10.1145/3313276.3316364

A universal sampling method for reconstructing signals with simple Fourier transforms

Autores: Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh
Publicado en: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Página(s) 1051-1063, ISBN 9781-450367059
Editor: ACM Press
DOI: 10.1145/3313276.3316363

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

Autores: S. Assadi, M. Kapralov, S. Khanna
Publicado en: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019
Editor: 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

Autores: M. Kapralov, A. Mousavifar, C. Musco, C. Musco, N. Nouri, A. Sidford, J. Tardos
Publicado en: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020
Editor: SIAM

Online Matching with General Arrivals

Autores: Gamlath, Buddhima; Kapralov, Michael; Maggiori, Andreas; Svensson, Ola; Wajc, David
Publicado en: IEEE Symposium on Foundations of Computer Science (FOCS 2019), 2019
Editor: IEEE

Oblivious Sketching of High-Degree Polynomial Kernels

Autores: T. D. Ahle, M. Kapralov, J. B. T. Knudsen, R. Pagh, A. Velingker, D. Woodruff and A. Zandieh
Publicado en: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020
Editor: SIAM

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Autores: M. Kapralov, S. Mitrovic, A. Norouzi-Fard, J. Tardos
Publicado en: SIAM Symposium on Discrete Algorithms (SODA 2020), 2020
Editor: SIAM

Motif Cut Sparsifiers

Autores: Michael Kapralov, Mikhail Makarov, Sandeep Silwal, Christian Sohler, Jakab Tardos
Publicado en: 63rd Annual Symposium on Foundations of Computer Science, 2022
Editor: IEEE

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Autores: Kapralov, Michael; Krauthgamer, Robert; Tardos, Jakab; Yoshida, Yuichi
Publicado en: 53rd ACM Symposium on the Theory of Computing, 2021
Editor: ACM

Noisy Boolean Hidden Matching with Applications

Autores: Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou
Publicado en: 2022
Editor: LIPI

Factorial Lower Bounds for (Almost) Random Order Streams

Autores: Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price
Publicado en: 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022
Editor: IEEE

Testing Graph Clusterability: Algorithms and Lower Bounds

Autores: Chiplunkar, Ashish; Kapralov, Michael; Mousavifar, Aida; Peres, Yuval
Publicado en: the 59th Annual Symposium on Foundations of Computer Science, 2018
Editor: IEEE

Expander Decomposition in Dynamic Streams

Autores: Arnold Filtser, Michael Kapralov, Mikhail Makarov
Publicado en: 2023
Editor: LIPI

Communication Efficient Coresets for Maximum Matching

Autores: Michael Kapralov, Gilbert Maystre, Jakab Tardos
Publicado en: Symposium on Simplicity in Algorithms, 2021
Editor: SIAM

Spectral Clustering Oracles in Sublinear Time

Autores: Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler
Publicado en: 2021
Editor: SIAM Symposium on Discrete Algorithms

Kernel Density Estimation through Density Constrained Near Neighbor Search

Autores: Moses Charikar, Michael Kapralov, Navid Nouri, Paris Siminelakis
Publicado en: 58th Annual IEEE Symposium on Foundations of Computer Science, 2021
Editor: IEEE

Book chapters (1)

Dimension-independent Sparse Fourier Transform

Autores: Michael Kapralov, Ameya Velingker, Amir Zandieh
Publicado en: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Página(s) 2709-2728, ISBN 978-1-61197-548-2
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.168