{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:11:02Z","timestamp":1740287462868,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_23","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"271-284","source":"Crossref","is-referenced-by-count":1,"title":["Program Complexity of Dynamic LTL Model Checking"],"prefix":"10.1007","author":[{"given":"Detlef","family":"K\u00e4hler","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Wilke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. Journal of Computer and System Sciences\u00a041(3), 274\u2013306 (1990)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR2","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1995.1102","volume":"120","author":"G. Dong","year":"1995","unstructured":"Dong, G., Su, J.: Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation\u00a0120(1), 101\u2013106 (1995)","journal-title":"Information and Computation"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Etessami, K.: Counting quantifiers, successor relations, and logarithmic space. In: IEEE Structure in Complexity Theory Conference, Minneapolis, Minnesota, pp. 2\u201311 (1995)","DOI":"10.1109\/SCT.1995.514723"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Etessami, K.: Dynamic tree isomorphism via first-order updates to a relational database. In: ACM Symposium on Principles of Database Systems (PODS), Seattle, Washington, pp. 235\u2013243 (1998)","DOI":"10.1145\/275487.275514"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-48224-5_9","volume-title":"Automata, Languages and Programming","author":"W. Hesse","year":"2001","unstructured":"Hesse, W.: Division is in uniform TC0. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 104\u2013114. Springer, Heidelberg (2001)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(02)00740-5","volume":"296","author":"W. Hesse","year":"2003","unstructured":"Hesse, W.: The dynamic complexity of transitive closure is in DynTC0. Theoretical Computer Science\u00a0296, 473\u2013485 (2003)","journal-title":"Theoretical Computer Science"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Hesse, W., Immerman, N.: Complete problems for dynamic complexity classes. In: IEEE Symposium on Logic in Computer Science (LICS), Copenhagen, Denmark, pp. 313\u2013324 (2002)","DOI":"10.1109\/LICS.2002.1029839"},{"key":"23_CR9","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, Heidelberg (1999)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Libkin, L., Wong, L.: Incremental recomputation of recursive queries with nested sets and aggregate functions. In: Database Programming Languages (DBPL), Estes Park, Colorado, pp. 222\u2013238 (1997)","DOI":"10.1007\/3-540-64823-2_13"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. In: ACM Symposium on Principles of Database Systems (PODS), Minneapolis, Minnesota, pp. 210\u2013221 (1994)","DOI":"10.1145\/182591.182614"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graphs problems. Theoretical Computer Science\u00a0158, 233\u2013277 (1996)","journal-title":"Theoretical Computer Science"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. In: IEEE Symposium on Foundations of Computer Science (FOCS), Vancouver, Canada, pp. 679\u2013690 (2002)","DOI":"10.1109\/SFCS.2002.1181993"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sokolsky, O.V., Smolka, S.A.: Incremental model checking in the modal mu-calculus. In: International Computer Aided Verification Conference, Stanford, California, pp. 351\u2013363 (1994)","DOI":"10.1007\/3-540-58179-0_67"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Swamy, G.: Incremental methods for FSM traversal. In: International Conference on Computer Design (ICCD), Austin, Texas, pp. 590\u2013595 (1995)","DOI":"10.1109\/ICCD.1995.528928"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Swamy, G.: Incremental Methods for Formal Verification and Logic Synthesis. PhD thesis, University of California, Berkeley (1996)","DOI":"10.2139\/ssrn.3702088"},{"key":"23_CR17","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: IEEE Symposium on Logic in Computer Science (LICS), Cambridge, Massachusetts, pp. 322\u2013331 (1986)"},{"key":"23_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity : a Uniform Approach","author":"H. Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: a Uniform Approach. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T07:59:28Z","timestamp":1740211168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}