English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays

MPS-Authors
/persons/resource/persons284929

Kociumaka,  Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:2106.12725.pdf
(Preprint), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: https://hdl.handle.net/21.11116/0000-000C-158F-C
Abstract
There is no abstract available