Exponentially decreasing number of operations in balanced trees

DOI10.1007/s00236-005-0173-3zbMath1079.68025OpenAlexW2163978343MaRDI QIDQ2576662

Kim S. Larsen, Lars Jacobsen

Publication date: 14 December 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0173-3

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Making data structures persistent
• A new data structure for representing sorted lists
• Relaxed multi-way trees with group updates.
• On the existence and construction of non-extreme \((a,b)\)-trees.
• An Amortized Analysis of Insertions into AVL-Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exponentially decreasing number of operations in balanced trees