Amortization results for chromatic search trees, with an application to priority queues
From MaRDI portal
Publication:1384535
DOI10.1006/jcss.1997.1511zbMath0897.68034OpenAlexW2055947636MaRDI QIDQ1384535
Rolf Fagerberg, Kim S. Larsen, Joan. Boyar
Publication date: 4 August 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1511
Related Items
Amortization results for chromatic search trees, with an application to priority queues, Relaxed balance through standard rotations, Relaxed multi-way trees with group updates., The amortized analysis of a non-blocking chromatic tree, AVL trees with relaxed balance, Unnamed Item, VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
Uses Software
Cites Work
- Unnamed Item
- Concurrent operations on \(B^ *\)-trees with overtaking
- A new data structure for representing sorted lists
- B-trees in a system with multiple users
- 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
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Relaxed avl trees, main-memory databases and concurrency
- Scheduling multithreaded computations by work stealing
- On-the-fly optimization of data structures
- Concurrent access of priority queues
- Concurrent manipulation of binary search trees
- Efficient locking for concurrent operations on B-trees
- A New Method for Concurrency in B-Trees
- EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
- AVL trees with relaxed balance
