Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kapralov, Michael
127  Ergebnisse:
Personensuche X
?
1

Representing and Recovering Structured High-Dimensional Dat..:

Bamberger, Stefan Julian Bernhard , 2023
Link: http://nbn-resolving.de/..
 
?
2

Practice of Streaming Processing of Dynamic Graphs: Concept..:

Besta, Maciej ; Fischer, Marc ; Kalavri, Vasiliki..
IEEE Transactions on Parallel and Distributed Systems.  34 (2023)  6 - p. 1860-1876 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Spectral Hypergraph Sparsifiers of Nearly Linear Size:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Kapralov, Michael ; Krauthgamer, Robert ; Tardos, Jakab. - p. 1159-1170 , 2022
Link: https://doi.org/10.1109/..
 
?
4

Factorial Lower Bounds for (Almost) Random Order Streams:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Chiplunkar, Ashish ; Kallaugher, John ; Kapralov, Michael. - p. 486-497 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Motif Cut Sparsifiers:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Kapralov, Michael ; Makarov, Mikhail ; Silwal, Sandeep.. - p. 389-398 , 2022
Link: https://doi.org/10.1109/..
 
?
6

Space Lower Bounds for Approximating Maximum Matching in th..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Kapralov, Michael - p. 1874-1893 , 2021
Link: https://doi.org/10.1137/..
 
?
7

Spectral clustering oracles in sublinear time:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Gluch, Grzegorz ; Kapralov, Michael ; Lattanzi, Silvio.. - p. 1598-1617 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Graph Spanners by Sketching in Dynamic Streams and the Simu..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Filtser, Arnold ; Kapralov, Michael ; Nouri, Navid - p. 1894-1913 , 2021
Link: https://doi.org/10.1137/..
 
?
9

Graph spanners by sketching in dynamic streams and the simu..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Filtser, Arnold ; Kapralov, Michael ; Nouri, Navid - p. 1894-1913 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Towards tight bounds for spectral sparsification of hypergr..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Kapralov, Michael ; Krauthgamer, Robert ; Tardos, Jakab. - p. 598-611 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Spectral Clustering Oracles in Sublinear Time:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Gluch, Grzegorz ; Kapralov, Michael ; Lattanzi, Silvio.. - p. 1598-1617 , 2021
Link: https://doi.org/10.1137/..
 
?
12

Space lower bounds for approximating maximum matching in th..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Kapralov, Michael - p. 1874-1893 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Kernel Density Estimation through Density Constrained Near ..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Charikar, Moses ; Kapralov, Michael ; Nouri, Navid. - p. 172-183 , 2020
Link: https://doi.org/10.1109/..
 
?
14

Oblivious sketching of high-degree polynomial kernels:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Ahle, Thomas D. ; Kapralov, Michael ; Knudsen, Jakob B. T.... - p. 141-160 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Fast and space efficient spectral sparsification in dynamic..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Kapralov, Michael ; Mousavifar, Aida ; Musco, Cameron... - p. 1814-1833 , 2020
Link: https://dl.acm.org/doi/1..
 
1-15