scientific article; zbMATH DE number 5046289
From MaRDI portal
Publication:5482923
zbMATH Open1107.68127MaRDI QIDQ5482923
Publication date: 15 August 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Cost allocation in asymmetric trees โฎ Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees โฎ A balanced search tree O(1) worst-case update time
Recommendations
- Unnamed Item ๐ ๐
- Unnamed Item ๐ ๐
- Unnamed Item ๐ ๐
- On a recursion connected with tree balancing algorithms ๐ ๐
- Balance in AVL trees and space cost of brother trees ๐ ๐
- A linear time algorithm for balance vertices on trees ๐ ๐
- Expected Costs in Some Classes of Binary Search Trees ๐ ๐
- A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES ๐ ๐
- On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ๐ ๐
This page was built for publication: