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
Parents
2
1–2 of 2
6
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 6
8
University of Vienna
Vienna, Austria
1 h-index
3 publications
96 citations

Cornell University
Ithaca, United States
1 h-index
1 publications
20 citations
Technische Universität Berlin
Berlin, Germany
1 h-index
1 publications
32 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
20 citations

International Computer Science Institute
Berkeley, United States
1 h-index
1 publications
20 citations

University of Salzburg
Salzburg, Austria
1 h-index
1 publications
32 citations
Rutgers Sexual and Reproductive Health and Rights
Utrecht, Netherlands
1 h-index
1 publications
32 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
1 h-index
1 publications
20 citations
1–8 of 8
1 publications · 20 citations
1
h-index
Repository · 1 publications · 32 citations
1
h-index
1–2