{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:20:34Z","timestamp":1781893234215,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_24","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"290-301","source":"Crossref","is-referenced-by-count":184,"title":["Small Progress Measures for Solving Parity Games"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"issue":"1\u20132","key":"24_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(96)00228-9","volume":"178","author":"A. Browne","year":"1997","unstructured":"A. Browne, E. M. Clarke, S. Jha, D. E. Long, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. Theoretical Computer Science, 178(1\u20132):237\u2013255, May 1997.","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (Extended abstract). In Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pages 368\u2013377. IEEE Computer Society Press, 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification, 5th International Conference, CAV\u201993","author":"E. A. Emerson","year":"1993","unstructured":"E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of \u03bc-calculus. In Costas Courcoubetis, editor, Computer Aided Verification, 5th International Conference, CAV\u201993, volume 697 of LNCS, pages 385\u2013396, Elounda, Greece, June\/July 1993. Springer-Verlag."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/SFCS.1988.21949","volume-title":"Proceedings of 29th Annual Symposium on Foundations of Computer Science","author":"E. A. Emerson","year":"1988","unstructured":"E. Allen Emerson and Charanjit S. Jutla. The complexity of tree automata and logics of programs. In Proceedings of 29th Annual Symposium on Foundations of Computer Science, pages 328\u2013337, White Plains, New York, 24\u201326 October 1988. IEEE Computer Society Press."},{"key":"24_CR5","unstructured":"E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus (Extended abstract). In Proceedings, Symposium on Logic in Computer Science, pages 267\u2013278, Cambridge, Massachusetts, 16\u201318 June 1986. IEEE."},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzi\u0144ski","year":"1998","unstructured":"Marcin Jurdzi\u0144ski. Deciding the winner in parity games is in UP \u2229 co-UP. Information Processing Letters, 68(3):119\u2013124, November 1998.","journal-title":"Information Processing Letters"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Nils Klarlund. Progress measures for complementation of \u03c9-automata with applications to temporal logic. In 32nd Annual Symposium on Foundations of Computer Science, pages 358\u2013367, San Juan, Puerto Rico, 1\u20134 October 1991. IEEE.","DOI":"10.1109\/SFCS.1991.185391"},{"issue":"2\u20133","key":"24_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0168-0072(94)90086-8","volume":"69","author":"N. Klarlund","year":"1994","unstructured":"Nils Klarlund. Progress measures, immediate determinacy, and a subset construction for tree automata. Annals of Pure and Applied Logic, 69(2\u20133):243\u2013268, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Nils Klarlund and Dexter Kozen. Rabin measures and their applications to fairness and automata theory. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 256\u2013265, Amsterdam, The Netherlands, 15\u201318 July 1991. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1991.151650"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Orna Kupferman and Moshe Y. Vardi. Weak alternating automata and tree automata emptiness. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 224\u2013233, Dallas, Texas, USA, 23\u201326 May 1998. ACM Press.","DOI":"10.1145\/276698.276748"},{"key":"24_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BFb0054161","volume-title":"Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS\u2019 98","author":"X. Liu","year":"1998","unstructured":"Xinxin Liu, C. R. Ramakrishnan, and Scott A. Smolka. Fully local and efficient evaluation of alternating fixed points. In Bernhard Steffen, editor, Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS\u2019 98, volume 1384 of LNCS, pages 5\u201319, Lisbon, Portugal, 28 March\u20134 April 1998. Springer."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"Robert McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65(2):149\u2013184, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"24_CR13","unstructured":"A. W. Mostowski. Games with forbidden positions. Technical Report 78, University of Gda\u0144sk, 1991."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages (POPL\u2019 89), pages 179\u2013190, Austin, Texas, January 1989. ACM Press.","DOI":"10.1145\/75277.75293"},{"issue":"6","key":"24_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0020-0190(96)00130-5","volume":"59","author":"H. Seidl","year":"1996","unstructured":"Helmut Seidl. Fast and simple nested fixpoints. Information Processing Letters, 59(6):303\u2013308, September 1996.","journal-title":"Information Processing Letters"},{"key":"24_CR16","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"CONCUR\u201995: Concurrency Theory, 6th International Conference","author":"C. Stirling","year":"1995","unstructured":"Colin Stirling. Local model checking games (Extended abstract). In Insup Lee and Scott A. Smolka, editors, CONCUR\u201995: Concurrency Theory, 6th International Conference, volume 962 of LNCS, pages 1\u201311, Philadelphia, Pennsylvania, 21\u201324 August 1995. Springer-Verlag."},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"R. S. Streett","year":"1989","unstructured":"Robert S. Streett and E. Allen Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 81(3):249\u2013264, 1989.","journal-title":"Information and Computation"},{"key":"24_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-61474-5_58","volume-title":"Computer Aided Verification, 8th International Conference, CAV\u201996","author":"I. Walukiewicz","year":"1996","unstructured":"Igor Walukiewicz. Pushdown processes: Games and model checking. In Thomas A. Henzinger and Rajeev Alur, editors, Computer Aided Verification, 8th International Conference, CAV\u201996, volume 1102 of LNCS, pages 62\u201374. Springer-Verlag, 1996. Full version available through http:\/\/zls.mimuw.edu.pl\/~igw ."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Wies\u0142aw Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200:135\u2013183, 1998.","journal-title":"Theoretical Computer Science"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Uri Zwick and Mike Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158:343\u2013359, 1996.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:55:49Z","timestamp":1737341749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}