Linked List Algorithms
Linked List Algorithms is a computational method that systematically manipulates or traverses nodes in a linear data structure through pointer-based navigation, distinguished by its reliance on sequential access and dynamic memory allocation rather than contiguous storage indexing.
51
Publications
2.3K
Citations
116
Authors
46
Institutions
Publications per year
2017–2026
6
Variants
Linked List Algorithm
Parents
51
Michael Hind · 2001 · 583 citations
Maintaining order in a linked list
Paul F. Dietz · 1982 · 284 citations · Full text
Ori Shalev, Nir Shavit · Journal of the ACM · 2006 · 182 citations
Heuristics That Dynamically Organize Data Structures
J. Bitner · SIAM Journal on Computing · 1979 · 150 citations
1–5 of 51
116
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 116
46
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
8 publications
266 citations
University of Chinese Academy of Sciences
Beijing, China
2 h-index
3 publications
75 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
4 publications
446 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
215 citations

University of Minnesota
Minneapolis, United States
2 h-index
4 publications
152 citations
Columbia University
New York, United States
2 h-index
5 publications
133 citations
Intel (United States)
Santa Clara, United States
2 h-index
3 publications
119 citations
Seoul National University
Seoul, South Korea
2 h-index
5 publications
95 citations
1–8 of 46
2 publications · 75 citations
2
h-index
2 publications · 81 citations
2
h-index
JACM · 2 publications · 203 citations
2
h-index
1 publications · 16 citations
1
h-index
LJ · 1 publications · 13 citations
1
h-index
1–5