Skip to search formSkip to main contentSkip to account menu

Double-ended priority queue

Known as: DEPQ, Double ended heaps (deaps), Double-ended heap 
In computer science, a double-ended priority queue (DEPQ) or double-ended heap is a data structure similar to a priority queue or heap, but allows… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Abstract data typeCollection (abstract data type)Computer scienceData structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Double-Ended Priority Queues
  • S. Sahni
  • Handbook of Data Structures and Applications
  • 2018
  • Corpus ID: 43492873
University of Florida 8.1 Definition and an Application . . . . . . . . . . . . . . . . . . . . 8-1 8.2 Symmetric Min-Max Heaps… 
2017
2017
Continuous cocycle superrigidity for the full shift over a finitely generated torsion group
Chung and Jiang showed that, if a one ended group contains an infinite order element, then every continuous cocycle over the full… 
2015
2015
Micromechanical resonant electrostatic charge sensor with micro-leverage mechanisms
A micromachined resonant electrostatic charge sensor with enhanced responsivity by introducing dual single-stage micro-leverage… 
2011
2011
Degradation Type Classifier for Full Band Speech Contaminated With Echo, Broadband Noise, and Reverberation
This paper addresses the problem of identifying impairment types that might be present in a speech signal. In particular, three… 
2010
2010
Developing the information model of the reachability graph
Information model has been developed to store data about the reachability graph. The developed model uses data structures based… 
2008
2008
Two new methods for constructing double-ended priority queues from priority queues
AbstractWe introduce two data-structural transformations to construct double-ended priority queues from priority queues. To apply… 
2008
2008
High impedance fault detection in mutually coupled double-ended transmission lines using high frequency disturbances
Coupling Capacitor Voltage Transformer (CCVT) secondary voltages, normally applied to conventional schemes, do not comprise… 
2007
2007
Two new methods for transforming priority queues into double-ended priority queues
Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to… 
2005
2005
The d-deap ast: a fast and simple cache-aligned d-ary deap
2003
2003
Improvements in double ended priority queues
In this paper, we present improved algorithms for min-max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)