Exponentially decreasing number of operations in balanced trees

DOI10.1007/3-540-45446-2_19MaRDI QIDQ4448372zbMATH OpenFDO

Authors Lars Jacobsen, Kim S. Larsen

Publication date 18 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2202/22020293.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Exponentially decreasing number of operations in balanced trees
• On a recursion connected with tree balancing algorithms
• Balanced trees with removals: An exercise in rewriting and proof
• Reductions in binary search trees
• scientific article; zbMATH DE number 844505
• Complexity of layered binary search trees with relaxed balance
• Bounds on the Balaban index of trees
• Balancing binary trees by internal path reduction
• scientific article; zbMATH DE number 637311
• Complexity of algorithm and operations on trees

Cited in

(2)

• Balanced trees with removals: An exercise in rewriting and proof
• Exponentially decreasing number of operations in balanced trees

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

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