Pairing Heap Analysis
Pairing Heap Analysis is a methodological framework within amortized analysis that characterizes the efficiency of pairing heaps—self-adjusting priority queue data structures—by examining their sequence of operations through potential function arguments to establish amortized time bounds.
6
Publications
419
Citations
10
Authors
5
Institutions
Publications per year
2017–2026
0
Parents
6
The pairing heap: A new form of self-adjusting heap
Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator et al. · Algorithmica · 1986 · 274 citations
John Stasko, Jeffrey Scott Vitter · Communications of the ACM · 1987 · 81 citations · Full text
Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan · SIAM Journal on Computing · 2011 · 20 citations
Pairing heaps with O(log log n) decrease cost
Amr Elmasry · 2009 · 18 citations
Postorder Disjoint Set Union is Linear
Joan M. Lucas · SIAM Journal on Computing · 1990 · 14 citations
1–5 of 6
10
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 10
5
Max Planck Society
Munich, Germany
1 h-index
1 publications
18 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
274 citations
Princeton University
Princeton, United States
1 h-index
2 publications
548 citations
AT&T (United States)
Bedminster, United States
1 h-index
2 publications
548 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
12 citations
1–5 of 5
2 publications · 34 citations
2
h-index
1 publications · 274 citations
1
h-index
1 publications · 81 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1–4