P-tree structures and event horizon: efficient event-set implementations
From MaRDI portal
Publication:2508375
DOI10.1007/s11390-006-0019-7zbMath1190.68019MaRDI QIDQ2508375
Stavros D. Nikolopoulos, Katerina Asdre
Publication date: 12 October 2006
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-006-0019-7
data structures; event horizon; discrete-event simulation; heap; \(P\)-tree; \(P\)-tree structures; event set algorithms; hold model
90C60: Abstract computational complexity for mathematical programming problems
68P05: Data structures
Cites Work