APA (7th ed.) Citation

Abedin, P., Ganguly, A., Pissis, S. P., & Thankachan, S. V. (2020). Efficient Data Structures for Range Shortest Unique Substring Queries. Algorithms, 13(11), 276. https://doi.org/10.3390/a13110276

Chicago Style (17th ed.) Citation

Abedin, Paniz, Arnab Ganguly, Solon P. Pissis, and Sharma V. Thankachan. "Efficient Data Structures for Range Shortest Unique Substring Queries." Algorithms 13, no. 11 (2020): 276. https://doi.org/10.3390/a13110276.

MLA (9th ed.) Citation

Abedin, Paniz, et al. "Efficient Data Structures for Range Shortest Unique Substring Queries." Algorithms, vol. 13, no. 11, 2020, p. 276, https://doi.org/10.3390/a13110276.