Twol-amalgamated priority queues

DOI10.1145/1005813.1057625zbMATH Open1365.68180OpenAlexW2049958339MaRDI QIDQ5269375FDOQ5269375

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

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

zbMATH Keywords

simulatoralgorithm analysispriority queuediscrete event simulationsplay treeskew heapfuture event listHenriksen's calendar queuepending event set

Mathematics Subject Classification ID

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

Cited In (6)

• An application of program unification to priority queue vectorization
• A complexity O(1) priority queue for event driven molecular dynamics simulations
• Ladder queue: an \(O(1)\) priority queue structure for large-scale discrete event simulation
• Melding priority queues
• The amortized complexity of Henriksen's algorithm
• Title not available (Why is that?)

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)