Concurrent Search and Insertion in AVL Trees
From MaRDI portal
Publication:3883523
DOI10.1109/TC.1980.1675680zbMath0441.68071OpenAlexW1986878949MaRDI QIDQ3883523
Publication date: 1980
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1980.1675680
Related Items
Concurrent manipulation of expanded AVL trees ⋮ Relaxed avl trees, main-memory databases and concurrency ⋮ Compact and localized distributed data structures ⋮ A multiple-heaps algorithm for parallel simulation of collision systems ⋮ Parallel heap: an optimal parallel priority queue ⋮ Operation-specific locking in balanced structures ⋮ Embedding height balanced trees and Fibonacci trees in hypercubes ⋮ Public data structures: counters as a special case.