İleri, A. M., Külekci, M. O., & Xu, B. (2015). A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. Theoretical computer science, 562, 621-633. https://doi.org/10.1016/j.tcs.2014.11.004
Chicago Style (17th ed.) Citationİleri, Atalay Mert, M. Oğuzhan Külekci, and Bojian Xu. "A Simple yet Time-optimal and Linear-space Algorithm for Shortest Unique Substring Queries." Theoretical Computer Science 562 (2015): 621-633. https://doi.org/10.1016/j.tcs.2014.11.004.
MLA (9th ed.) Citationİleri, Atalay Mert, et al. "A Simple yet Time-optimal and Linear-space Algorithm for Shortest Unique Substring Queries." Theoretical Computer Science, vol. 562, 2015, pp. 621-633, https://doi.org/10.1016/j.tcs.2014.11.004.
Warning: These citations may not always be 100% accurate.