Double-ended queue (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Double-ended queue" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

4web.archive.org

1^st place

1cmu.edu

1,564^th place

1,028^th place

1acm.org

1,185^th place

840^th place

1arxiv.org

69^th place

59^th place

1siam.org

low place

6,473^rd place

1princeton.edu

741^st place

577^th place

1geeksforgeeks.org

low place

1richardyi.ca

low place

1escholarship.org

1,523^rd place

976^th place

1elsevier.com

610^th place

704^th place

1ams.org

451^st place

277^th place

1springer.com

274^th place

309^th place

1mcgill.ca

2,527^th place

1,840^th place

1semanticscholar.org

11^th place

8^th place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Kaplan, Haim; Tarjan, Robert E. (1999). "Purely Functional, Real-Time Deques with Catenation". Journal of the ACM. 46 (5): 577–603. doi:10.1145/324133.324139.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Melkman, Avraham A. (1987). "On-line construction of the convex hull of a simple polyline". Information Processing Letters. 25 (1): 11–12. doi:10.1016/0020-0190(87)90086-X. MR 0896397.

arxiv.org (Global: 69^th place; English: 59^th place)

Viennot, Jules; Wendling, Arthur; Guéneau, Armaël; Pottier, François (2025-05-12). "Verified Purely Functional Catenable Real-Time Deques". arXiv:2505.07681 [cs.PL].

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Okasaki, Chris (September 1996). Purely Functional Data Structures (PDF) (Ph.D. thesis). Carnegie Mellon University. CMU-CS-96-177.

doi.org (Global: 2^nd place; English: 2^nd place)

Kaplan, Haim; Tarjan, Robert E. (1999). "Purely Functional, Real-Time Deques with Catenation". Journal of the ACM. 46 (5): 577–603. doi:10.1145/324133.324139.
Kaplan, Haim; Okasaki, Chris; Tarjan, Robert E. (2000). "Simple Confluently Persistent Catenable Lists" (PS). SIAM Journal on Computing. 30 (3): 965–977. doi:10.1137/S0097539798339430. Archived from the original on 2010-09-25.
Melkman, Avraham A. (1987). "On-line construction of the convex hull of a simple polyline". Information Processing Letters. 25 (1): 11–12. doi:10.1016/0020-0190(87)90086-X. MR 0896397.
Li, Fajie; Klette, Reinhard (2011). "Convex Hulls in the Plane". Euclidean Shortest Paths. London: Springer London. doi:10.1007/978-1-4471-2256-2_4. ISBN 978-1-4471-2255-5. Retrieved 2026-02-10.
Blumofe, Robert D.; Leiserson, Charles E. (1999). "Scheduling multithreaded computations by work stealing". J ACM. 46 (5): 720–748. doi:10.1145/324133.324234. S2CID 5428476.
Crespi-Reghizzi, Stefano; San Pietro, Pierluigi (2020). "Deque automata, languages, and planar graph representations". Theoretical Computer Science. 834: 43–59. doi:10.1016/j.tcs.2020.02.029.

elsevier.com (Global: 610^th place; English: 704^th place)

linkinghub.elsevier.com

Melkman, Avraham A. (1987). "On-line construction of the convex hull of a simple polyline". Information Processing Letters. 25 (1): 11–12. doi:10.1016/0020-0190(87)90086-X. MR 0896397.

escholarship.org (Global: 1,523^rd place; English: 976^th place)

Hirschberg, Daniel S.; Larmore, Lawrence L. (1985), The Least Weight Subsequence Problem, UC Irvine: Donald Bren School of Information and Computer Sciences{{citation}}: CS1 maint: publisher location (link)

geeksforgeeks.org (Global: low place; English: low place)

"Sliding Window Maximum". GeeksForGeeks. 27 May 2011. Archived from the original on August 3, 2025.

mcgill.ca (Global: 2,527^th place; English: 1,840^th place)

cgm.cs.mcgill.ca

Aloupis, Greg. "A History of Linear-time Convex Hull Algorithms for Simple Polygons". The Computational Geometry Lab at McGill. McGill University. Retrieved 10 February 2026.

princeton.edu (Global: 741^st place; English: 577^th place)

cs.princeton.edu

Mihaescu, Radu; Tarjan, Robert (August 2003), "Notes on Catenable Deques in Pure Lisp", Computer Science 528 Data Structures and Graph Algorithms, Computer science (course handout), Princeton University, archived from the original (DOC) on 2006-09-17

richardyi.ca (Global: low place; English: low place)

Yi, Richard. "1D1D DP: A Dynamic Programming Optimization". Archived from the original on January 16, 2024.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Blumofe, Robert D.; Leiserson, Charles E. (1999). "Scheduling multithreaded computations by work stealing". J ACM. 46 (5): 720–748. doi:10.1145/324133.324234. S2CID 5428476.

siam.org (Global: low place; English: 6,473^rd place)

epubs.siam.org

Kaplan, Haim; Okasaki, Chris; Tarjan, Robert E. (2000). "Simple Confluently Persistent Catenable Lists" (PS). SIAM Journal on Computing. 30 (3): 965–977. doi:10.1137/S0097539798339430. Archived from the original on 2010-09-25.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Li, Fajie; Klette, Reinhard (2011). "Convex Hulls in the Plane". Euclidean Shortest Paths. London: Springer London. doi:10.1007/978-1-4471-2256-2_4. ISBN 978-1-4471-2255-5. Retrieved 2026-02-10.

web.archive.org (Global: 1^st place; English: 1^st place)

Kaplan, Haim; Okasaki, Chris; Tarjan, Robert E. (2000). "Simple Confluently Persistent Catenable Lists" (PS). SIAM Journal on Computing. 30 (3): 965–977. doi:10.1137/S0097539798339430. Archived from the original on 2010-09-25.
Mihaescu, Radu; Tarjan, Robert (August 2003), "Notes on Catenable Deques in Pure Lisp", Computer Science 528 Data Structures and Graph Algorithms, Computer science (course handout), Princeton University, archived from the original (DOC) on 2006-09-17
"Sliding Window Maximum". GeeksForGeeks. 27 May 2011. Archived from the original on August 3, 2025.
Yi, Richard. "1D1D DP: A Dynamic Programming Optimization". Archived from the original on January 16, 2024.

Double-ended queue (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

cmu.edu (Global: 1,564th place; English: 1,028th place)

cs.cmu.edu

doi.org (Global: 2nd place; English: 2nd place)

elsevier.com (Global: 610th place; English: 704th place)

linkinghub.elsevier.com

escholarship.org (Global: 1,523rd place; English: 976th place)

geeksforgeeks.org (Global: low place; English: low place)

mcgill.ca (Global: 2,527th place; English: 1,840th place)

cgm.cs.mcgill.ca

princeton.edu (Global: 741st place; English: 577th place)

cs.princeton.edu

richardyi.ca (Global: low place; English: low place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

siam.org (Global: low place; English: 6,473rd place)

epubs.siam.org

springer.com (Global: 274th place; English: 309th place)

link.springer.com

web.archive.org (Global: 1st place; English: 1st place)

acm.org (Global: 1,185^th place; English: 840^th place)

ams.org (Global: 451^st place; English: 277^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

elsevier.com (Global: 610^th place; English: 704^th place)

escholarship.org (Global: 1,523^rd place; English: 976^th place)

mcgill.ca (Global: 2,527^th place; English: 1,840^th place)

princeton.edu (Global: 741^st place; English: 577^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

siam.org (Global: low place; English: 6,473^rd place)

springer.com (Global: 274^th place; English: 309^th place)

web.archive.org (Global: 1^st place; English: 1^st place)