Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,465,689 papers from all fields of science
Search
Sign In
Create Free Account
Double-ended queue
Known as:
Deque
, Head-tail linked list
, Doubly-ended queue
Expand
In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that generalizes a queue…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
46 relations
2–3 tree
Abstract data type
Ada
Amortized analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Learning to Transduce with Unbounded Memory
Edward Grefenstette
,
K. Hermann
,
Mustafa Suleyman
,
Phil Blunsom
Neural Information Processing Systems
2015
Corpus ID: 7831483
Recently, strong results have been demonstrated by Deep Recurrent Neural Networks on natural language transduction problems. In…
Expand
Highly Cited
2009
Highly Cited
2009
A Novel Bayes Model: Hidden Naive Bayes
Liangxiao Jiang
,
Harry Zhang
,
Z. Cai
IEEE Transactions on Knowledge and Data…
2009
Corpus ID: 17505286
Because learning an optimal Bayesian network classifier is an NP-hard problem, learning-improved naive Bayes has attracted much…
Expand
Highly Cited
2008
Highly Cited
2008
Post-CMOS-Compatible Aluminum Nitride Resonant MEMS Accelerometers
Roy H. Olsson
,
K. Wojciechowski
,
Michael S. Baker
,
M. Tuck
,
James G. Fleming
Journal of microelectromechanical systems
2008
Corpus ID: 30032367
This paper describes the development of aluminum nitride (AlN) resonant accelerometers that can be integrated directly over…
Expand
Highly Cited
2003
Highly Cited
2003
Obstruction-free synchronization: double-ended queues as an example
M. Herlihy
,
Victor Luchangco
,
Mark Moir
23rd International Conference on Distributed…
2003
Corpus ID: 1904816
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong…
Expand
Highly Cited
1998
Highly Cited
1998
The implementation of the Cilk-5 multithreaded language
Matteo Frigo
,
C. Leiserson
,
K. H. Randall
ACM-SIGPLAN Symposium on Programming Language…
1998
Corpus ID: 5404046
The fifth release of the multithreaded language Cilk uses a provably good "work-stealing" scheduling algorithm similar to the…
Expand
1997
1997
Catenable double-ended queues
Chris Okasaki
ACM SIGPLAN International Conference on…
1997
Corpus ID: 13233490
Catenable double-ended queues are double-ended queues (deques) that support catenation (i.e., append) efficiently without…
Expand
Highly Cited
1995
Highly Cited
1995
Generating trees and the Catalan and Schröder numbers
J. West
Discrete Mathematics
1995
Corpus ID: 7140495
Highly Cited
1987
Highly Cited
1987
Transcomplementation of HLA Genes in IDDM: HLA-DQ α and β-Chains Produce Hybrid Molecules in DR3/4 Heterozygotes
B. Nepom
,
D. Schwarz
,
J. Palmer
,
G. Nepom
Diabetes
1987
Corpus ID: 38059843
The HLA association with insulin-dependent diabetes mellitus is highest among individuals heterozygous for DR3 and DR4. To…
Expand
Highly Cited
1973
Highly Cited
1973
Computing permutations with double-ended queues, parallel stacks and parallel queues
V. Pratt
Symposium on the Theory of Computing
1973
Corpus ID: 15740957
A memory may be regarded as a computer with input, output and storage facilities, but with no explicit functional capability. The…
Expand
Highly Cited
1972
Highly Cited
1972
Sorting Using Networks of Queues and Stacks
R. Tarjan
Journal of the ACM
1972
Corpus ID: 13608929
Inspired by Knuth [2, p. 234], we wish to consider the following problem: Suppose we are presented with the layout of a railroad…
Expand
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)
ACCEPT & CONTINUE