Deamortization

Deamortization is a theoretical framework in algorithm analysis that transforms amortized bounds into worst-case guarantees for individual operations by redistributing computational costs across a sequence of operations in a deterministic and online manner.

2

Publications

52

Citations

6

Authors

8

Institutions

Publications per year

2017–2026

1

Authors

6

  1. MH
    Monika Henzinger

    University of Vienna, Austria

    1 publications · 32 citations

    1

    h-index

  2. EJ
    Eric J. Friedman

    Cornell University, United States

    1 publications · 20 citations

    1

    h-index

  3. AB
    Aaron Bernstein

    Massachusetts Institute of Technology, United States

    1 publications · 32 citations

    1

    h-index

  4. JY
    Joseph Y. Halpern

    Cornell University, United States

    1 publications · 20 citations

    1

    h-index

  5. SF
    Sebastian Forster

    University of Salzburg, Austria

    1 publications · 32 citations

    1

    h-index

1–5 of 6

Venues

  1. Distributed Computing

    1 publications · 20 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 32 citations

    1

    h-index

1–2