Analysis of Henriksen’s Algorithm for the Simulation Event Set

DOI10.1137/0215062MaRDI QIDQ3745335zbMATH OpenOpenAlexFDO

Authors Jeffrey H. Kingston

Publication date 1986

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0215062

zbMATH Keywords

analysis of algorithmsdiscrete- event simulation systempriority queuesscheduling of events

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3868673
• Analysis of tree algorithms for the simulation event list
• Exact, analytic, and locally approximate solutions to discrete event-simulation problems
• An algorithmic analysis of simulation strategies
• Algorithms for sensitivity information in discrete-event systems simulation
• On constructing optimistic simulation algorithms for the discrete event system specification
• Modeling, simulation, estimation and boundedness analysis of discrete event systems
• scientific article; zbMATH DE number 514139

Cited in

(4)

• The amortized complexity of Henriksen's algorithm
• P-tree structures and event horizon: efficient event-set implementations
• scientific article; zbMATH DE number 3868673 (Why is no real title available?)
• scientific article; zbMATH DE number 3534046 (Why is no real title available?)

This page was built for publication: Analysis of Henriksen’s Algorithm for the Simulation Event Set

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