Partition-based Simple Heaps

Gerth Stølting Brodal, John Iacono, Casper Moldrup Rysgaard +1

We introduce a new family of priority-queue data structures: partition-based simple heaps. The structures consist of $O(\log n)$ doubly-linked lists; order is enforced among data i…