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

von Kapralov, Michael
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)

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

von Filtser, Arnold
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)

Communication Efficient Coresets for Maximum Matching

von Kapralov, Michael
Veröffentlicht in SIAM Symposium on Simplicity in Algorithms (4. : 2021 : Online) Fourth Symposium on Simplicity in Algorithms (SOSA 2021) (2021)

Simulating Random Walks in Random Streams

von Kallaugher, John
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 5 of 5 (2022)

Efficient and Local Parallel Random Walks

von Kapralov, Michael
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 26 of 36 (2022)

Learning Hierarchical Cluster Structure of Graphs in Sublinear Time

von Kapralov, Michael
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 2 of 7 (2023)

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

von Kapralov, Michael
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 6 of 7 (2023)

Spectral Clustering Oracles in Sublinear Time

von Gluch, Grzegorz
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)

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

von Bringmann, Karl
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 7 of 7 (2023)