Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315375zbMATH OpenOpenAlexFDO

Authors Ran Mendelson, Mikkel Thorup, Uri Zwick, Robert E. Tarjan

Publication date 7 September 2005

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

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Melding priority queues
• Fast meldable priority queues
• scientific article; zbMATH DE number 6469130
• Pairing heaps with costless meld
• scientific article; zbMATH DE number 871899

Cited in

(13)

• Queue-mergesort
• Efficiency of combining various priority queueing disciplines in computer systems
• The weighted arborescence constraint
• Melding priority queues
• Strictly-regular number system and data structures
• Mergeable dictionaries
• Fast meldable priority queues
• The amortized cost of finding the minimum
• scientific article; zbMATH DE number 6469130 (Why is no real title available?)
• scientific article; zbMATH DE number 7692724 (Why is no real title available?)
• A generalization of binomial queues
• Range-restricted mergeable priority queues
• Two new methods for constructing double-ended priority queues from priority queues

This page was built for publication: Algorithm Theory - SWAT 2004

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