AVL-trees for localized search

DOI10.1016/S0019-9958(85)80034-6MaRDI QIDQ3716309zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Athanasios K. Tsakalidis

Publication date 1985

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(85)80034-6

zbMATH Keywords

data structuredeletioninsertionsearchable priority queues

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 3883620
• scientific article; zbMATH DE number 1303596
• Height balance distribution of search trees
• scientific article; zbMATH DE number 2105039
• scientific article; zbMATH DE number 2079361

Cited in

(11)

• Making data structures persistent
• A constant update time finger search tree
• Fully persistent B-trees
• scientific article; zbMATH DE number 3883620 (Why is no real title available?)
• Some Results for Elementary Operations
• scientific article; zbMATH DE number 562725 (Why is no real title available?)
• scientific article; zbMATH DE number 2079361 (Why is no real title available?)
• Fully persistent B-trees
• Optimal finger search trees in the pointer machine
• Dynamic convex hulls for simple paths
• Dynamic convex hulls for simple paths

This page was built for publication: AVL-trees for localized search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716309)