Publisher
Springer Nature Switzerland
Reference14 articles.
1. Bentley, J.L., Saxe, J.B.: Decomposable searching problems I. Static-to-dynamic transformation. J. Algorithms 1(4), 301–358 (1980)
2. Chávez, E., Di Genaro, M.E., Reyes, N.: An efficient dynamic version of the distal spatial approximation trees. In: Actas del XXVIII Congreso Argentino de Ciencias de la Computación (CACIC 2022), pp. 468–477, October 2022
3. Chávez, E., Di Genaro, M.E., Reyes, N., Roggero, P.: Decomposability of disat for index dynamization. J. Comput. Sci. Technol. 110–116 (2017)
4. Chávez, E., Ludeña, V., Reyes, N., Roggero, P.: Faster proximity searching with the distal sat. Inf. Syst. (2016)
5. Chávez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recogn. Lett. 26(9), 1363–1376 (2005)