1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2019
Space Efficient Construction of Lyndon Arrays in Linear Time
Philip Bille, Jonas Ellert, Johannes Fischer +4
We present the first linear time algorithm to construct the -bit version of the Lyndon array for a string of length using only bits of working space. A simpler varia…
cs.DS2015★ 1 cited
Dynamic Data Structures for Document Collections and Graphs
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
In the dynamic indexing problem, we must maintain a changing collection of text documents so that we can efficiently support insertions, deletions, and pattern matching queries. We…