Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
deques
Description:
A double-ended queue is a linear data structure that permits insertion and removal of elements at either end.
Primary topic:
Algorithms and Data Compression (23%)
Related topics:
Algorithms and Data Compression (23%),
Logic, programming, and type systems (18%),
Teaching and Learning Programming (12%),
Parallel Computing and Optimization Techniques (11%),
Distributed systems and fault tolerance (7%)
Wikidata ID:
wiki/Q1192005
OpenAlex ID:
keywords/deques
Learning to Transduce with Unbounded Memory
2015
·
Grefenstette, Edward
, Hermann, Karl Moritz
, et al.
·
arXiv (Cornell University)
·
305
PDF
Dynamic circular work-stealing deque
2005
·
David Chase
, Yossi Lev
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
293
Data Structures and Algorithms with Object-Oriented Design Patterns in Java
1999
·
Bruno R. Preiss
·
228
Lightweight semiformal time complexity analysis for purely functional data structures
2008
·
Nils Anders Danielsson
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
124
Non-blocking steal-half work queues
2002
·
Danny Hendler
, Nir Shavit
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
123
Simple and efficient purely functional queues and deques
1995
·
Chris Okasaki
·
Journal of Functional Programming
·
78
PDF
Resizable Arrays in Optimal Time and Space
1999
·
Andrej Brodnik
, Svante Carlsson
, et al.
·
Lecture notes in computer science
·
76
Real-time deques, multihead Turing machines, and purely functional programming
1993
·
Tyng-Ruey Chuang
, Benjamin Goldberg
·
International Conference on Functional Programming Languages and Computer Architecture (FPCA)
·
67
PDF
Energy-efficient work-stealing language runtimes
2014
·
Haris Ribic
, Yu David Liu
·
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)
·
62
Deques with heap order
1986
·
Hania Gajewska
, Robert E. Tarjan
·
Information Processing Letters
·
42
Lower Bounds for Oblivious Data Structures
2019
·
Riko Jacob
, Kasper Green Larsen
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
37
PDF
Efficient and Practical Non-Blocking Data Structures
2004
·
Håkan Sundell
·
Chalmers Publication Library (Chalmers University of Technology)
·
33
Confluently persistent deques via data structuaral bootstrapping
1993
·
Adam L. Buchsbaum
, Robert E. Tarjan
·
Symposium on Discrete Algorithms
·
32
Deques, trees and lattice paths
1981
·
D. G. Rogers
, L. W. Shapiro
·
Lecture notes in mathematics
·
27
Open Data Structures: An Introduction
2013
·
Pat Morin
·
Athabasca University Press eBooks
·
24
PDF
Permutations Generated by Stacks and Deques
2010
·
Michael Albert
, Mike Atkinson
, et al.
·
Annals of Combinatorics
·
21
Lightweight semiformal time complexity analysis for purely functional data structures
2008
·
Nils Anders Danielsson
·
ACM SIGPLAN Notices
·
21
Systolic tree implementation of data structures
1988
·
J.H. Chang
, O.H. Ibarra
, et al.
·
IEEE Transactions on Computers
·
21
Fast Functional Lists, Hash-Lists, Deques, and Variable Length Arrays
2002
·
Phil Bagwell
·
Infoscience (Ecole Polytechnique Fédérale de Lausanne)
·
17
Confluently Persistent Deques via Data-Structural Bootstrapping
1995
·
A.L. Buchsbaum
, R.E. Tarjan
·
Journal of Algorithms
·
17
Estrategias Gramaticales De Expresión De La Evidencialidad En El Español De Chile
2011
·
Carlos González Vergara
·
Alpha Revista de Artes Letras y Filosofía
·
16
PDF
Abstract data types: their specification, representation, and use
1988
·
Peter Thomas
, Hugh Robinson
, et al.
·
Clarendon Press eBooks
·
15
Experiences with the Design and Implementation of Space-Efficient Deques
2001
·
Jyrki Katajainen
, Bjarke Buur Mortensen
·
Lecture notes in computer science
·
14
Energy-efficient work-stealing language runtimes
2014
·
Haris Ribic
, Yu David Liu
·
ACM SIGARCH Computer Architecture News
·
10
The Rique-Number of Graphs
2023
·
Michael A. Bekos
, Stefan Felsner
, et al.
·
Lecture notes in computer science
·
6
PDF
Show more works
View as search
Works count:
114
Citation count:
1,781
Year
Topic
Type