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
Parents
8
John Stasko, Jeffrey Scott Vitter · Communications of the ACM · 1987 · 81 citations · Full text
Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach
Swati Lipsa, Ranjan Kumar Dash, Nikola Ivković et al. · IEEE Access · 2023 · 47 citations · Full text
Haim Kaplan, Robert E. Tarjan · ACM Transactions on Algorithms · 2008 · 24 citations
Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan · SIAM Journal on Computing · 2011 · 20 citations
1–5 of 8
17
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 17
12

Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
24 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
15 citations
KU Leuven
Leuven, Belgium
1 h-index
3 publications
129 citations
Istinye University
Istanbul, Türkiye
1 h-index
1 publications
47 citations
Hewlett-Packard (United States)
Palo Alto, United States
1 h-index
1 publications
24 citations
Odisha University of Technology and Research
Bhubaneswar, India
1 h-index
2 publications
94 citations
Hengyang Normal University
Hengyang, China
1 h-index
1 publications
14 citations
Princeton University
Princeton, United States
1 h-index
1 publications
24 citations
1–8 of 12
1 publications · 47 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 81 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 15 citations
1
h-index
1–5