The amortized complexity of Henriksen's algorithm

DOI10.1007/BF01933741MaRDI QIDQ1075062zbMATH OpenOpenAlexFDO

Authors Jeffrey H. Kingston

Publication date 1986

Published in BIT (Search for Journal in Brave)

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

zbMATH Keywords

amortized complexitydiscrete event simulationsevent listpriority queue

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• Analysis of Henriksen’s Algorithm for the Simulation Event Set
• Distribution-sensitive binomial queues.
• Refined complexity analysis for heap operations
• Twol-amalgamated priority queues
• scientific article; zbMATH DE number 3868673

Cites work

• Amortized Computational Complexity
• Analysis of an algorithm for priority queue administration
• Analysis of Henriksen’s Algorithm for the Simulation Event Set
• Analysis of tree algorithms for the simulation event list
• Self-Adjusting Heaps

Cited in

(4)

• scientific article; zbMATH DE number 3868673 (Why is no real title available?)
• Splay trees as priority queues
• scientific article; zbMATH DE number 1222814 (Why is no real title available?)
• Ladder queue: an O(1) priority queue structure for large-scale discrete event simulation

This page was built for publication: The amortized complexity of Henriksen's algorithm

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