On implicit data structures for priority queues
- 1 January 1985
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 15 (1) , 55-57
- https://doi.org/10.1002/spe.4380150105
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Analysis of future event set algorithms for discrete event simulationCommunications of the ACM, 1981
- Implicit data structures for fast search and updateJournal of Computer and System Sciences, 1980
- A More Portable Fortran Random Number GeneratorACM Transactions on Mathematical Software, 1979