Complexity models for incremental computation

Theoretical Computer Science

Volumn 130, Issue 1, 1994, Pages 203-236

  Miltersen, Peter Bro ^a   Subramanian, Sairam ^b   Vitter, Jeffrey Scott ^c   Tamassia, Roberto ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b BROWN UNIVERSITY   (United States)

^c DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

COMPLEXITY CLASSES; COMPLEXITY MODELS; INCREMENTAL COMPUTATION;

COMPUTATIONAL COMPLEXITY;

EID: 0028483806     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90159-7     Document Type: Article

References (24)

1. 1
2. Proving relative lower bounds for incremental algorithms
3. The complexity of finite functions
4. Problems complete for deterministic logarithmic space
5. Complexity issues in parallel logic programming
6. Updating distances in dynamic graphs
7. Observations on the complexity of generating quasi-gray codes
8. The complexity of maintaining an array and computing its partial sums
9. The cell probe complexity of dynamic data structures
10. A compendium of problems complete for P
11. A dichromatic framework for balanced trees
12. Nondeterministic Logspace is closed under complement
13. A survey of parallel algorithms for shared memory machines
14. The circuit value problem is Log space complete for P
15. The complexity of circuit value and network stability
16. Optimal dynamization of decomposable searching problems
17. On-line reevaluation of functions
18. A list of P-complete problems
19. Exploring the structure of incremental algorithms
20. A topological approach to dynamic graph connectivity
21. A complexity theory based on boolean algebra
22. A data structure for dynamic trees
23. A new approach to stable matching problems