Analysis of tree algorithms for the simulation event list

DOI10.1007/BF00290143MaRDI QIDQ760216zbMATHOpenAlexFDO

Authors Jeffrey H. Kingston

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

analysis of algorithmspriority queuebinary search treeaverage- case performancep-tree algorithmssimulation event list

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3168165 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A comparison of simulation event list algorithms
• An efficient data structure for the simulation event set
• Analysis of an algorithm for priority queue administration
• Analysis of the Time Indexed List Procedure for Synchronization of Discrete Event Simulations
• On the Distribution of Event Times for the notices in a Simulation Event List
• Self-Optimizing Partitioned Sequencing Sets For Discrete Event Simulation

Cited in

(4)

• The amortized complexity of Henriksen's algorithm
• Splay trees as priority queues
• Analysis of Henriksen’s Algorithm for the Simulation Event Set
• An application of program unification to priority queue vectorization

This page was built for publication: Analysis of tree algorithms for the simulation event list

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