Searching for "Concurrent Search and Insertion in 2-3 Trees." – sorted by Relevance.
-
On updating and balancing relaxed balanced search trees in main memory
- and insertions in 2-3 trees and AVL trees. Kung and Lehman [55] studied ordinary binary search trees and proposed
- Cited by 3 (0 self) – Add To MetaCart

