Two new methods for constructing double-ended priority queues from priority queues
type: Item
instance of: scholarly article
title: Two new methods for constructing double-ended priority queues from priority queues
zbMATH Open document ID: 1183.68213
author: Amr Elmasry
author: Claus Jensen
author: Jyrki Katajainen
published in: Computing
publication date: 2009-09-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5602547
zbMATH Keywords: data structures
MaRDI profile type: Publication
full work available at URL: s00607-008-0019-2
OpenAlex ID: W2022705471
cites work: Black box for constant-time insertion in priority queues (note)
cites work: Symmetric min-max heap: a simpler data structure for double-ended priority queue
cites work: Min-max heaps and generalized priority queues
cites work: Time bounds for selection
cites work: Q4875168
cites work: Diamond deque: A simple data structure for priority deques
cites work: MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
cites work: Correspondence-based data structures for double-ended priority queues
cites work: The relaxed min-max heap: A mergeable double-ended priority queue
cites work: Two-tier relaxed heaps
cites work: Algorithm design: Foundations, analysis, and Internet examples
cites work: Q4825541
cites work: Interval Heaps
cites work: Reflected min-Max heaps
cites work: Algorithms and Data Structures
cites work: Q4460605
DOI: 10.1007/S00607-008-0019-2
description: scientific article; zbMATH DE number 5602547