Author:
Moro Mirella M.,Tsotras Vassilis J.
Reference13 articles.
1. Arge L, Vitter JS. Optimal dynamic interval management in external memory. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science; 1996. p. 560–69.
2. Blankenagel G, Gueting RH. External segment trees. Algorithmica. 1994;12(6):498–532.
3. Bliujute R, Jensen CS, Saltenis S, Slivinskas G. R-tree based indexing of now-relative bi-temporal data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 345–56.
4. Chiang Y-J, Silva CT. External memory techniques for isosurface extraction in scientific visualization, external memory algorithms and visualization. In: Abello J, Vitter JS, editors. DIMACS series in discrete mathematics and theoretical computer science, vol. 50. AMS; Providence, RI. 1999. p. 247–77
5. Icking C, Klein R, Ottmann T. Priority search trees in secondary memory. In: Proceedings of the International Workshop on Graph Theoretic Concepts in Computer Science; 1988. p. 84–93