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

Authors

116

  1. AK
    Alex Kogan

    Technion – Israel Institute of Technology, Israel

    2 publications · 85 citations

    2

    h-index

  2. AR
    A. R. Neureuther

    University of California, Berkeley, United States

    2 publications · 54 citations

    2

    h-index

  3. OS
    Ori Shalev

    Hebrew University of Jerusalem, Israel

    2 publications · 223 citations

    2

    h-index

  4. NS
    Nir Shavit

    Tel Aviv University, Israel

    2 publications · 223 citations

    2

    h-index

  5. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    2 publications · 85 citations

    2

    h-index

1–5 of 116

Venues

  1. Communications of the ACM

    2 publications · 75 citations

    2

    h-index

  2. IEEE Access

    2 publications · 81 citations

    2

    h-index

  3. Journal of the ACM

    JACM · 2 publications · 203 citations

    2

    h-index

  4. Electronics Letters

    1 publications · 16 citations

    1

    h-index

  5. Linux journal

    LJ · 1 publications · 13 citations

    1

    h-index

1–5