Deques with heap order
- 17 April 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 22 (4) , 197-200
- https://doi.org/10.1016/0020-0190(86)90028-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Optimal pagination of B-trees with variable-length itemsCommunications of the ACM, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Real-time queue operations in pure LISPInformation Processing Letters, 1981
- New Real-Time Simulations of Multihead Tape UnitsJournal of the ACM, 1981
- Pagination of B*-trees with variable-length recordsCommunications of the ACM, 1977
- Real-Time Simulation of Multihead Tape UnitsJournal of the ACM, 1972