19 citations · 19 across the 3 of their papers we have counts for
3 papers
cs.DS2011
Combined Data Structure for Previous- and Next-Smaller-Values
Johannes Fischer
Let be a static array storing elements from a totally ordered set. We present a data structure of optimal size at most bits that allows us to an…
cs.DS2011★ 19 cited
Inducing the LCP-Array
Johannes Fischer
We show how to modify the linear-time construction algorithm for suffix arrays based on induced sorting (Nong et al., DCC'09) such that it computes the array of longest common pref…
cs.DS2010
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Jérémy Barbay, Johannes Fischer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev…