Analysis of an algorithm for priority queue administration

DOI10.1007/BF01931680MaRDI QIDQ4088269zbMATH OpenFDO

Authors Arne T. Jonassen, Ole-Johan Dahl

Publication date 1975

Published in BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3523110 (Why is no real title available?)
• A comparison of simulation event list algorithms
• Analysis of an algorithm for priority queue administration

Cited in

(7)

• A priority queue in which initialization and queue operations takeO(loglogD) time
• Analysis of tree algorithms for the simulation event list
• 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
• The amortized complexity of Henriksen's algorithm

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

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