Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unnecessarily inefficient. A new kind of iterator abstraction, in which segmentation is explicit, makes it possible to write hierarchical algorithms that exploit segmentation.
CITATION STYLE
Austern, M. H. (2000). Segmented iterators and hierarchical algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1766, pp. 80–90). Springer Verlag. https://doi.org/10.1007/3-540-39953-4_7
Mendeley helps you to discover research relevant for your work.