Amortized Complexity

Amortized Complexity is an analytical metric within the study of algorithms that characterizes the average time or resource cost per operation over a sequence of operations, accounting for the worst-case distribution of costly operations within that sequence.

127

Publications

10.8K

Citations

241

Authors

128

Institutions

Publications per year

2017–2026

22

Authors

241

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    10 publications · 4.5K citations

    10

    h-index

  2. TM
    Timothy M. Chan

    University of Waterloo, Canada

    6 publications · 162 citations

    6

    h-index

  3. DD
    Daniel D. Sleator

    Carnegie Mellon University, United States

    5 publications · 3.6K citations

    5

    h-index

  4. MT
    Mikkel Thorup

    AT&T (United States), United States

    4 publications · 594 citations

    4

    h-index

  5. AE
    Amr Elmasry

    Max Planck Institute for Informatics, Germany

    4 publications · 60 citations

    4

    h-index

1–5 of 241

Venues

  1. SIAM Journal on Computing

    11 publications · 1.2K citations

    11

    h-index

  2. ACM Transactions on Algorithms

    TALG · 6 publications · 338 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 5 publications · 118 citations

    5

    h-index

  4. Journal of the ACM

    JACM · 4 publications · 1.8K citations

    4

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 82 citations

    4

    h-index

1–5