P-tree structures and event horizon: efficient event-set implementations
From MaRDI portal
Publication:2508375
Recommendations
Cites work
- An efficient data structure for the simulation event set
- Analysis of an algorithm for priority queue administration
- Complexity Analyses of Event Set Algorithms
- Concurrent access of priority queues
- scientific article; zbMATH DE number 3907815 (Why is no real title available?)
- scientific article; zbMATH DE number 3770836 (Why is no real title available?)
- scientific article; zbMATH DE number 1984550 (Why is no real title available?)
- Meldable heaps and boolean union-find
Cited in
(4)- scientific article; zbMATH DE number 3868673 (Why is no real title available?)
- scientific article; zbMATH DE number 3534046 (Why is no real title available?)
- Ladder queue: an O(1) priority queue structure for large-scale discrete event simulation
- Managing pending events in sequential and parallel simulations using three-tier heap and two-tier ladder queue
This page was built for publication: P-tree structures and event horizon: efficient event-set implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508375)