R. Grossi and G. Italiano. Efficient techniques for maintaining multidimensional keys in linked data structures. In Proc. of the 26th International Colloquium (ICALP-99), LNCS. Springer, 1999. To appear. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Digital Access to Comparison-Based Tree Data - Structures And Algorithms (Correct)
....which captures the best properties of the classic counterpart. Another interesting data structure with connections to our work is the string B tree [3] a combination of suffix array and B tree, the popular external memory data structure. Finally, our results have some similarities with those in [5], though both papers are independent. There, the authors provide a general framework to combine string techniques with a variety of linked data structures. By contrast, the emphasis of our paper is set on search trees and sorting (quicksort and mergesort) The next sections are organised as ....
R. Grossi and G. Italiano. Efficient techniques for maintaining multidimensional keys in linked data structures. In Proc. of the 26th International Colloquium (ICALP-99), LNCS. Springer, 1999. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC