Black box for constant-time insertion in priority queues (note)

DOI10.1145/1077464.1077471zbMath1321.68232OpenAlexW2070213718MaRDI QIDQ2944491

Theis Rauhe, Thore Husfeldt, Stephen Alstrup, Mikkel Thorup

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1077464.1077471

zbMATH Keywords

shortest pathspriority queues

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (5)

Two new methods for constructing double-ended priority queues from priority queues ⋮ Optimizing binary heaps ⋮ Weak heaps engineered ⋮ Priority Queues and Sorting for Read-Only Data ⋮ A Survey on Priority Queues

This page was built for publication: Black box for constant-time insertion in priority queues (note)