Sciweavers

COMPUTING
2008
94views more  COMPUTING 2008»
13 years 5 months ago
Two new methods for constructing double-ended priority queues from priority queues
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
ACTA
2008
82views more  ACTA 2008»
13 years 5 months ago
Two-tier relaxed heaps
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...
Amr Elmasry, Claus Jensen, Jyrki Katajainen