Persistent Data Structures

Persistent Data Structures is a data-structural concept denoting a data structure that, instead of being destructively updated, preserves all prior versions of itself so that any historical version remains accessible after modifications.

241

Publications

13.9K

Citations

570

Authors

241

Institutions

Publications per year

2017–2026

51

Authors

570

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    8 publications · 1.8K citations

    8

    h-index

  2. AD
    Alan Dearle

    University of St Andrews, United Kingdom

    6 publications · 148 citations

    6

    h-index

  3. SS
    Steven Swanson

    University of California San Diego, United States

    5 publications · 915 citations

    5

    h-index

  4. JE
    J. Eliot B. Moss

    University of Massachusetts Amherst, United States

    5 publications · 188 citations

    5

    h-index

  5. SO
    Steve Oudot

    Centre Inria de Saclay, France

    5 publications · 453 citations

    5

    h-index

1–5 of 570

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 7 publications · 588 citations

    7

    h-index

  2. Software Practice and Experience

    5 publications · 219 citations

    5

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 5 publications · 204 citations

    5

    h-index

  4. ACM SIGPLAN Notices

    5 publications · 142 citations

    5

    h-index

  5. arXiv (Cornell University)

    Repository · 5 publications · 172 citations

    5

    h-index

1–5