The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues.

Svante Carlsson The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. 33-36 1987 26 Inf. Process. Lett. 1 db/journals/ipl/ipl26.html#Carlsson87a