Persistent Arrays

Persistent Arrays is a data structure that belongs to the class of persistent data structures and is distinguished by its ability to retain previous versions of the array upon modification, enabling efficient access and updates while preserving immutability through explicit versioning.

12

Publications

1.4K

Citations

31

Authors

20

Institutions

Publications per year

2017–2026

1

Authors

31

  1. MW
    Marianne Winslett

    University of Illinois Urbana-Champaign, United States

    3 publications · 51 citations

    3

    h-index

  2. KS
    Kent Seamons

    Brigham Young University, United States

    3 publications · 51 citations

    3

    h-index

  3. DD
    Daniel D. Sleator

    Carnegie Mellon University, United States

    2 publications · 1.1K citations

    2

    h-index

  4. NS
    Neil Sarnak

    Princeton University, United States

    2 publications · 1.1K citations

    2

    h-index

  5. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 1.1K citations

    2

    h-index

1–5 of 31

Venues

  1. Journal of Functional Programming

    1 publications · 23 citations

    1

    h-index

  2. Journal of Computer and System Sciences

    1 publications · 427 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 18 citations

    1

    h-index

  4. Conference on High Performance Computing (Supercomputing)

    Conference · 1 publications · 29 citations

    1

    h-index

  5. Workshop on Algorithms and Data Structures

    Conference · 1 publications · 46 citations

    1

    h-index

1–5