29 citations · 45 across the 41 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Size-constrained Weighted Ancestors with Applications
Philip Bille, Yakov Nekrich, Solon P. Pissis
The weighted ancestor problem on a rooted node-weighted tree is a generalization of the classic predecessor problem: construct a data structure for a set of integers that suppo…
cs.DS2023
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis +1
Sparse suffix sorting is the problem of sorting suffixes of a string of length . Efficient sparse suffix sorting algorithms have existed for more than a decade. Despite…