I've been interested in looking into the area of de-amortization recently (i.e. finding data structures with matching worst-case and amortized running time bounds, or exhibiting lower bounds against matching the amortized complexity of certain operations with a worst-case bound).

The only reference I've been able to find so far is a survey from COCOON by S.R. Kosaraju and M. Pop.

Are there any other good surveys or set of papers to read regarding de-amortization?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy