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

Authors

74

  1. MJ
    Maria Jump

    The University of Texas at Austin, United States

    2 publications · 211 citations

    2

    h-index

  2. KS
    Kathryn S. McKinley

    The University of Texas at Austin, United States

    2 publications · 211 citations

    2

    h-index

  3. SM
    Soo‐Mook Moon

    Seoul National University, South Korea

    1 publications · 26 citations

    1

    h-index

  4. SS
    Sjaak Smetsers

    Radboud University Nijmegen, Netherlands

    1 publications · 16 citations

    1

    h-index

  5. EA
    Erik Aurell

    KTH Royal Institute of Technology, Sweden

    1 publications · 27 citations

    1

    h-index

1–5 of 74

Venues

  1. ACM SIGPLAN Notices

    2 publications · 145 citations

    2

    h-index

  2. Journal of Computational Physics

    1 publications · 27 citations

    1

    h-index

  3. Physical Review Letters

    PRL · 1 publications · 204 citations

    1

    h-index

  4. INFORMS journal on computing

    1 publications · 70 citations

    1

    h-index

  5. Journal of Functional Programming

    1 publications · 15 citations

    1

    h-index

1–5