{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:39:00Z","timestamp":1725514740282},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694052"},{"type":"electronic","value":"9783540694076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69407-6_1","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T09:39:35Z","timestamp":1213090775000},"page":"1-10","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic Graphical Games Revisited"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Andersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Bjerre","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An O(n logn) sorting network. In: Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0899-8256(02)00545-6","volume":"45","author":"R.J. Aumann","year":"2003","unstructured":"Aumann, R.J.: Presidential address at the First International Congress of the Game Theory Society. Games and Economic Behavior\u00a045, 2\u201314 (2003)","journal-title":"Games and Economic Behavior"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Linear time bounds for median computations. In: Proceedings of the 4th Annual ACM Symposium on the Theory of Computing, pp. 119\u2013124 (1972)","DOI":"10.1145\/800152.804904"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Information and Computation\u00a096, 203\u2013224 (1992)","journal-title":"Information and Computation"},{"issue":"1-2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the \u03bc-calculus and its fragments. Theor. Comput. Sci.\u00a0258(1-2), 491\u2013522 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR6","series-title":"Annals of Mathematical Studies","volume-title":"Contributions to the Theory of Games","author":"H. Everett","year":"1957","unstructured":"Everett, H.: Recursive games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematical Studies, vol.\u00a0III(39), Princeton University Press, Princeton (1957)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"H.N. Gabow","year":"1988","unstructured":"Gabow, H.N., Tarjan, R.E.: Algorithms for two bottleneck optimization problems. J. Algorithms\u00a09, 411\u2013417 (1988)","journal-title":"J. Algorithms"},{"key":"1_CR8","volume-title":"Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths","author":"E.A. Heinz","year":"1999","unstructured":"Heinz, E.A.: Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"1_CR9","unstructured":"Kearns, M., Littman, M.L., Singh, S.: Graphical models for game theory. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 253\u2013260 (2001)"},{"key":"1_CR10","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02253463","volume":"56","author":"A.P. Punnen","year":"1996","unstructured":"Punnen, A.P.: A fast algorithm for a class of bottleneck problems. Computing\u00a056, 397\u2013401 (1996)","journal-title":"Computing"},{"issue":"10","key":"1_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.2003.1236468","volume":"36","author":"J. Romein","year":"2003","unstructured":"Romein, J., Bal, H.: Solving the game of awari using parallel retrograde analysis. IEEE Computer\u00a036(10), 26\u201333 (2003)","journal-title":"IEEE Computer"},{"issue":"3","key":"1_CR13","first-page":"131","volume":"9","author":"K. Thompson","year":"1986","unstructured":"Thompson, K.: Retrograde analysis of certain endgames. Journal of the International Computer Chess Association\u00a09(3), 131\u2013139 (1986)","journal-title":"Journal of the International Computer Chess Association"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02810663","volume":"119","author":"N. Vieille","year":"2000","unstructured":"Vieille, N.: Two-player stochastic games I: A reduction. Israel Journal of Mathematics\u00a0119, 55\u201391 (2000)","journal-title":"Israel Journal of Mathematics"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02810664","volume":"119","author":"N. Vieille","year":"2000","unstructured":"Vieille, N.: Two-player stochastic games II: The case of recursive games. Israel Journal of Mathematics\u00a0119, 93\u2013126 (2000)","journal-title":"Israel Journal of Mathematics"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/0022-247X(90)90267-J","volume":"153","author":"A.R. Washburn","year":"1990","unstructured":"Washburn, A.R.: Deterministic graphical games. Journal of Mathematical Analysis and Applications\u00a0153, 84\u201396 (1990)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"1\u20132","key":"1_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.S.: The complexity of mean payoff games on graphs. Theoretical Computer Science\u00a0158(1\u20132), 343\u2013359 (1996)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic and Theory of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69407-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:38:22Z","timestamp":1620002302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69407-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694052","9783540694076"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69407-6_1","relation":{},"subject":[]}}