Alzamel, M., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Radoszewski, J., Rytter, W., . . . Zuba, W. (2026). Quasi-linear-time algorithm for a longest common circular factor. Theoretical Computer Science, 1075, N.PAG. https://doi.org/10.1016/j.tcs.2026.115955
Παραπομπή σε μορφή Chicago (17η εκδ.)Alzamel, Mai, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, και Wiktor Zuba. "Quasi-linear-time Algorithm for a Longest Common Circular Factor." Theoretical Computer Science 1075 (2026): N.PAG. https://doi.org/10.1016/j.tcs.2026.115955.
Παραπομπή σε μορφή MLA (9th εκδ.)Alzamel, Mai, et al. "Quasi-linear-time Algorithm for a Longest Common Circular Factor." Theoretical Computer Science, vol. 1075, 2026, p. N.PAG, https://doi.org/10.1016/j.tcs.2026.115955.