William M. Hesse  Home/Search
Context Related
| umass.edu/~whesse/thesis.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu/~whesse/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dynamic computational complexity is the study of resource-bounded ongoing computational processes. We consider the general problem of processing a sequence of inputs, rather than a single input. We introduce a new model for dynamic computation, and investigate the computational complexity of various dynamic computations. The field of computational complexity has previously studied static computation, which takes a single fixed input and computes the desired result. We define a dynamic problem... (Update)
Similar documents based on text: More All
0.4: Complete Problems for Dynamic Complexity Classes - Hesse, Immerman (2002) (Correct)
0.2: Time, Hardware, and Uniformity - Barrington, Immerman (Correct)
0.2: Retrieval Of Passages For Information Reduction - DANIELS (1997) (Correct)
BibTeX entry: (Update)
William Hesse. Dynamic Computational Complexity. PhD thesis, University of Massachusetts at Amherst, 1993. http://citeseer.ist.psu.edu/hesse03dynamic.html More
@phdthesis{ hesse-dynamic,
author = "William M. Hesse",
title = "Dynamic Computational Complexity",
school = "Graduate School of the University of Massachusetts Amherst",
year = 2003,
url = "citeseer.ist.psu.edu/hesse03dynamic.html" }
Citations (may not include all citations):280 Online Computation and Competitive Analysis (context) - Allan, Ran - 1998
116 On uniformity within NC - David, Mix et al. - 1990
110 the synthesis of a reactive module (context) - Rosner - 1989
110 Descriptive Complexity (context) - Neil - 1999
103 the synthesis of discrete controllers for timed systems (context) - Pnueli, On - 1995
74 The cell probe complexity of dynamic data structures (context) - Fredman, Saks - 1989
65 Should tables be sorted (context) - Andrew - 1981
57 Systematic derivation of incremental programs - Yanhong, Teitelbaum - 1994
51 On threshold circuits and polynomial computation - John - 1987
49 Solving sequential conditions by finite-state strategies (context) - Buchi, Richard - 1969
46 View maintenance issues for the chronicle data model (context) - Jagadish - 1999
43 Incremental and decremental evaluation of transitive closure.. (context) - Guozhu, Jianwen - 1995
39 Discovering auxiliary information for incremental computatio.. - Yanhong, Stoller et al. - 1996
37 Poly-logarithmic deterministic fully-dynamic algorithms for .. - Jacob, Kristian et al. - 1998
37 Complexity models for incremental computation - Peter, Subramanian et al. - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.umass.edu/~whesse/): More
The Dynamic Complexity of Transitive Closure is in DynTC0 - Hesse (2001) (Correct)
Uniform Circuits for Division: Consequences and Problems - Allender, Barrington, Hesse (2000) (Correct)
Division is in Uniform TC - William Hesse Department (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC