Making data structures persistent
- 1 February 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 38 (1), 86-124
- https://doi.org/10.1016/0022-0000(89)90034-2
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Searching and storing similar listsJournal of Algorithms, 1986
- An applicative random-access stackInformation Processing Letters, 1983
- Incremental Context-Dependent Analysis for Language-Based EditorsACM Transactions on Programming Languages and Systems, 1983
- Updating a balanced search tree in O(1) rotationsInformation Processing Letters, 1983
- Real-time queue operations in pure LISPInformation Processing Letters, 1981
- Hysterical B-treesInformation Processing Letters, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- On the average number of rebalancing operations in weight-balanced treesTheoretical Computer Science, 1980