Showing 2022Show all
2 papers · 1 filter
cs.DS2022
The Complexity of the Co-Occurrence Problem
Philip Bille, Inge Li Gørtz, Tord Stordalen
Let be a string of length over an alphabet and let be a subset of of size . The 'co-occurrence problem' is to construct a compact data structure that…
cs.DS2022
Predecessor on the Ultra-Wide Word RAM
Philip Bille, Inge Li Gørtz, Tord Stordalen
We consider the predecessor problem on the ultra-wide word RAM model of computation, which extends the word RAM model with 'ultrawords' consisting of bits [TAMC, 2015]. The m…