This thesis gives some background and an introduction on dynamic complexity theory, a subfield of descriptive complexity theory in which queries on databases are maintained dynamically upon insertions and deletions to the database. The basic definitions of the dynamic complexity framework are given along with examples of queries maintainable with dynamic queries and a comparison of different dynamic complexity classes
Dynamic computational complexity is the study of resource-bounded ongoing computational processes. W...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
The present paper investigates the dynamic complexity of document spanners, a formal framework for i...
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where t...
The re-evaluation of a query result after modifying a large database can be a time-consuming process...
In many modern data management scenarios, data is subject to frequent changes. In order to avoid cos...
Traditionally, computational complexity has considered only static problems. Classical Complexity Cl...
In the first part of the thesis, we characterize exactly the expressiveness of a family of typed dat...
This paper studies dynamic complexity under definable change operations in the DynFO framework by Pa...
Dynamic computational complexity is the study of resource bounded dynamic computation. We study the ...
Dynamic complexity classes such as DynFO, described by Immerman and Patnaik, have problems which are...
. This progress report surveys some of my scientific work on part A of the Ph.D.-programme at the C...
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over str...
AbstractThis paper presents a fully dynamic algorithm for maintaining the transitive closure of a bi...
To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained co...
Dynamic computational complexity is the study of resource-bounded ongoing computational processes. W...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
The present paper investigates the dynamic complexity of document spanners, a formal framework for i...
Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where t...
The re-evaluation of a query result after modifying a large database can be a time-consuming process...
In many modern data management scenarios, data is subject to frequent changes. In order to avoid cos...
Traditionally, computational complexity has considered only static problems. Classical Complexity Cl...
In the first part of the thesis, we characterize exactly the expressiveness of a family of typed dat...
This paper studies dynamic complexity under definable change operations in the DynFO framework by Pa...
Dynamic computational complexity is the study of resource bounded dynamic computation. We study the ...
Dynamic complexity classes such as DynFO, described by Immerman and Patnaik, have problems which are...
. This progress report surveys some of my scientific work on part A of the Ph.D.-programme at the C...
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over str...
AbstractThis paper presents a fully dynamic algorithm for maintaining the transitive closure of a bi...
To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained co...
Dynamic computational complexity is the study of resource-bounded ongoing computational processes. W...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
The present paper investigates the dynamic complexity of document spanners, a formal framework for i...