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
Parents
34
Joel Coburn, Adrian M. Caulfield, Ameen Akel et al. · 2011 · 658 citations
Dushyanth Narayanan, Orion Hodson · 2012 · 239 citations
Malcolm Atkinson, Ken Chisholm, Paul Cockshott · ACM SIGPLAN Notices · 1982 · 163 citations
Joel Coburn, Adrian M. Caulfield, Ameen Akel et al. · ACM SIGARCH Computer Architecture News · 2011 · 118 citations
1–5 of 34
80
Microsoft Research (United Kingdom), United Kingdom
4 publications · 298 citations
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 80
28
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
155 citations
University of California San Diego
San Diego, United States
3 h-index
21 publications
5.9K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
3 h-index
3 publications
280 citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
10 publications
1K citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
3 publications
61 citations
IBM Research - Haifa
Haifa, Israel
2 h-index
2 publications
51 citations

University of Rochester
Rochester, United States
2 h-index
11 publications
268 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
92 citations
1–8 of 28
3 publications · 244 citations
3
h-index
2 publications · 162 citations
2
h-index
2 publications · 139 citations
2
h-index
TOS · 1 publications · 49 citations
1
h-index
Conference · 1 publications · 18 citations
1
h-index
1–5