Doubly Linked Lists
A Doubly Linked List is a linear data structure in which each node contains an element and two pointers, one pointing to the previous node and one to the next node, thereby enabling bidirectional traversal while maintaining a sequence of elements.
20
Publications
911
Citations
51
Authors
24
Institutions
Publications per year
2017–2026
6
Parents
20
FIESTA: Fast Incremental Euclidean Distance Fields for Online Motion Planning of Aerial Robots
Nils Klarlund, Michael I. Schwartzbach · 1993 · 141 citations
Michael B. Greenwald · 2002 · 75 citations
How do programmers use unsafe rust?
Vytautas Astrauskas, Christoph Matheja, Federico Poli et al. · Proceedings of the ACM on Programming Languages · 2020 · 75 citations · Full text
1–5 of 20
51
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 51
24

Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
2 h-index
6 publications
105 citations

Stellenbosch University
Stellenbosch, South Africa
2 h-index
2 publications
42 citations
Gran Sasso Science Institute
L’Aquila, Italy
2 h-index
2 publications
42 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
2 h-index
8 publications
160 citations
Université Paris Cité
Paris, France
2 h-index
8 publications
160 citations
University of Southampton
Southampton, United Kingdom
2 h-index
6 publications
126 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
8 publications
160 citations

University of Salerno
Fisciano, Italy
2 h-index
2 publications
42 citations
1–8 of 24
PACMPL · 2 publications · 98 citations
2
h-index
Repository · 1 publications · 10 citations
1
h-index
1 publications · 25 citations
1
h-index
1 publications · 12 citations
1
h-index
LJ · 1 publications · 13 citations
1
h-index
1–5