Rank-Sensitive Priority Queues

DOI10.1007/978-3-642-03367-4_16MaRDI QIDQ3183452zbMATH OpenOpenAlexFDO

Authors Brian C. Dean, Zachary H. Jones

Publication date 20 October 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_16

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• On RAM Priority Queues
• scientific article; zbMATH DE number 871899
• scientific article; zbMATH DE number 871900
• Fast meldable priority queues
• Priority queues: small, monotone and trans-dichotomous

Cites work

• A unified access bound on comparison-based dynamic dictionaries
• Faster algorithms for the shortest path problem
• Fishspear: a priority queue algorithm
• scientific article; zbMATH DE number 437541 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Queaps
• Randomized search trees
• Self-adjusting binary search trees
• Shortest paths algorithms: Theory and experimental evaluation

Cited in

(5)

• Rank order filters and priority queues
• Priority queues and multisets
• Priority Range Trees
• Fishspear: a priority queue algorithm
• Priority queues with binary priorities

This page was built for publication: Rank-Sensitive Priority Queues

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