Fast updating of well-balanced trees

DOI10.1007/3-540-52846-6_82zbMath1502.68080OpenAlexW1543430906MaRDI QIDQ5056096

No author found.

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_82

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (4)

Binary search trees: How low can you go? ⋮ A tight lower bound for on-line monotonic list labeling ⋮ Minimal on-line labelling ⋮ Canonical density control

Cites Work

• Symmetric binary B-trees: Data structure and maintenance algorithms
• Locally balanced binary trees
• Updating approximately complete trees
• Binary Search Trees of Bounded Balance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast updating of well-balanced trees