Persistence In Heaps
Persistence in Heaps is a methodological framework in data structure design that enables efficient access to and modification of multiple versions of a heap through the application of persistent techniques, distinguishing it from ephemeral heap implementations by preserving prior versions after updates.
17
Publications
680
Citations
41
Authors
13
Institutions
Publications per year
2017–2026
2
Parents
17
Malcolm Atkinson, Ken Chisholm, Paul Cockshott · ACM SIGPLAN Notices · 1982 · 163 citations
Persistent object management system
W. P. Cockshot, Malcolm Atkinson, Kenneth Chisholm et al. · Software Practice and Experience · 1984 · 107 citations
Algorithms for a persistent heap
Malcolm Atkinson, Ken Chisholm, Paul Cockshott et al. · Software Practice and Experience · 1983 · 55 citations
1–5 of 17
41
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 41
13

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
10 publications
1K citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
92 citations
University of Bern
Bern, Switzerland
1 h-index
2 publications
32 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
2 publications
104 citations

Brunel University of London
London, United Kingdom
1 h-index
3 publications
51 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
3 publications
96 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
2 publications
22 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
31 citations
1–8 of 13
2 publications · 194 citations
2
h-index
2 publications · 162 citations
2
h-index
1 publications · 16 citations
1
h-index
PACMPL · 1 publications · 32 citations
1
h-index
1 publications · 17 citations
1
h-index
1–5