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
127
On the Average Number of Maxima in a Set of Vectors and Applications
Jon Bentley, H. T. Kung, Mario Schkolnick et al. · Journal of the ACM · 1978 · 372 citations · Full text
Two algorithms for maintaining order in a list
Paul F. Dietz, Daniel D. Sleator · 1987 · 324 citations · Full text
1–5 of 127
227
14
h-index
12
h-index
7
h-index
5
h-index
4
h-index
1–5 of 227
124
Carnegie Mellon University
Pittsburgh, United States
14 h-index
23 publications
2.3K citations
Princeton University
Princeton, United States
9 h-index
16 publications
474 citations
Yale University
New Haven, United States
8 h-index
13 publications
750 citations
Ludwig-Maximilians-Universität München
Munich, Germany
8 h-index
15 publications
1.2K citations

University of St Andrews
St Andrews, United Kingdom
5 h-index
9 publications
350 citations

University of Waterloo
Waterloo, Canada
4 h-index
5 publications
158 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
5 publications
110 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
92 citations
1–8 of 124
7 publications · 373 citations
7
h-index
JACM · 5 publications · 545 citations
5
h-index
5 publications · 168 citations
5
h-index
Repository · 4 publications · 166 citations
4
h-index
3 publications · 2.3K citations
3
h-index
1–5