by Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
Reference:
M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń, "Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries", in String Processing and Information Retrieval: 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings, S. Inenaga, K. Sadakane, T. Sakai, Eds., Cham: Springer International Publishing, pp. 22–34.
Bibtex Entry:
@inproceedings{Crochemore2016,
author="Crochemore, Maxime
and Iliopoulos, Costas S.
and Kociumaka, Tomasz
and Kundu, Ritu
and Pissis, Solon P.
and Radoszewski, Jakub
and Rytter, Wojciech
and Wale{\'{n}}, Tomasz",
editor="Inenaga, Shunsuke
and Sadakane, Kunihiko
and Sakai, Tetsuya",
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"
}