Range-restricted mergeable priority queues

DOI10.1016/0020-0190(93)90240-AzbMath0782.68032OpenAlexW2094591196MaRDI QIDQ689640

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)

Related Items (1)

An elementary algorithm for reporting intersections of red/blue curve segments

Cites Work

• New trie data structures which support very fast search operations
• Preserving order in a forest in less than logarithmic time and linear space
• Log-logarithmic worst-case range queries are possible in space theta(N)
• A priority queue in which initialization and queue operations takeO(loglogD) time
• Design and implementation of an efficient priority queue
• Unnamed Item
• Unnamed Item

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