Persistence In Data Structures

Persistence in Data Structures is a property of data structure designs that belongs to the class of update-preserving mechanisms, specifically characterized by the ability to retain previous versions of the structure after modifications, thereby enabling access and queries to both current and past states without interference.

36

Publications

3.3K

Citations

80

Authors

39

Institutions

Publications per year

2017–2026

5

Authors

80

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    5 publications · 1.2K citations

    5

    h-index

  2. HK
    Haim Kaplan

    Tel Aviv University, Israel

    4 publications · 98 citations

    4

    h-index

  3. MM
    Michael M. Swift

    University of Wisconsin–Madison, United States

    3 publications · 905 citations

    3

    h-index

  4. AJ
    Andres Jaan Tack

    University of Wisconsin–Madison, United States

    3 publications · 905 citations

    3

    h-index

  5. HV
    Haris Volos

    University of Wisconsin–Madison, United States

    3 publications · 905 citations

    3

    h-index

1–5 of 80

Venues

  1. Journal of Computer and System Sciences

    1 publications · 427 citations

    1

    h-index

  2. Synthese

    1 publications · 35 citations

    1

    h-index

  3. BRICS Report Series

    1 publications · 13 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 19 citations

    1

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 319 citations

    1

    h-index

1–5