scientific article; zbMATH DE number 1008516
From MaRDI portal
Publication:4336276
Recommendations
Cited in
(19)- Concurrent manipulation of expanded AVL trees
- Relaxed multi-way trees with group updates.
- Chromatic binary search trees: A structure for concurrent rebalancing
- The CB tree: a practical concurrent self-adjusting search tree
- Relaxed avl trees, main-memory databases and concurrency
- Deletion without rebalancing in non-blocking binary search trees
- scientific article; zbMATH DE number 3909752 (Why is no real title available?)
- scientific article; zbMATH DE number 1218261 (Why is no real title available?)
- scientific article; zbMATH DE number 2044506 (Why is no real title available?)
- scientific article; zbMATH DE number 1760035 (Why is no real title available?)
- scientific article; zbMATH DE number 1830753 (Why is no real title available?)
- EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
- scientific article; zbMATH DE number 935185 (Why is no real title available?)
- CBTree: a practical concurrent self-adjusting search tree
- Relaxed balance through standard rotations
- AVL trees with relaxed balance
- relaxed balance for search trees with local rebalancing
- Relaxed balance using standard rotations
- Relaxed balance for search trees with local rebalancing
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 Q4336276)
