Complexity Analyses of Event Set Algorithms

DOI10.1093/comjnl/27.1.72zbMath0526.68042OpenAlexW2046833721MaRDI QIDQ3040523

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

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

Related Items (2)

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

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