Analysis of tree algorithms for the simulation event list

DOI10.1007/BF00290143zbMATH Open0554.68072OpenAlexW2001337228MaRDI QIDQ760216FDOQ760216

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient data structure for the simulation event set
• Self-Optimizing Partitioned Sequencing Sets For Discrete Event Simulation
• Analysis of the Time Indexed List Procedure for Synchronization of Discrete Event Simulations
• A comparison of simulation event list algorithms
• Analysis of an algorithm for priority queue administration
• On the Distribution of Event Times for the notices in a Simulation Event List

Cited In (4)

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

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)