13 citations · 23 across the 10 of their papers we have counts for
Showing 2012 · cs.DSShow all
3 papers · 2 filters
cs.DS2012★ 1 cited
Faster Clustering via Preprocessing
Tsvi Kopelowitz, Robert Krauthgamer
We examine the efficiency of clustering a set of points, when the encompassing metric space may be preprocessed in advance. In computational problems of this genre, there is a firs…
cs.DS2012★ 4 cited
On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
Tsvi Kopelowitz
The problem of Text Indexing is a fundamental algorithmic problem in which one wishes to preprocess a text in order to quickly locate pattern queries within the text. In the ever e…
cs.DS2012
Sparse Suffix Tree Construction with Small Space
Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz +2
We consider the problem of constructing a sparse suffix tree (or suffix array) for suffixes of a given text of size , using only words of space during constructio…