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
Parents
127
Self-adjusting binary search trees
Daniel D. Sleator, Robert E. Tarjan · Journal of the ACM · 1985 · 1.2K citations · Full text
Amortized Computational Complexity
Robert E. Tarjan · SIAM Journal on Algebraic and Discrete Methods · 1985 · 525 citations
1–5 of 127
241
10
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 241
128
Princeton University
Princeton, United States
8 h-index
9 publications
476 citations

University of Waterloo
Waterloo, Canada
7 h-index
8 publications
197 citations
AT&T (United States)
Bedminster, United States
6 h-index
8 publications
7.4K citations
University of Copenhagen
Copenhagen, Denmark
4 h-index
7 publications
1.2K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
7 publications
170 citations
Max Planck Society
Munich, Germany
4 h-index
5 publications
110 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
6 publications
227 citations

Aarhus University
Aarhus, Denmark
4 h-index
5 publications
450 citations
1–8 of 128
11 publications · 1.2K citations
11
h-index
TALG · 6 publications · 338 citations
6
h-index
Repository · 5 publications · 118 citations
5
h-index
JACM · 4 publications · 1.8K citations
4
h-index
Repository · 4 publications · 82 citations
4
h-index
1–5