Author:
Manolopoulos Yannis,Theodoridis Yannis,Tsotras Vassilis J.
Reference29 articles.
1. Arge, L. and Vitter, J.S. (1996). Optimal Dynamic Interval Management in External Memory. In Proceedings of the 37 th IEEE Symposium on Foundations of Computer Science, pages 560–569.
2. Blankenagel, G. and Gueting, R.H. (1990). XP-trees: External Priority Search Trees. Technical Report, Informatik-Bericht No.92, Fern Universitaet Hagen.
3. Blankenagel, G. and Gueting, R.H. (1994). External Segment Trees. Algorithmica, 12(6):498–532.
4. Becker, B., Gschwind, S., Ohler, T., Seeger, B., and Widmayer, P. (1996). An Asymptotically Optimal Multiversion B-tree. The VLDB Journal, 5(4):264–275.
5. Bentley, J.L. (1977). Algorithms for Klee’s Rectangle Problems. Computer Science Department, Carnegie-Mellon University, Pittsburgh.