No. Title Author Year
1 An Algorithmic Bridge Between Hamming and Levenshtein Distances Goldenberg, Elazar et al. 2023
2 Clustering Permutations: New Techniques with Streaming Applications Chakraborty, Diptarka et al. 2023
3 Lower Bounds for Pseudo-Deterministic Counting in a Stream Braverman, Vladimir et al. 2023
4 Streaming Algorithms for Geometric Steiner Forest Czumaj, Artur et al. 2022
5 Approximate Trace Reconstruction via Median String (In Average-Case) Chakraborty, Diptarka et al. 2021
6 Sketching Graphs and Combinatorial Optimization (Invited Talk) Krauthgamer, Robert 2020
7 Faster Algorithms for All-Pairs Bounded Min-Cuts Abboud, Amir et al. 2019
8 Sketching Graphs and Combinatorial Optimization (Invited Talk) Krauthgamer, Robert 2019
9 The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern Krauthgamer, Robert et al. 2019
10 On Solving Linear Systems in Sublinear Time Andoni, Alexandr et al. 2018
11 Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems Filtser, Arnold et al. 2018
12 Conditional Lower Bounds for All-Pairs Max-Flow Krauthgamer, Robert et al. 2017
13 Color-Distance Oracles and Snippets Kopelowitz, Tsvi et al. 2016
14 Approximate Nearest Neighbor Search in Metrics of Planar Graphs Abraham, Ittai et al. 2015
15 Towards Resistance Sparsifiers Dinitz, Michael et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI