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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Shared data object implementations that allow non-blocking concurrent operations are useful for in-memory data-processing… (More)
  • figure 1
  • figure 2
Is this relevant?
2016
2016
We introduce a new algorithm for an unbounded concurrent double-ended queue (deque). Like the bounded deque of Herlihy, Luchangco… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
2015
2015
We study a double-ended queue where buyers and sellers arrive to conduct trades. When there is a pair of buyer and seller in the… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong… (More)
Is this relevant?
2003
2003
In this paper, we present improved algorithms for min–max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
The e2ect of “impatient” behaviour is studied primarily in the context of “double-ended” queues where each demands service from… (More)
  • table 1
  • table 2
Is this relevant?
1997
1997
Catenable double-ended queues are double-ended queues (deques) that support catenation (i.e., append) efficiently without… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
1994
1994
We consider the implementation of generalized doubled-ended queues. The generalized data structure, which is denoted as mindeque… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1979
1979
It is shown that concatenable double-ended queues can be simulated in real-time by double-ended queues without concatenation… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
A memory may be regarded as a computer with input, output and storage facilities, but with no explicit functional capability. The… (More)
  • figure 2
Is this relevant?