loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
Turku, Finland
July 13-July 17
ISBN: 0-7695-2192-4
ASCII Text
x 
 
Robert Harper, "Self-Adjusting Computation," Logic in Computer Science, Symposium on, pp. 254-255, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2004.1319619,
author = {Robert Harper},
title = {Self-Adjusting Computation},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2004},
issn = {1043-6871},
pages = {254-255},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319619},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Self-Adjusting Computation
SN - 1043-6871
SP254
EP255
A1 - Robert Harper,
PY - 2004
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Robert Harper, Carnegie Mellon University, Pittsburgh, PA
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.
Citation:
Robert Harper, "Self-Adjusting Computation," lics, pp.254-255, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.