DOCTORAL DISSERTATION DEFENSE
AMORTIZED COMPLEXITY OF DATA STRUCTURES

Candidate: Rajamani Sundar
Advisor: Ravi Boppana
Co-advisor: Richard Cole
2:30 p.m., Friday, May 3, 1991
room 101, Warren Weaver Hall

Abstract

This thesis investigates the amortized complexity of some fundamental data structure problems and introduces interesting ideas for proving lower bounds on amortized complexity and for performing amortized analysis. The problems are as follows: