Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time

DOI10.1007/978-3-319-21840-3_8zbMath1444.68055arXiv1505.00147OpenAlexW1815165802MaRDI QIDQ3449808

Jesper Sindahl Nielsen, Gerth Stølting Brodal, Jakob Truelsen

Publication date: 30 October 2015

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

Full work available at URL: https://arxiv.org/abs/1505.00147

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time, Optimizing binary heaps

Cites Work

• Unnamed Item
• Unnamed Item
• Weak heaps engineered
• Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves
• A Survey on Priority Queues
• Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
• Implicit dictionaries with O(1) modifications per update and fast search
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Finger Search in the Implicit Model