This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ime of a sequence of
data structure operations as a function of the input size.
Ex. Starting from an empty stack implemented with a dynamic table, any
sequence of n push and pop operations takes O(n) time in the worst case. 9 Amortized analysis: applications ・Splay trees.
・Move-to-front list updating.
・Push-relabel algorithm for max flow.
・Path compression for disjoint-set union.
・Structural modifications to red-black trees.
・Security, databases, distributed computing, ...
SIAM J. ALG. DISC. METH.
Vol. 6, No. 2, April 1985 1985 Society for Industrial and Applied Mathematics
016 AMORTIZED COMPUTATIONAL COMPLEXITY*
ROBERT ENDRE TARJANt
Abstract. A powerful technique in the complexity analysis of data structures is amortization, or averaging
over time. Amortized running time is a realistic but robust complexity measure for which we can obtain
surprisingly tight upper and lower bounds on a variety of algorithms. By follo...
View Full Document
This document was uploaded on 02/05/2014.
- Spring '14