Artigos com autorizações de acesso público - Robert KrauthgamerSaiba mais
45 artigos disponíveis publicamente
Vertex sparsifiers: New results from old techniques
M Englert, A Gupta, R Krauthgamer, H Racke, I Talgam-Cohen, K Talwar
SIAM Journal on Computing 43 (4), 1239-1262, 2014
Autorizações: UK Engineering and Physical Sciences Research Council
On sketching quadratic forms
A Andoni, J Chen, R Krauthgamer, B Qin, DP Woodruff, Q Zhang
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
Autorizações: US National Science Foundation, Research Grants Council, Hong Kong
Adaptive metric dimensionality reduction
LA Gottlieb, A Kontorovich, R Krauthgamer
Theoretical Computer Science 620, 105-118, 2016
Autorizações: US National Science Foundation
Coresets for clustering in excluded-minor graphs and beyond
V Braverman, SHC Jiang, R Krauthgamer, X Wu
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Autorizações: US National Science Foundation, US Department of Defense
Refined vertex sparsifiers of planar graphs
R Krauthgamer, HI Rika
SIAM Journal on Discrete Mathematics 34 (1), 101-129, 2020
Autorizações: Federal Ministry of Education and Research, Germany
The power of uniform sampling for coresets
V Braverman, V Cohen-Addad, HCS Jiang, R Krauthgamer, ...
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Autorizações: US Department of Defense, Danish Council for Independent Research, Federal …
Towards tight bounds for spectral sparsification of hypergraphs
M Kapralov, R Krauthgamer, J Tardos, Y Yoshida
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Autorizações: US Department of Defense, European Commission, Federal Ministry of Education …
Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time
A Abboud, R Krauthgamer, J Li, D Panigrahi, T Saranurak, O Trabelsi
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Autorizações: US National Science Foundation, US Department of Defense, Netherlands …
Subcubic algorithms for Gomory–Hu tree in unweighted graphs
A Abboud, R Krauthgamer, O Trabelsi
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Autorizações: US Department of Defense, Federal Ministry of Education and Research, Germany
Coresets for clustering in graphs of bounded treewidth
D Baker, V Braverman, L Huang, SHC Jiang, R Krauthgamer, X Wu
International Conference on Machine Learning, 569-579, 2020
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
Conditional lower bounds for all-pairs max-flow
R Krauthgamer, O Trabelsi
ACM Transactions on Algorithms (TALG) 14 (4), 1-15, 2018
Autorizações: Federal Ministry of Education and Research, Germany
Sublinear algorithms for gap edit distance
E Goldenberg, R Krauthgamer, B Saha
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
Coresets for ordered weighted clustering
V Braverman, SHC Jiang, R Krauthgamer, X Wu
International Conference on Machine Learning, 744-753, 2019
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
Spectral hypergraph sparsifiers of nearly linear size
M Kapralov, R Krauthgamer, J Tardos, Y Yoshida
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Autorizações: US Department of Defense, European Commission, Federal Ministry of Education …
Streaming symmetric norms via measure concentration
J Błasiok, V Braverman, SR Chestnut, R Krauthgamer, LF Yang
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Autorizações: US National Science Foundation, Federal Ministry of Education and Research …
APMF< APSP? Gomory-Hu tree for unweighted graphs in almost-quadratic time
A Abboud, R Krauthgamer, O Trabelsi
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
Matrix norms in data streams: Faster, multi-pass and row-order
V Braverman, S Chestnut, R Krauthgamer, Y Li, D Woodruff, L Yang
International Conference on Machine Learning, 649-658, 2018
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
Flow-cut gaps and face covers in planar graphs
R Krauthgamer, JR Lee, H Rika
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Autorizações: US National Science Foundation
Schatten norms in matrix streams: Hello sparsity, goodbye dimension
V Braverman, R Krauthgamer, A Krishnan, R Sinoff
International Conference on Machine Learning, 1100-1110, 2020
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
Near-optimal entrywise sampling of numerically sparse matrices
V Braverman, R Krauthgamer, AR Krishnan, S Sapir
Conference on Learning Theory, 759-773, 2021
Autorizações: US National Science Foundation, US Department of Defense, Federal Ministry …
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador