Persistent Trees

Persistent Trees is a type of persistent data structure that extends the concept of trees by maintaining all previous versions of the tree after modifications, enabling efficient access to and traversal of historical states while preserving immutability and structural sharing.

19

Publications

1.4K

Citations

62

Authors

43

Institutions

Publications per year

2017–2026

8

Authors

62

  1. SL
    Sitaram Lanka

    Microsoft Research (United Kingdom), United Kingdom

    2 publications · 102 citations

    2

    h-index

  2. JL
    Jingyan Li

    Chiang Mai University, Thailand

    2 publications · 24 citations

    2

    h-index

  3. EM
    Eric Mays

    University of Pennsylvania, United States

    2 publications · 102 citations

    2

    h-index

  4. JP
    Juan Pedro Bolívar Puente

    Anna Needs Neuroblastoma Answers, United States

    1 publications · 13 citations

    1

    h-index

  5. JC
    Jerry Chun‐Wei Lin

    Western Norway University of Applied Sciences, Norway

    1 publications · 13 citations

    1

    h-index

1–5 of 62

Venues

  1. Memory & Cognition

    1 publications · 13 citations

    1

    h-index

  2. ACM Transactions on Storage

    TOS · 1 publications · 16 citations

    1

    h-index

  3. Proceedings of the ACM on Programming Languages

    PACMPL · 1 publications · 13 citations

    1

    h-index

  4. 1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

1–5