Double-Ended Queues is a data structure that extends the queue abstraction by allowing insertion and removal of elements at both the front and the rear ends, thereby supporting bidirectional access and modification.
42
Publications
2.2K
Citations
83
Authors
49
Institutions
Publications per year
2017–2026
11
Variants
Deques
Parents
Publications
42
Dynamic circular work-stealing deque
David Chase, Yossi Lev · 2005 · 240 citations
Min-max heaps and generalized priority queues
M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro et al. · Communications of the ACM · 1986 · 170 citations
1–5 of 42
Authors
83
- XL
4
h-index
- CO
3
h-index
- MM
3
h-index
- SD
2
h-index
- ZX
2
h-index
1–5 of 83
Institutions
49
Clemson University
Clemson, United States
4 h-index
6 publications
116 citations
University of Salerno
Fisciano, Italy
3 h-index
8 publications
295 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
3 publications
103 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
41 citations
Indian Institute of Technology Madras
Chennai, India
2 h-index
4 publications
146 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
5 publications
100 citations
Didi Chuxing (China)
Beijing, China
2 h-index
2 publications
170 citations
Old Dominion University
Norfolk, United States
2 h-index
3 publications
64 citations
1–8 of 49
Venues
- Stochastic Systems
3 publications · 62 citations
3
h-index
- Computers & Industrial Engineering
2 publications · 57 citations
2
h-index
- Information Processing Letters
2 publications · 61 citations
2
h-index
- Journal of Advanced Transportation
2 publications · 85 citations
2
h-index
- ACM Transactions on Programming Languages and Systems
1 publications · 15 citations
1
h-index
1–5