Linked Lists
Linked List is a linear data structure in which each element, known as a node, consists of a data value and a reference to the next node in the sequence, thereby forming a chain that allows dynamic memory allocation and efficient insertion and deletion operations.
72
Publications
3.4K
Citations
152
Authors
76
Institutions
Publications per year
2017–2026
1
72
Lock-free linked lists using compare-and-swap
John D. Valois · 1995 · 290 citations
Maintaining order in a linked list
Paul F. Dietz · 1982 · 284 citations · Full text
Heuristics That Dynamically Organize Data Structures
J. Bitner · SIAM Journal on Computing · 1979 · 150 citations
Lock-free linked lists and skip lists
Mikhail Fomitchev, Eric Ruppert · 2004 · 144 citations
1–5 of 72
152
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 152
76
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
8 publications
294 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
3 h-index
4 publications
307 citations
Palo Alto Research Center
Palo Alto, United States
2 h-index
2 publications
140 citations
University of Cambridge
Cambridge, United Kingdom
2 h-index
2 publications
129 citations

Imperial College London
London, United Kingdom
2 h-index
6 publications
128 citations
Microsoft (United States)
Redmond, United States
2 h-index
3 publications
202 citations
Kent State University
Kent, United States
2 h-index
2 publications
56 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
139 citations
1–8 of 76
3 publications · 92 citations
3
h-index
3 publications · 96 citations
3
h-index
2 publications · 20 citations
2
h-index
2 publications · 36 citations
2
h-index
Repository · 1 publications · 14 citations
1
h-index
1–5