{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:40:02Z","timestamp":1750110002951,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544570"},{"type":"electronic","value":"9783662544587"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54458-7_16","type":"book-chapter","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T09:22:57Z","timestamp":1489569777000},"page":"265-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Complexity of the Dyck Reachability"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Jug\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DA Mix Barrington","year":"1990","unstructured":"Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within $$NC^{1}$$. J. Comput. Syst. Sci. 41(3), 274\u2013306 (1990)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR2","unstructured":"Bouyer, P., Jug\u00e9, V.: Dynamic complexity of the Dyck reachability. Research Report arXiv\/1610.07499, Computing Research Repository, October 2016"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-662-47666-6_13","volume-title":"Automata, Languages, and Programming","author":"S Datta","year":"2015","unstructured":"Datta, S., Kulkarni, R., Mukherjee, A., Schwentick, T., Zeume, T.: Reachability is in DynFO. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 159\u2013170. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-47666-6_13"},{"issue":"6","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1093\/logcom\/exp037","volume":"19","author":"S Demri","year":"2009","unstructured":"Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. J. Logic Comput. 19(6), 1541\u20131575 (2009)","journal-title":"J. Logic Comput."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1995.1102","volume":"120","author":"G Dong","year":"1995","unstructured":"Dong, G., Jianwen, S.: Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput. 120(1), 101\u2013106 (1995)","journal-title":"Inf. Comput."},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2287718.2287719","volume":"13","author":"W Gelade","year":"2012","unstructured":"Gelade, W., Marquardt, M., Schwentick, T.: The dynamic complexity of formal languages. ACM Trans. Comput. Logic (TOCL) 13(3), 19 (2012)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"16_CR7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York (1995)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-04081-8_25","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C Haase","year":"2009","unstructured":"Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 369\u2013383. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04081-8_25"},{"issue":"3","key":"16_CR9","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 DynTC$$^0$$. Theoret. Comput. Sci. 296(3), 473\u2013485 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR10","unstructured":"Hesse, W.: Dynamic computational complexity. Ph.D. thesis, Department of Computer Science, University of Massachusetts at Amherst, USA, September 2003"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hesse, W., Immerman, N.: Complete problems for dynamic complexity classes. In: Proceedings of the 17th Annual Symposium on Logic in Computer Science (LICS 2002), pp. 313\u2013322. IEEE Comp. Soc. Press, July 2002","DOI":"10.1109\/LICS.2002.1029839"},{"key":"16_CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Boston (2006)"},{"key":"16_CR13","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","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, New York (1999)"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)90159-7","volume":"130","author":"PB Miltersen","year":"1994","unstructured":"Miltersen, P.B., Subramanian, S., Vitter, J.S., Tamassia, R.: Complexity models for incremental computation. Theoret. Comput. Sci. 130(1), 203\u2013236 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR15","unstructured":"Mu\u00f1oz, P., Vortmeier, N., Zeume, T.: Dynamic graph queries. In: Proceedings of the 19th International Conference on Database Theory, ICDT 2016. Leibniz International Proceedings in Informatics, vol. 48, pp. 14:1\u201314:18. Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jcss.1997.1520","volume":"55","author":"S Patnaik","year":"1997","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO: a parallel, dynamic complexity class. J. Comput. Syst. Sci. 55(2), 199\u2013209 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00224-006-1312-0","volume":"40","author":"V Weber","year":"2007","unstructured":"Weber, V., Schwentick, T.: Dynamic complexity theory revisited. Theory Comput. Syst. 40(4), 355\u2013377 (2007)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54458-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:22:50Z","timestamp":1750108970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54458-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544570","9783662544587"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54458-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}