Distribution-sensitive binomial queues.

DOI10.1007/B11837MaRDI QIDQ5900746zbMATH OpenFDO

Authors Amr Elmasry

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 4062572
• scientific article; zbMATH DE number 1979500
• Queaps
• A survey on priority queues
• A generalization of binomial queues

Cited in

(18)

• The amortized complexity of Henriksen's algorithm
• Ordered priority queues
• Three priority queue applications revisited
• Worst-case data structures for the priority queue with attrition
• Queaps
• A survey on priority queues
• A unifying property for distribution-sensitive priority queues
• Strictly implicit priority queues: on the number of moves and worst-case time
• Hash functions for priority queues
• Repeated random insertion into a priority queue
• scientific article; zbMATH DE number 4062572 (Why is no real title available?)
• scientific article; zbMATH DE number 1979500 (Why is no real title available?)
• Probabilistic data structures for priority queues
• Twol-amalgamated priority queues
• The amortized cost of finding the minimum
• The power of choice in priority scheduling
• Cascade heap: towards time-optimal extractions
• A generalization of binomial queues

This page was built for publication: Distribution-sensitive binomial queues.

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