Analysis of an algorithm for priority queue administration

DOI10.1007/BF01931680zbMath0324.68021MaRDI QIDQ4088269

Arne T. Jonassen, Ole-Johan Dahl

Publication date: 1975

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (7)

A path integral approach to data structure evolution ⋮ Analysis of an algorithm for priority queue administration ⋮ P-tree structures and event horizon: efficient event-set implementations ⋮ The efficiency of two indexed priority queue algorithms ⋮ Analysis of tree algorithms for the simulation event list ⋮ A priority queue in which initialization and queue operations takeO(loglogD) time ⋮ The amortized complexity of Henriksen's algorithm

Cites Work

• A comparison of simulation event list algorithms
• Analysis of an algorithm for priority queue administration
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of an algorithm for priority queue administration