Fully persistent arrays
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Dynamic perfect hashing: upper and lower boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Two algorithms for maintaining order in a listPublished by Association for Computing Machinery (ACM) ,1987
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Making data structures persistentPublished by Association for Computing Machinery (ACM) ,1986
- Maintaining order in a generalized linked listActa Informatica, 1984
- Maintaining order in a linked listPublished by Association for Computing Machinery (ACM) ,1982
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Faster retrieval from context treesCommunications of the ACM, 1976
- Retrieval from context treesInformation Processing Letters, 1975