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.
Highly Cited
2015
Highly Cited
2015
Recently, strong results have been demonstrated by Deep Recurrent Neural Networks on natural language transduction problems. In… 
Highly Cited
2009
Highly Cited
2009
Because learning an optimal Bayesian network classifier is an NP-hard problem, learning-improved naive Bayes has attracted much… 
Highly Cited
2008
Highly Cited
2008
This paper describes the development of aluminum nitride (AlN) resonant accelerometers that can be integrated directly over… 
Highly Cited
2003
Highly Cited
2003
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong… 
Highly Cited
1998
Highly Cited
1998
The fifth release of the multithreaded language Cilk uses a provably good "work-stealing" scheduling algorithm similar to the… 
1997
1997
Catenable double-ended queues are double-ended queues (deques) that support catenation (i.e., append) efficiently without… 
Highly Cited
1995
Highly Cited
1987
Highly Cited
1987
The HLA association with insulin-dependent diabetes mellitus is highest among individuals heterozygous for DR3 and DR4. To… 
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… 
Highly Cited
1972
Highly Cited
1972
Inspired by Knuth [2, p. 234], we wish to consider the following problem: Suppose we are presented with the layout of a railroad…