P-tree structures and event horizon: efficient event-set implementations

DOI10.1007/s11390-006-0019-7zbMath1190.68019OpenAlexW2055649782MaRDI 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

zbMATH Keywords

data structuresevent horizondiscrete-event simulationheap\(P\)-tree\(P\)-tree structuresevent set algorithmshold model

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity Analyses of Event Set Algorithms
• Meldable heaps and boolean union-find
• Concurrent access of priority queues
• Analysis of an algorithm for priority queue administration
• An efficient data structure for the simulation event set

This page was built for publication: P-tree structures and event horizon: efficient event-set implementations