Persistent Heaps

Persistent Heaps is a persistent data structure that belongs to the class of priority queue implementations, distinguished by its ability to retain previous versions of the heap after insertions, deletions, or updates, thereby supporting efficient access to and operations on historical states.

34

Publications

2.7K

Citations

80

Authors

28

Institutions

Publications per year

2017–2026

6

Authors

80

  1. DN
    Dushyanth Narayanan

    Microsoft Research (United Kingdom), United Kingdom

    4 publications · 298 citations

    4

    h-index

  2. OH
    Orion Hodson

    Microsoft (United States), United States

    4 publications · 298 citations

    4

    h-index

  3. SS
    Steven Swanson

    University of California San Diego, United States

    3 publications · 837 citations

    3

    h-index

  4. MA
    Malcolm Atkinson

    University of Edinburgh, United Kingdom

    3 publications · 325 citations

    3

    h-index

  5. JC
    Joel Coburn

    University of California San Diego, United States

    3 publications · 837 citations

    3

    h-index

1–5 of 80

Venues

  1. ACM SIGPLAN Notices

    3 publications · 244 citations

    3

    h-index

  2. Software Practice and Experience

    2 publications · 162 citations

    2

    h-index

  3. ACM SIGARCH Computer Architecture News

    2 publications · 139 citations

    2

    h-index

  4. ACM Transactions on Storage

    TOS · 1 publications · 49 citations

    1

    h-index

  5. 1

    h-index

1–5