13 citations · 23 across the 9 of their papers we have counts for
17 papers · 1 filter
Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
Noam Horowicz, Tsvi Kopelowitz
In the snippets problem, the goal is to preprocess text so that given two patterns and , one can locate the occurrences of the two patterns in that are closest t…
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
Tsvi Kopelowitz, Ariel Korin, Liam Roditty
For an undirected unweighted graph G = (V, E) with n vertices and m edges, let d(u, v) denote the distance from u in V to v in V in G. An (alpha, beta)-stretch approximate distance…
Incremental Edge Orientation in Forests
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul +2
For any forest it is possible to orient the edges so that no vertex in has out-degree greater than . This paper considers the incremental edge-orientation p…
Support Optimality and Adaptive Cuckoo Filters
Tsvi Kopelowitz, Samuel McCauley, Ely Porat
Filters (such as Bloom Filters) are data structures that speed up network routing and measurement operations by storing a compressed representation of a set. Filters are space effi…
Improved Circular -Mismatch Sketches
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz +2
The shift distance between two strings and of the same length is defined as the minimum Hamming distance between and any rotation (cyclic s…
Contention Resolution Without Collision Detection
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul +1
This paper focuses on the contention resolution problem on a shared communication channel that does not support collision detection. A shared communication channel is a multiple ac…