E-LIB Suche - Ergebnisse für: Krauthgamer, Robert

1

Coresets for kernel clustering:

Jiang, Shaofeng H. -C. ; Krauthgamer, Robert ; Lou, Jianing.
Machine Learning. , 2024

Link: https://doi.org/10.1007/..

2

Algorithms for sparse convolution and sublinear edit distan..:

Fischer, Nick , 2023

Link: https://nbn-resolving.de..

3

Labelings vs. Embeddings: On Distributed and Prioritized Re..:

Filtser, Arnold ; Gottlieb, Lee-Ad ; Krauthgamer, Robert
Discrete & Computational Geometry. 71 (2023) 3 - p. 849-871 , 2023

Link: https://doi.org/10.1007/..

4

Comparison of Matrix Norm Sparsification:

Krauthgamer, Robert ; Sapir, Shay
Algorithmica. 85 (2023) 12 - p. 3957-3972 , 2023

Link: https://doi.org/10.1007/..

5

Streaming Euclidean Max-Cut: Dimension vs Data Reduction:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Chen, Xiaoyu ; Jiang, Shaofeng H.-C. ; Krauthgamer, Robert - p. 170-182 , 2023

Link: https://dl.acm.org/doi/1..

6

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad - p. 1135-1146 , 2022

Link: https://doi.org/10.1109/..

7

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/..

8

Faster algorithms for orienteering and k-TSP:

Gottlieb, Lee-Ad ; Krauthgamer, Robert ; Rika, Havana
Theoretical Computer Science. 914 (2022) - p. 73-83 , 2022

Link: https://doi.org/10.1016/..

9

Gap Edit Distance via Non-Adaptive Queries: Simple and Opti..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Goldenberg, Elazar ; Kociumaka, Tomasz ; Krauthgamer, Robert. - p. 674-685 , 2022

Link: https://doi.org/10.1109/..

10

Distributed sparse normal means estimation with sublinear c..:

Amiraz, Chen ; Krauthgamer, Robert ; Nadler, Boaz
Information and Inference: A Journal of the IMA. 11 (2022) 3 - p. 1109-1142 , 2022

Link: https://doi.org/10.1093/..

11

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-H..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Krauthgamer, Robert ; Li, Jason... - p. 884-895 , 2022

Link: https://doi.org/10.1109/..

12

Smoothness of Schatten norms and sliding-window matrix stre..:

Krauthgamer, Robert ; Sapir, Shay
Information Processing Letters. 177 (2022) - p. 106254 , 2022

Link: https://doi.org/10.1016/..

13

Almost-Smooth Histograms and Sliding-Window Graph Algorithm:

Krauthgamer, Robert ; Reitblat, David
Algorithmica. 84 (2022) 10 - p. 2926-2953 , 2022

Link: https://doi.org/10.1007/..

14

Almost-linear ε-emulators for planar graphs:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Chang, Hsien-Chih ; Krauthgamer, Robert ; Tan, Zihan - p. 1311-1324 , 2022

Link: https://dl.acm.org/doi/1..

15

The Power of Uniform Sampling for Coresets:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Braverman, Vladimir ; Cohen-Addad, Vincent ; Jiang, H.-C. Shaofeng... - p. 462-473 , 2022

Link: https://doi.org/10.1109/..