1. Abedin, P., et al.: A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822, 15–22 (2020)
2. Abedin, P., Ganguly, A., Pissis, S.P., Thankachan, S.V.: Efficient data structures for range shortest unique substring queries. Algorithms 13(11), 1–9 (2020)
3. Agarwal, P.K.: Range Searching. In: Handbook of Discrete and Computational Geometry, pp. 1057–1092. Chapman and Hall/CRC, Boca Raton (2017)
4. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, p. 198. IEEE Computer Society (2000)
5. Amir, A., Apostolico, A., Landau, G.M., Levy, A., Lewenstein, M., Porat, E.: Range LCP. J. Comput. Syst. Sci. 80(7), 1245–1253 (2014)