The amortized complexity of Henriksen's algorithm

DOI10.1007/BF01933741zbMath0591.68089OpenAlexW1969326561MaRDI QIDQ1075062

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

priority queueamortized complexitydiscrete event simulationsevent list

Mathematics Subject Classification ID

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

Related Items (1)

Splay trees as priority queues

Cites Work

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

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