Design and Analysis of a Data Structure for Representing Sorted Lists
- 1 August 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (3), 594-614
- https://doi.org/10.1137/0209045
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A Fast Merging AlgorithmJournal of the ACM, 1979
- On random 2?3 treesActa Informatica, 1978
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972