An efficient data structure for the simulation event set

DOI10.1145/359763.359801MaRDI QIDQ4128001zbMATH OpenOpenAlexFDO

Authors William R. Franta, Kurt Maly

Publication date 1977

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359763.359801

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(5)

• P-tree structures and event horizon: efficient event-set implementations
• Parallelization of an event driven simulator for computer systems simulation
• The efficiency of two indexed priority queue algorithms
• Lattice Monte Carlo simulation of Galilei variant anomalous diffusion
• Analysis of tree algorithms for the simulation event list

This page was built for publication: An efficient data structure for the simulation event set

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