Circular Linked Lists

Circular Linked Lists is a type of linked list in which the last node points to the first node, forming a continuous loop, thereby distinguishing it from linear linked lists where the last node terminates in a null reference.

4

Publications

147

Citations

6

Authors

6

Institutions

Publications per year

2017–2026

0

Authors

6

  1. SK
    Shuvendu K. Lahiri

    Microsoft (United States), United States

    1 publications · 95 citations

    1

    h-index

  2. AA
    Alan A. Bertossi

    University of Pisa, Italy

    1 publications · 24 citations

    1

    h-index

  3. YS
    Yossi Shiloach

    IBM Research - Haifa, Israel

    1 publications · 17 citations

    1

    h-index

  4. CM
    Cristina M. Pinotti

    University of Perugia, Italy

    1 publications · 24 citations

    1

    h-index

  5. LA
    Lloyd Allison

    Monash University, Australia

    1 publications · 11 citations

    1

    h-index

1–5 of 6

Venues

  1. Software Practice and Experience

    1 publications · 11 citations

    1

    h-index

  2. Journal of Parallel and Distributed Computing

    1 publications · 24 citations

    1

    h-index

  3. Information Processing Letters

    1 publications · 17 citations

    1

    h-index

1–3