Dynamic Heaps
Dynamic Heaps is a dynamic data structure that extends the traditional heap by supporting efficient insertion, deletion, and key更新 operations while maintaining the heap property under arbitrary modifications to the priority values of elements.
32
Publications
1.9K
Citations
74
Authors
38
Institutions
Publications per year
2017–2026
1
Parents
32
The pairing heap: A new form of self-adjusting heap
Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator et al. · Algorithmica · 1986 · 274 citations
Maria Jump, Kathryn S. McKinley · ACM SIGPLAN Notices · 2007 · 114 citations
1–5 of 32
74
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 74
38
The University of Texas at Austin
Austin, United States
2 h-index
4 publications
422 citations
AT&T (United States)
Bedminster, United States
2 h-index
4 publications
688 citations
Ericsson (Sweden)
Kista, Sweden
2 h-index
2 publications
50 citations

McGill University
Montreal, Canada
2 h-index
4 publications
202 citations
Princeton University
Princeton, United States
2 h-index
3 publications
648 citations
National University of Computer and Emerging Sciences
Islamabad, Pakistan
1 h-index
3 publications
1.1K citations
National Technical University of Athens
Athens, Greece
1 h-index
1 publications
13 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
33 citations
1–8 of 38
2 publications · 145 citations
2
h-index
1 publications · 27 citations
1
h-index
PRL · 1 publications · 204 citations
1
h-index
1 publications · 70 citations
1
h-index
1 publications · 15 citations
1
h-index
1–5