Incremental validation of XML documents, ACM Transactions on Database Systems, vol.29, issue.4, pp.710-751, 2004. ,
DOI : 10.1145/1042046.1042050
Efficient incremental validation of XML documents, Proceedings. 20th International Conference on Data Engineering, pp.671-682, 2004. ,
DOI : 10.1109/ICDE.2004.1320036
Incremental XPath evaluation, ICDT, 2009. ,
Incremental recomputation in local languages, Information and Computation, vol.181, issue.2, pp.88-98, 2003. ,
DOI : 10.1016/S0890-5401(03)00017-8
Deterministic FOIES are strictly weaker, Annals of Mathematics and Artificial Intelligence, vol.19, issue.1/2, pp.127-146, 1997. ,
DOI : 10.1023/A:1018951521198
Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries, Journal of Computer and System Sciences, vol.57, issue.3, pp.289-308, 1998. ,
DOI : 10.1006/jcss.1998.1565
Nonrecursive incremental evaluation of Datalog queries, Annals of Mathematics and Artificial Intelligence, vol.23, issue.2-4, pp.187-223, 1995. ,
DOI : 10.1007/BF01530820
Dynamic tree isomorphism via first-order updates to a relational database, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, pp.235-243, 1998. ,
DOI : 10.1145/275487.275514
Dynamic algorithms for the Dyck languages, WADS, pp.98-108, 1995. ,
Dynamic word problems, Journal of the ACM, vol.44, issue.2, pp.257-271, 1997. ,
DOI : 10.1145/256303.256309
The dynamic complexity of formal languages Available from arXiv:0812, 1915. ,
Conditional and unconditional separations of dynamic complexity classes Unpublished manuscript, available from http, 2003. ,
The Dynamic Complexity of Transitive Closure Is in DynTC??, Theor. Comput. Sci, vol.3, issue.296, pp.473-485, 2003. ,
DOI : 10.1007/3-540-44503-X_16
Dynamic Computational Complexity, 2003. ,
Complete problems for dynamic complexity classes, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.313-324, 2002. ,
DOI : 10.1109/LICS.2002.1029839
Cell probe complexity -a survey, FSTTCS, 1999. ,
Complexity models for incremental computation, Theoretical Computer Science, vol.130, issue.1, pp.203-236, 1994. ,
DOI : 10.1016/0304-3975(94)90159-7
Dyn-FO: A Parallel, Dynamic Complexity Class, Journal of Computer and System Sciences, vol.55, issue.2, pp.199-209, 1997. ,
DOI : 10.1006/jcss.1997.1520
Introduction to Circuit Complexity: A Uniform Approach, 1999. ,
DOI : 10.1007/978-3-662-03927-4
Dynamic Complexity Theory Revisited, Theory of Computing Systems, vol.40, issue.4, pp.355-377, 2007. ,
DOI : 10.1007/s00224-006-1312-0