The efficiency of two indexed priority queue algorithms

DOI10.1007/BF01930901MaRDI QIDQ4164805zbMATH OpenFDO

Authors Olli S. Nevalainen, Jukka Teuhola

Publication date 1978

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01930901

Mathematics Subject Classification ID

Trees (05C05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Cites work

• A comparison of simulation event list algorithms
• An efficient data structure for the simulation event set
• Analysis of an algorithm for priority queue administration
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3488590 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Improved event-scanning mechanisms for discrete event simulation
• Priority queue administration by sublist index
• Priority queues with update and finding minimum spanning trees
• The efficiency of two indexed priority queue algorithms

Cited in

(1)

• The efficiency of two indexed priority queue algorithms

This page was built for publication: The efficiency of two indexed priority queue algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4164805)