The efficiency of two indexed priority queue algorithms

DOI10.1007/BF01930901zbMath0384.68032MaRDI QIDQ4164805

Olli S. Nevalainen, Jukka Teuhola

Publication date: 1978

Published in: BIT (Search for Journal in Brave)

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)

Related Items (1)

The efficiency of two indexed priority queue algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Priority queues with update and finding minimum spanning trees
• Priority queue administration by sublist index
• A comparison of simulation event list algorithms
• Improved event-scanning mechanisms for discrete event simulation
• Analysis of an algorithm for priority queue administration
• An efficient data structure for the simulation event set
• The efficiency of two indexed priority queue algorithms

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