AVL trees with relaxed balance
From MaRDI portal
Publication:5929917
DOI10.1006/JCSS.2000.1705zbMath0970.68122OpenAlexW1966797788MaRDI QIDQ5929917
Publication date: 17 April 2001
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2000.1705
Related Items (2)
Amortization results for chromatic search trees, with an application to priority queues ⋮ Relaxed multi-way trees with group updates.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxed balance for search trees with local rebalancing
- Amortized constant relaxed rebalancing using standard rotations
- A new data structure for representing sorted lists
- Efficient rebalancing of chromatic search trees
- Amortization results for chromatic search trees, with an application to priority queues
- Chromatic binary search trees: A structure for concurrent rebalancing
- Organization and maintenance of large ordered indexes
- Relaxed avl trees, main-memory databases and concurrency
- On-the-fly optimization of data structures
- An Amortized Analysis of Insertions into AVL-Trees
- Amortized Computational Complexity
- EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
- Efficient rebalancing of chromatic search trees
- Amortization results for chromatic search trees, with an application to priority queues
- Relaxed balance using standard rotations
This page was built for publication: AVL trees with relaxed balance
