Joong Chae Na. Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. In Alberto Apostolico, Maxime Crochemore, Kunsoo Park, editors, Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Volume 3537 of Lecture Notes in Computer Science, pages 57-67, Springer, 2005. [doi]
@inproceedings{Na05,
title = {Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets},
author = {Joong Chae Na},
year = {2005},
doi = {10.1007/11496656_6},
url = {http://dx.doi.org/10.1007/11496656_6},
researchr = {https://researchr.org/publication/Na05},
cites = {0},
citedby = {0},
pages = {57-67},
booktitle = {Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings},
editor = {Alberto Apostolico and Maxime Crochemore and Kunsoo Park},
volume = {3537},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-26201-6},
}