Dynamic weighted binary search trees

DOI10.1007/BF00289093MaRDI QIDQ1253546zbMATH OpenOpenAlexFDO

Authors Karl Unterauer

Publication date 1979

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289093

zbMATH Keywords

Dynamic Weighted Binary Search Trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3497359 (Why is no real title available?)
• scientific article; zbMATH DE number 3518272 (Why is no real title available?)
• scientific article; zbMATH DE number 3551888 (Why is no real title available?)
• scientific article; zbMATH DE number 3607502 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Binary Search Trees of Bounded Balance
• Nearly optimal binary search trees
• Optimum binary search trees
• Symmetric binary B-trees: Data structure and maintenance algorithms

Cited in

(2)

• scientific article; zbMATH DE number 3733237 (Why is no real title available?)
• Optimal binary search trees

This page was built for publication: Dynamic weighted binary search trees

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