![]() |
CiteULike | ![]() |
spl's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Incremental algorithms on listsby: Johan Jeuring
edited by: Jan van Leeuwen |
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIncremental computations can improve the performance of interactive programs such as spreadsheet programs, program development environments, text editors, etc.Incremental algorithms describe how to compute a required value depending on the input, after the input has been edited. By considering the possible different edit actions on the data type lists, the basic data type used in spreadsheet programs and text editors, we define incremental algorithms on lists. Some theory for the construction of incremental algorithms is developed, and we give an incremental algorithm for a more involved example: formatting a text.
BibTeX record
RIS record