Amortized Analysis

Amortized Analysis is a method in algorithm analysis that characterizes the average time complexity of a sequence of operations by attributing to each operation a cost that reflects the total workload spread over the sequence, rather than the maximum cost of any single operation.

127

Publications

8.4K

Citations

227

Authors

124

Institutions

Publications per year

2017–2026

23

Authors

227

  1. JH
    Jan Hoffmann

    Carnegie Mellon University, United States

    15 publications · 828 citations

    14

    h-index

  2. RE
    Robert E. Tarjan

    Princeton University, United States

    12 publications · 2.5K citations

    12

    h-index

  3. DD
    Daniel D. Sleator

    Carnegie Mellon University, United States

    7 publications · 2.6K citations

    7

    h-index

  4. SJ
    Steffen Jost

    Ludwig-Maximilians-Universität München, Germany

    5 publications · 196 citations

    5

    h-index

  5. MH
    Martin Hofmann

    Ludwig-Maximilians-Universität München, Germany

    4 publications · 379 citations

    4

    h-index

1–5 of 227

Venues

  1. SIAM Journal on Computing

    7 publications · 373 citations

    7

    h-index

  2. Journal of the ACM

    JACM · 5 publications · 545 citations

    5

    h-index

  3. ACM SIGPLAN Notices

    5 publications · 168 citations

    5

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 166 citations

    4

    h-index

  5. Communications of the ACM

    3 publications · 2.3K citations

    3

    h-index

1–5