Sorting jordan sequences in linear time using level-linked search trees
- 1 January 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 68 (1-3) , 170-184
- https://doi.org/10.1016/s0019-9958(86)80033-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Self-adjusting binary search treesJournal of the ACM, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- A new data structure for representing sorted listsActa Informatica, 1982
- Hysterical B-treesInformation Processing Letters, 1981
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- Nearly optimal binary search treesActa Informatica, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Organization and maintenance of large ordered indexesActa Informatica, 1972