APA (7th ed.) Citation

Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Kundu, R., Pissis, S. P., Radoszewski, J., . . . Waleń, T. (2016). Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. String Processing and Information Retrieval, 9954, 22-34. https://doi.org/10.1007/978-3-319-46049-9_3

Chicago Style (17th ed.) Citation

Crochemore, Maxime, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz Waleń. "Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries." String Processing and Information Retrieval 9954 (2016): 22-34. https://doi.org/10.1007/978-3-319-46049-9_3.

MLA (9th ed.) Citation

Crochemore, Maxime, et al. "Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries." String Processing and Information Retrieval, vol. 9954, 2016, pp. 22-34, https://doi.org/10.1007/978-3-319-46049-9_3.