Demri, Stéphane P., 1967-, Jurdzinski, Marcin, Lachish, Oded and Lazic, Ranko. (2013) The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences, 79 (1). pp. 23-38. ISSN 0022-0000

Rutkowski, Michał, Ph.D., Lazić, Ranko and Jurdzinski, Marcin. (2011) Average-price-per-reward games on hybrid automata with strong resets. International Journal on Software Tools for Technology Transfer, Vol.13 (No.6). pp. 553-569. ISSN 1433-2779

Jurdzinski, Marcin and Lazic, Ranko. (2011) Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic (TOCL), Volume 12 (Number 3). pp. 1-21. ISSN 1529-3785

Fearnley, John, Jurdzinski, Marcin and Savani, Rahul (2010) Linear complementarity algorithms for infinite games. In: 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Republic, January 23-29, 2010. Published in: Lecture Notes in Computer Science, Vol.5901 pp. 382-393.

Jurdzinski, Marcin (2009) Algorithms for solving infinite games. In: 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Republic, January 24-30, 2009. Published in: Lecture Notes in Computer Science, Vol.5404 pp. 46-48.

Jurdzinski, Marcin, Lazic, Ranko and Rutkowski, Michał, Ph.D. (2009) Average-price-per-reward games on hybrid automata with strong resets. In: 10th International Conference on Verification, Model Checking, and Abstract Interpretation, Savannah, GA, January 18-20, 2009. Published in: Lecture Notes in Computer Science, Vol.5403 pp. 167-181.

Lazic, Ranko, Jurdzinski, Marcin and Rutkowski, Michał, Ph.D. (2009) Average-price-per-reward games on hybrid automata with strong resets. In: Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science (5403). London: Springer, pp. 167-181. ISBN 9783540938996

Jurdzinski, Marcin, Kwiatkowska, Marta, Norman, Gethin and Trivedi, Ashutosh (2009) Concavely-priced probabilistic timed automata. In: 30th International Conference on Concurrency Theory, Bologna, Italy, September 01-04, 2009. Published in: Lecture Notes in Computer Science, Vol.5710 pp. 415-430.

Jurdzinski, Marcin, Sproston, Jeremy, Laroussinie, Francois and Huth, Michael. (2008) Model checking probabilistic timed automata with one or two clocks. Logical Methods in Computer Science, Vol.4 (No.3). p. 12. ISSN 1860-5974

Bouyer, Patricia, Brihaye, Thomas, Jurdzinski, Marcin, Lazic, Ranko and Rutkowski, Michał, Ph.D. (2008) Average-price and reachability-price games on hybrid automata with strong resets. In: 6th International Conference on Formal Modeling and Analysis of Timed Systems, St Malo, France, 15-17 September, 2008. Published in: Lecture Notes in Computer Science, 5215 pp. 63-77.

Jurdzinski, Marcin and Trivedi, Ashutosh (2008) Average-time games. In: 28th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, 9-11 Dec 2008. Published in: Leibniz International Proceedings in Informatics, Vol.2 pp. 340-351.

Jurdzinski, Marcin and Trivedi, Ashutosh (2008) Concavely-Priced Timed Automata (Extended Abstract). In: 6th International Conference on Formal Modeling and Analysis of Timed Systems, St Malo, France, Sep 15-17, 2008. Published in: Lecture Notes in Computer Science, Vol.5215 pp. 48-62.

Jurdzinski, Marcin, Laroussinie, Francois and Sproston, Jeremy. (2008) Model checking probabilistic timed automata with one or two clocks. Logical Methods in Computer Science, Vol.4 (No.3). Article no.12 . ISSN 1860-5974

Jurdzinski, Marcin, Paterson, Michael S. and Zwick, Uri, 1961-. (2008) A deterministic subexponential algorithm for solving parity games. SIAM Journal on Computing, Vol.38 (No.4). pp. 1519-1532. ISSN 0097-5397

Jurdzinski, Marcin, Paterson, Mike and Zwick, Uri (2006) A deterministic subexponential algorithm for solving parity games. In: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, Jan 2006. Published in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 117-123.