Amortization results for chromatic search trees, with an application to priority queues
From MaRDI portal
(Redirected from Publication:1384535)
Recommendations
Cites work
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- A New Method for Concurrency in B-Trees
- A new data structure for representing sorted lists
- AVL trees with relaxed balance
- Amortization results for chromatic search trees, with an application to priority queues
- B-trees in a system with multiple users
- Chromatic binary search trees: A structure for concurrent rebalancing
- Concurrent access of priority queues
- Concurrent manipulation of binary search trees
- Concurrent operations on \(B^ *\)-trees with overtaking
- EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
- Efficient locking for concurrent operations on B-trees
- Efficient rebalancing of chromatic search trees
- On-the-fly optimization of data structures
- Organization and maintenance of large ordered indexes
- Relaxed avl trees, main-memory databases and concurrency
- Scheduling multithreaded computations by work stealing
- Symmetric binary B-trees: Data structure and maintenance algorithms
Cited in
(10)- Amortization results for chromatic search trees, with an application to priority queues
- Relaxed balance through standard rotations
- Efficient rebalancing of chromatic search trees
- scientific article; zbMATH DE number 7561436 (Why is no real title available?)
- Amortization results for chromatic search trees, with an application to priority queues
- Relaxed multi-way trees with group updates.
- Chromatic binary search trees: A structure for concurrent rebalancing
- Variants of \((a,b)\)-trees with relaxed balance
- AVL trees with relaxed balance
- The amortized analysis of a non-blocking chromatic tree
This page was built for publication: Amortization results for chromatic search trees, with an application to priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384535)
