Tiny Suffix Arrays
arXiv:2610.35543v1 Announce Type: cross Abstract: Suffix array and inverse suffix array queries on a text of length $n$ can be answered in $\widetilde{O}(\tau^3)$ time using an auxiliary data structure occupying $O(n/\tau)$ words, for any $\tau \in [1,n]$.
原文：https://www.a8q9.cn/en/article/tiny-suffix-arrays-68604f.html