A new data structure for representing sorted lists
- 1 June 1982
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 17 (2), 157-184
- https://doi.org/10.1007/bf00288968
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- On the average number of rebalancing operations in weight-balanced treesTheoretical Computer Science, 1980
- Sorting presorted filesPublished by Springer Nature ,1979
- A new representation for linear listsPublished by Association for Computing Machinery (ACM) ,1977
- Concurrency of operations on B-treesActa Informatica, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972