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
Parents
4
Verifying properties of well-founded linked lists
Shuvendu K. Lahiri, Shaz Qadeer · 2006 · 95 citations
Circular programs and self‐referential structures
Lloyd Allison · Software Practice and Experience · 1989 · 11 citations · Full text
1–4 of 4
6
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 6
6

Monash University
Melbourne, Australia
1 h-index
1 publications
11 citations

University of Bologna
Bologna, Italy
1 h-index
1 publications
24 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
1 h-index
2 publications
190 citations
Microsoft (United States)
Redmond, United States
1 h-index
2 publications
190 citations

University of Trento
Trento, Italy
1 h-index
1 publications
24 citations
Stanford University
Stanford, United States
1 h-index
1 publications
17 citations
1–6 of 6
1 publications · 11 citations
1
h-index
1 publications · 24 citations
1
h-index
1 publications · 17 citations
1
h-index
1–3