18 citations · 79 across the 27 of their papers we have counts for
35 papers
Contention Resolution, With and Without a Global Clock
Zixi Cai, Kuowen Chen, Shengquan Du +3
In the Contention Resolution problem parties each wish to have exclusive use of a shared resource for one unit of time. The problem has been studied since the early 1970s, unde…
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…
An Improved Algorithm for The -Dyck Edit Distance Problem
Dvir Fried, Shay Golan, Tomasz Kociumaka +3
A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses is the smallest…
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…