scientific article; zbMATH DE number 5046289

MaRDI QIDQ5482923zbMATH OpenFDO

Authors Timo Lilja

Publication date 15 August 2006

zbMATH Keywords

amortized analysis\(B\)-trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?
• Balance in AVL trees and space cost of brother trees
• scientific article; zbMATH DE number 1754613
• A linear time algorithm for balance vertices on trees
• scientific article; zbMATH DE number 2044506
• Expected Costs in Some Classes of Binary Search Trees
• A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES
• On a recursion connected with tree balancing algorithms
• scientific article; zbMATH DE number 3868632

Cited in

(6)

• Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
• Exponentially decreasing number of operations in balanced trees
• A balanced search tree O(1) worst-case update time
• Cost allocation in asymmetric trees
• On the existence and construction of non-extreme \((a,b)\)-trees.
• scientific article; zbMATH DE number 3856424 (Why is no real title available?)

This page was built for publication:

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