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

Authors

10

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 294 citations

    2

    h-index

  2. AE
    Amr Elmasry

    Max Planck Institute for Informatics, Germany

    2 publications · 30 citations

    2

    h-index

  3. JS
    John Stasko

    Georgia Institute of Technology, United States

    1 publications · 81 citations

    1

    h-index

  4. JS
    Jeffrey Scott Vitter

    Duke University, United States

    1 publications · 81 citations

    1

    h-index

  5. SS
    Siddhartha Sen

    Princeton University, United States

    1 publications · 20 citations

    1

    h-index

1–5 of 10

Venues

  1. SIAM Journal on Computing

    2 publications · 34 citations

    2

    h-index

  2. Algorithmica

    1 publications · 274 citations

    1

    h-index

  3. Communications of the ACM

    1 publications · 81 citations

    1

    h-index

  4. 1

    h-index

1–4