Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Agarwal PK, de Berg M, Gudmundsson J, Hammar M, Haverkort HJ (2002) Box-trees and R-trees with near-optimal query time. Discret Comput Geom 28:291–312
2. Aggarwal A, Vitter JS (1988) The Input/Output complexity of sorting and related problems. Commun ACM 31:1116–1127
3. Arge L, de Berg M, Haverkort HJ, Yi K (2004) The priority R-tree: a practically efficient and worst-case optimal R-tree. In: Proceedings of the SIGMOD international conference on management of data, pp 347–358
4. Arge L, Samoladas V, Vitter JS (1999) On two-dimensional indexability and optimal range search indexing. In: Proceedings of the ACM symposium on principles of database systems, pp 346–357
5. Arge L, Samoladas V, Yi K (2004) Optimal external memory planar point enclosure. In: Proceedings of the European symposium on algorithms