Chromatic binary search trees
Authors:
- 1 August 1996
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 33 (5) , 547-557
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Tree rebalancing in optimal time and spaceCommunications of the ACM, 1986
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Priority Search TreesSIAM Journal on Computing, 1985
- Concurrency control in a dynamic search structureACM Transactions on Database Systems, 1984
- On-the-fly optimization of data structuresCommunications of the ACM, 1983
- Updating a balanced search tree in O(1) rotationsInformation Processing Letters, 1983
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- Quintary treesACM Transactions on Database Systems, 1980
- On-the-fly garbage collectionCommunications of the ACM, 1978
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972