Compressed Range Minimum Queries
Publisher
Springer New York
Reference25 articles.
1. Amir A, Fischer J, Lewenstein M (2007) Two-dimensional range minimum queries. In: Proceedings of the CPM, London, LNCS, vol 4580. Springer, pp 286–294
2. Barbay J, Fischer J, Navarro G (2012) LRM-trees: compressed indices, adaptive sorting, and compressed permutation. Theor Comput Sci 459:26–41
3. Brodal GS, Davoodi P, Lewenstein M, Raman R, Rao SS (2012) Two dimensional range minimum queries and Fibonacci lattices. In: Proceedings of the ESA, Ljubljana, LNCS, vol 7501. Springer, pp 217–228
4. Brodal GS, Davoodi P, Rao SS (2012) On space efficient two dimensional range minimum data structures. Algorithmica 63(4):815–830
5. Brodal GS, Brodnik A, Davoodi P (2013) The encoding complexity of two dimensional range minimum data structures. In: Proceedings of the ESA, Sophia Antipolis, LNCS, vol 8125. Springer, pp 229–240