Range-restricted mergeable priority queues
From MaRDI portal
Publication:689640
DOI10.1016/0020-0190(93)90240-AzbMATH Open0782.68032OpenAlexW2094591196MaRDI QIDQ689640FDOQ689640
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
Recommendations
Cites Work
- 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
- New trie data structures which support very fast search operations
- Design and implementation of an efficient priority queue
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
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)