scientific article; zbMATH DE number 3551889
From MaRDI portal
Publication:4125767
Cited in
(10)- The CB tree: a practical concurrent self-adjusting search tree
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Bounds on the weighted path length of binary trees
- Ready, set, verify! Applying hs-to-coq to real-world Haskell code
- Towards optimal range medians
- Online list labeling: breaking the ^2n barrier
- Tight approximation bounds on a simple algorithm for minimum average search time in trees
- Grandchildren-weight-balanced binary search trees
- Efficient top-down updates in AVL trees
- Weight-Balanced Trees
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 Q4125767)