{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:10:32Z","timestamp":1739304632681,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_41","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"477-488","source":"Crossref","is-referenced-by-count":7,"title":["A Dynamic Algorithm for Reachability Games Played on Trees"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imran","family":"Khaliq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Chatterjee, K., Henzinger, T., Piterman, N.: Algorithms for b\u00fcchi games. In: Proceedings of the 3rd Workshop of Games in Design and Verification (GDV 2006) (2006)"},{"key":"41_CR2","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.: Fully dynamic transitive closure: Breaking through the O(n 2) barrier. In: Proceedings of FOCS 2000, pp. 381\u2013389 (2000)","DOI":"10.1109\/SFCS.2000.892126"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.: A new approach to dynamic all pairs shortest paths. In: Proceedings of STOC 2003, pp. 159\u2013166 (2003)","DOI":"10.1145\/780542.780567"},{"key":"41_CR5","volume-title":"Algorithms and Theoretical Computing Handbook","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D., Galil, Z., Italiano, G.: Dynamic graph algorithms. In: Atallah, M. (ed.) Algorithms and Theoretical Computing Handbook. CRC Press, Boca Raton (1999)"},{"key":"41_CR6","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of WOLLIC 2002","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E.: Model checking games. In: Proceedings of WOLLIC 2002. Electronic Notes in Theoretical Computer Science, vol.\u00a067. Elsevier, Amsterdam (2002)"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","author":"N. Immerman","year":"1981","unstructured":"Immerman, N.: Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences\u00a022, 384\u2013406 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: Proceedings of FOCS 1999, pp. 81\u201391 (1999)","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"41_CR10","series-title":"Monographs in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4400-4","volume-title":"The design and analysis of algorithms","author":"D. Kozen","year":"1992","unstructured":"Kozen, D.: The design and analysis of algorithms. Monographs in computer science. Springer, New York (1992)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Murawski, A.: Reachability games and game semantics: Comparing nondeterministic programs. In: Proceedings of LICS 2008, pp. 353\u2013363 (2008)","DOI":"10.1109\/LICS.2008.24"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: Data structures and network algorithms. Regional Conference Series in Applied Mathematics, vol.\u00a044. SIAM, Philadelphia (1983)","DOI":"10.1137\/1.9781611970265"},{"key":"41_CR13","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"21","volume-title":"Proceedings of the 1st Workshop on Verification of Adaptive Systems, VerAS 2007","author":"F. Radmacher","year":"2007","unstructured":"Radmacher, F., Thomas, W.: A game theoretic approach to the analysis of dynamic networks. In: Proceedings of the 1st Workshop on Verification of Adaptive Systems, VerAS 2007. Electronic Notes in Theoretical Computer Science, vol.\u00a0200(2), pp. 21\u201337. Kaiserslautern, Germany (2007)"},{"key":"41_CR14","unstructured":"Rodity, L.: A faster and simpler fully dynamic transitive closure. In: Proceedings of SODA 2003, pp. 401\u2013412 (2003)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Improved dynamic reachability algorithm for directed graphs. In: Proceedings of FOCS 2002, pp. 679\u2013689 (2002)","DOI":"10.1109\/SFCS.2002.1181993"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proceedings of 36th ACM Symposium on Theory of Computing (STOC 2004), pp. 184\u2013191 (2004)","DOI":"10.1145\/1007352.1007387"},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification (Extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T19:57:21Z","timestamp":1739303841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}