|
Published Articles >> Table of Contents >> Abstract
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
pp. 254-255
Self-Adjusting Computation
Robert Harper, Carnegie Mellon University, Pittsburgh, PA
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319619
Send link to a friend
| Abstract |
|
A static algorithm is one that computes the result of a query about the output for a single, fixed input. For example, a static sorting algorithm is one that takes as input a set of keys, and permits queries about the relative order of these keys according to some ordering relation. A dynamic, or incremental, algorithm is one that permits queries about the output to be interleaved with operations that incrementally modify the input. For example, a dynamic sorting algorithm is one that would permit insertion or deletion of keys to be interleaved with queries about their relative ordering.
|
 Additional Information
|
Citation:
Robert Harper,
"Self-Adjusting Computation,"
lics,
pp. 254-255,
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04),
2004
|
|
