Kociumaka, Tomasz Algorithms and Complexity, MPI for Informatics, Max Planck Society;
arXiv:2106.12725.pdf (Preprint), 2MB
Kempa, D., & Kociumaka, T. (2023). Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 5122-5202). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch187.
