A concurrent search structure
References (16)
- et al.
The balanced cube: A concurrent data structure
Concurrent search and insertion in AVL trees
IEEE Trans. Comput.
(Sept. 1980)Concurrent search and insertion in 2–3 trees
Acta Inform.
(1980)Extendible hashing for concurrent operations and distributed data
Concurrency and linear hashing
- et al.
Extendible hashing—A fast access method for dynamic files
ACM Trans. Database Systems
(Sept. 1979) - et al.
Design to minimize diameter on building-block network
IEEE Trans. Comput.
(June 1981) - et al.
Concurrent manipulation of binary search trees
ACM Trans. Database Systems
(Sept. 1980)
There are more references available in the full text version of this article.
Cited by (0)
- ∗
The author thanks Udi Manber for the original problem and many helpful discussions.
Copyright © 1989 Published by Elsevier Inc.