Marcin Jurdzinski

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1): 23-38 (2013)

John Fearnley, Marcin Jurdzinski: Reachability in Two-Clock Timed Automata is PSPACE-complete. CoRR abs/1302.3109 (2013)

Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet: Almost-Sure Model-Checking of Reactive Timed Automata. QEST 2012: 138-147

Marcin Jurdzinski, Dejan Nickovic (Eds.): Formal Modeling and Analysis of Timed Systems - 10th International Conference, FORMATS 2012, London, UK, September 18-20, 2012. Proceedings. Lecture Notes in Computer Science 7595, Springer 2012, isbn 978-3-642-33364-4

Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski: Average-price-per-reward games on hybrid automata with strong resets. STTT 13(6): 553-569 (2011)

Marcin Jurdzinski, Ranko Lazic: Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12(3): 19 (2011)

John Fearnley, Marcin Jurdzinski, Rahul Savani: Linear Complementarity Algorithms for Infinite Games. SOFSEM 2010: 382-393

Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Trivedi: Concavely-Priced Probabilistic Timed Automata. CONCUR 2009: 415-430

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192

Marcin Jurdzinski: Algorithms for Solving Infinite Games. SOFSEM 2009: 46-48

Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI 2009: 167-181

Marcin Jurdzinski, Ashutosh Trivedi: Reachability-time games on timed automata. CoRR abs/0907.3414 (2009)

John Fearnley, Marcin Jurdzinski, Rahul Savani: Linear Complementarity Algorithms for Infinite Games. CoRR abs/0909.5653 (2009)

Marcin Jurdzinski, Ashutosh Trivedi: Average-Time Games on Timed Automata. CoRR abs/0910.2891 (2009)

Marcin Jurdzinski, Jeremy Sproston, François Laroussinie: Model Checking Probabilistic Timed Automata with One or Two Clocks. Logical Methods in Computer Science 4(3) (2008)

Marcin Jurdzinski, Mike Paterson, Uri Zwick: A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38(4): 1519-1532 (2008)

Marcin Jurdzinski, Rahul Savani: A Simple P-Matrix Linear Complementarity Problem for Discounted Games. CiE 2008: 283-293

Marcin Jurdzinski, Ashutosh Trivedi: Concavely-Priced Timed Automata. FORMATS 2008: 48-62

Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS 2008: 63-77

Marcin Jurdzinski, Ashutosh Trivedi: Average-Time Games. FSTTCS 2008: 340-351

P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel (Eds.): Equilibrium Computation, 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings 07471, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008

Marcin Jurdzinski, Ranko Lazic: Alternating Automata on Data Trees and XPath Satisfiability. CoRR abs/0805.0330 (2008)

Marcin Jurdzinski, François Laroussinie, Jeremy Sproston: Model Checking Probabilistic Timed Automata with One or Two Clocks. CoRR abs/0809.0060 (2008)

P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007

Marcin Jurdzinski, Ashutosh Trivedi: Reachability-Time Games on Timed Automata. ICALP 2007: 838-849

Marcin Jurdzinski, Ranko Lazic: Alternation-free modal mu-calculus for data trees. LICS 2007: 131-140

Marcin Jurdzinski, François Laroussinie, Jeremy Sproston: Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS 2007: 170-184

Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with secure equilibria. Theor. Comput. Sci. 365(1-2): 67-82 (2006)

Marcin Jurdzinski, Mike Paterson, Uri Zwick: A deterministic subexponential algorithm for solving parity games. SODA 2006: 117-123

Marcin Jurdzinski, Doron Peled, Hongyang Qu: Calculating Probabilities of Real-Time Test Cases. FATES 2005: 134-151

Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Mean-Payoff Parity Games. LICS 2005: 178-187

Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski: On Nash Equilibria in Stochastic Games. CSL 2004: 26-40

Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with Secure Equilibria. FMCO 2004: 141-161

Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with Secure Equilibria. LICS 2004: 160-169

Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Quantitative stochastic parity games. SODA 2004: 121-130

Marcin Jurdzinski, Mogens Nielsen, Jirí Srba: Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184(2): 343-368 (2003)

Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Simple Stochastic Parity Games. CSL 2003: 100-113

Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, Marcin Jurdzinski, Freddy Y. C. Mang: Interface Compatibility Checking for Software Modules. CAV 2002: 428-441

Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger: Trading Probability for Fairness. CSL 2002: 292-305

Jens Vöge, Marcin Jurdzinski: A Discrete Strategy Improvement Algorithm for Solving Parity Games. CAV 2000: 202-215

Marcin Jurdzinski: Small Progress Measures for Solving Parity Games. STACS 2000: 290-301

Marcin Jurdzinski, Mogens Nielsen: Hereditary History Preserving Bisimilarity Is Undecidable. STACS 2000: 358-369

Marcin Jurdzinski: Deciding the Winner in Parity Games is in UP \cap co-Up. Inf. Process. Lett. 68(3): 119-124 (1998)

Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz: How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110