18 citations · 79 across the 27 of their papers we have counts for
3 papers · 1 filter
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat +1
In edge orientations, the goal is usually to orient (direct) the edges of an undirected -vertex graph such that all out-degrees are bounded. When the graph is fully dyna…
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix trees and suffix arrays are two of the most widely used data structures for text indexing. Each uses linear space and can be constructed in linear time for polynomially size…
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing
Amihood Amir, Gianni Franceschini, Roberto Grossi +3
This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data…