Doubly Linked Lists

A Doubly Linked List is a linear data structure in which each node contains an element and two pointers, one pointing to the previous node and one to the next node, thereby enabling bidirectional traversal while maintaining a sequence of elements.

20

Publications

911

Citations

51

Authors

24

Institutions

Publications per year

2017–2026

6

Authors

51

  1. SL
    Salvatore La Torre

    University of Salerno, Italy

    2 publications · 42 citations

    2

    h-index

  2. CD
    Cezara Drăgoi

    Centre National de la Recherche Scientifique, France

    2 publications · 40 citations

    2

    h-index

  3. OI
    Omar Inverso

    Gran Sasso Science Institute, Italy

    2 publications · 42 citations

    2

    h-index

  4. HB
    Herbert Bos

    Vrije Universiteit Amsterdam, Netherlands

    2 publications · 35 citations

    2

    h-index

  5. TL
    Truc L. Nguyen

    University of Southampton, United Kingdom

    2 publications · 42 citations

    2

    h-index

1–5 of 51

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 98 citations

    2

    h-index

  2. Journal of Computational Geometry (Carleton University)

    Repository · 1 publications · 10 citations

    1

    h-index

  3. ACM SIGPLAN Notices

    1 publications · 25 citations

    1

    h-index

  4. Empirical Software Engineering

    1 publications · 12 citations

    1

    h-index

  5. Linux journal

    LJ · 1 publications · 13 citations

    1

    h-index

1–5