Dyn-FO: A Parallel, Dynamic Complexity Class

This publication has 27 references indexed in Scilit:

• Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries
  Information and Computation, 1995
• Maintaining views incrementally
  Published by Association for Computing Machinery (ACM) ,1993
• Sparsification-a technique for speeding up dynamic graph algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
  Journal of Computer and System Sciences, 1989
• The cell probe complexity of dynamic data structures
  Published by Association for Computing Machinery (ACM) ,1989
• Descriptive and computational complexity
  Proceedings of Symposia in Applied Mathematics, 1989
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
  SIAM Journal on Computing, 1985
• Parity, circuits, and the polynomial-time hierarchy
  Theory of Computing Systems, 1984
• ∑11-Formulae on finite structures
  Annals of Pure and Applied Logic, 1983
• Structure and complexity of relational queries
  Journal of Computer and System Sciences, 1982