Fibonacci Heap Analysis

Fibonacci Heap Analysis is a theoretical framework in amortized analysis that characterizes the efficiency of heap operations in terms of aggregate performance bounds, distinguished by its use of potential functions to justify the amortized costs of insert, decrease-key, and extract-min operations in Fibonacci heaps.

8

Publications

256

Citations

17

Authors

12

Institutions

Publications per year

2017–2026

2

Authors

17

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 44 citations

    2

    h-index

  2. SS
    Siddhartha Sen

    Princeton University, United States

    1 publications · 20 citations

    1

    h-index

  3. BY
    Budi Yulianto

    Binus University, Indonesia

    1 publications · 12 citations

    1

    h-index

  4. NI
    Nikola Ivković

    University of Zagreb, Croatia

    1 publications · 47 citations

    1

    h-index

  5. RK
    Ranjan Kumar Dash

    Odisha University of Technology and Research

    1 publications · 47 citations

    1

    h-index

1–5 of 17

Venues

  1. IEEE Access

    1 publications · 47 citations

    1

    h-index

  2. 1

    h-index

  3. Communications of the ACM

    1 publications · 81 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 20 citations

    1

    h-index

  5. 1

    h-index

1–5