Skip to search formSkip to main contentSkip to account menu

Double-ended queue

Known as: Deque, Head-tail linked list, Doubly-ended queue 
In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that generalizes a queue… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We introduce a new algorithm for an unbounded concurrent double-ended queue (deque). Like the bounded deque of Herlihy, Luchangco… 
2008
2008
In this paper, we first identify the key requirements for the deployment of a 1-Gb/s ultra-broadband home area network (UBB-HAN… 
2005
2005
The effects of hot carrier stress on CMOS voltage-controlled oscillators (VCO) are investigated. A model of the threshold voltage… 
2004
2004
In [3], the objective was the quantification of the bandwidth increase provided by one additional tuning circuit. Approximate… 
2003
2003
Interactions between radiative processes and the ozone field forecast by the ECMWF system, operational in January 2002, are… 
2001
2001
A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays… 
1996
1996
This paper describes a 256 Mb DRAM chip architecture which provides up to /spl times/32 wide organization. In order to minimize… 
1994
1994
We consider the implementation of generalized doubled-ended queues. The generalized data structure, which is denoted as mindeque… 
1973
1973
Within the framework of a general semiclassical theory that combines exact classical dynamics and quantum superposition it is…