Range-restricted mergeable priority queues

DOI10.1016/0020-0190(93)90240-AMaRDI QIDQ689640zbMATH OpenOpenAlexFDO

Authors Jonathan D. Bright

Publication date 15 November 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90240-a

zbMATH Keywords

priority queueheaps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• An algorithm for merging heaps
• Algorithm Theory - SWAT 2004
• Melding priority queues
• Fast meldable priority queues
• A pointer-free data structure for merging heaps and min-max heaps

Cites work

• scientific article; zbMATH DE number 65738 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• A priority queue in which initialization and queue operations takeO(loglogD) time
• Design and implementation of an efficient priority queue
• Log-logarithmic worst-case range queries are possible in space theta(N)
• New trie data structures which support very fast search operations
• Preserving order in a forest in less than logarithmic time and linear space

Cited in

(6)

• scientific article; zbMATH DE number 6469130 (Why is no real title available?)
• Queue-mergesort
• Priority Range Trees
• An algorithm for merging heaps
• An elementary algorithm for reporting intersections of red/blue curve segments
• Melding priority queues

This page was built for publication: Range-restricted mergeable priority queues

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