18 citations · 79 across the 27 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015
Breaking the Variance: Approximating the Hamming Distance in Time Per Alignment
Tsvi Kopelowitz, Ely Porat
The algorithmic tasks of computing the Hamming distance between a given pattern of length and each location in a text of length is one of the most fundamental algorithmic t…
cs.DS2015★ 7 cited
Faster Worst Case Deterministic Dynamic Connectivity
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie +1
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time and constant…
cs.DS2015
Mind the Gap
Amihood Amir, Tsvi Kopelowitz, Avivit Levy +3
We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess a dictionary of patterns, where each pattern cont…