We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
Abstract. We introduce an adaptation of run-relaxed heaps which provides efficient heap operations with respect to the number of element comparisons performed. Our data structure g...