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

Authors

84

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    3 publications · 191 citations

    3

    h-index

  2. SD
    Shaul Dar

    AT&T (United States), United States

    2 publications · 42 citations

    2

    h-index

  3. RR
    Raghu Ramakrishnan

    University of Wisconsin–Madison, United States

    2 publications · 42 citations

    2

    h-index

  4. MR
    Mark R. Brown

    Yale University, United States

    2 publications · 144 citations

    2

    h-index

  5. JM
    Joseph Melber

    ETH Zurich, Switzerland

    1 publications · 39 citations

    1

    h-index

1–5 of 84

Venues

  1. SIAM Journal on Computing

    2 publications · 281 citations

    2

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 13 citations

    1

    h-index

  3. Journal of Intelligent & Fuzzy Systems

    1 publications · 49 citations

    1

    h-index

  4. International Journal of Image and Graphics

    IJIG · 1 publications · 10 citations

    1

    h-index

  5. BIT Numerical Mathematics

    1 publications · 10 citations

    1

    h-index

1–5