List Traversal
List Traversal is a computational process in data structure operations whereby a linked list is systematically accessed and processed node by node, starting from the head node and following the references to the next nodes until the end of the list is reached.
37
Publications
1.6K
Citations
84
Authors
46
Institutions
Publications per year
2017–2026
3
Variants
Linked List Traversal
Parents
37
Maintaining order in a linked list
Paul F. Dietz · 1982 · 284 citations · Full text
Using circular programs to eliminate multiple traversals of data
Richard Bird · Acta Informatica · 1984 · 155 citations
Heuristics That Dynamically Organize Data Structures
J. Bitner · SIAM Journal on Computing · 1979 · 150 citations
Jeremy Gibbons, Geraint Jones · 1998 · 79 citations
1–5 of 37
84
3
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 84
46
University of Wisconsin–Madison
Madison, United States
3 h-index
3 publications
89 citations
AT&T (United States)
Bedminster, United States
3 h-index
3 publications
92 citations
Princeton University
Princeton, United States
2 h-index
4 publications
194 citations
University of Oxford
Oxford, United Kingdom
2 h-index
2 publications
234 citations
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
140 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
2 h-index
4 publications
101 citations
Université Paris-Sud
Orsay, France
2 h-index
4 publications
101 citations
University of California, Riverside
Riverside, United States
1 h-index
2 publications
108 citations
1–8 of 46
2 publications · 281 citations
2
h-index
ENTCS · 1 publications · 13 citations
1
h-index
1 publications · 49 citations
1
h-index
IJIG · 1 publications · 10 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5