Twol-amalgamated priority queues

DOI10.1145/1005813.1057625MaRDI QIDQ5269375zbMATH OpenOpenAlexFDO

Authors Rick Siow Mong Goh, Ian Li-Jin Thng

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005813.1057625

zbMATH Keywords

algorithm analysisdiscrete event simulationfuture event listHenriksen's calendar queuepending event setpriority queuesimulatorskew heapsplay tree

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• Distribution-sensitive binomial queues.
• Ladder queue: an O(1) priority queue structure for large-scale discrete event simulation
• Three priority queue applications revisited
• Fast meldable priority queues
• On RAM Priority Queues

Cited in

(6)

• The amortized complexity of Henriksen's algorithm
• Melding priority queues
• scientific article; zbMATH DE number 2065978 (Why is no real title available?)
• Ladder queue: an O(1) priority queue structure for large-scale discrete event simulation
• An application of program unification to priority queue vectorization
• A complexity O(1) priority queue for event driven molecular dynamics simulations

This page was built for publication: Twol-amalgamated priority queues

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