Probabilistic data structures for priority queues

DOI10.1007/BFB0054362MaRDI QIDQ5054850zbMATH OpenOpenAlexFDO

Authors

Publication date 9 December 2022

Published in Algorithm Theory — SWAT'98 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 871899
• Fast meldable priority queues
• Distribution-sensitive binomial queues.
• On RAM Priority Queues
• Parallel algorithms for priority queue operations

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 871899 (Why is no real title available?)
• A data structure for manipulating priority queues
• A pointer-free data structure for merging heaps and min-max heaps
• Fast meldable priority queues

Cited in

(2)

• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• scientific article; zbMATH DE number 2188502 (Why is no real title available?)

This page was built for publication: Probabilistic data structures for priority queues

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