Complexity Analyses of Event Set Algorithms

DOI10.1093/COMJNL/27.1.72MaRDI QIDQ3040523zbMATH OpenOpenAlexFDO

Authors C. M. Reeves

Publication date 1984

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/27.1.72

zbMATH Keywords

discrete event simulationevent scheduling algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• P-tree structures and event horizon: efficient event-set implementations
• An application of program unification to priority queue vectorization

This page was built for publication: Complexity Analyses of Event Set Algorithms

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