Segmented Iterators and Hierarchical Algorithms | Zendy

Matthew H. Austern | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Segmented Iterators and Hierarchical Algorithms

Author(s) -

Matthew H. Austern

Publication year - 2000

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-41090-2

DOI - 10.1007/3-540-39953-4_7

Subject(s) - computer science , exploit , abstraction , segmentation , data structure , feature (linguistics) , range (aeronautics) , algorithm , theoretical computer science , artificial intelligence , programming language , engineering , philosophy , linguistics , computer security , epistemology , aerospace engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research