by Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
Reference:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries (Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń), In String Processing and Information Retrieval: 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings (Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai, eds.), Springer International Publishing, 2016.
Bibtex Entry:
@inproceedings{Crochemore2016-1,
author="Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Ritu Kundu and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Wale{\'{n}}",
editor="Shunsuke Inenaga
and Kunihiko Sadakane
and Tetsuya Sakai",
title="Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries",
bookTitle="String Processing and Information Retrieval: 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
address="Cham",
pages="22--34",
isbn="978-3-319-46049-9",
doi="10.1007/978-3-319-46049-9_3",
url="http://dx.doi.org/10.1007/978-3-319-46049-9_3"
}