@techreport{ramalingam1991on,
author = {Ramalingam, G. and Reps, Thomas},
title = {On the Computational Complexity of Incremental Algorithms},
year = {1991},
month = {August},
abstract = {Our results, together with some previously known ones, shed light on the organization of the complexity hierarchy that exists when incremental-computation problems are classified according to their incremental complexity with respect to locally persistent algorithms. In particular, these results separate the classes of P-time incremental problems, inherently Exp~ time incremental problems, and non-incremental problems.},
publisher = {University of Wisconsin-Madison, Computer Sciences Department},
url = {http://approjects.co.za/?big=en-us/research/publication/computational-complexity-incremental-algorithms/},
number = {CS-TR-1033},
}