How Much Memory is Needed to Win Infinite Games? - Stefan Dziembowski; Marcin Jurdzinski; Igor Walukiewicz (LICS, 1997)

Deciding the Winner in Parity Games is in UP cap co-Up. - Marcin Jurdzinski (Inf. Process. Lett., 1998)

A Discrete Strategy Improvement Algorithm for Solving Parity Games. - Jens Vöge; Marcin Jurdzinski (CAV, 2000)

Small Progress Measures for Solving Parity Games. - Marcin Jurdzinski (STACS, 2000)

Hereditary History Preserving Bisimilarity Is Undecidable. - Marcin Jurdzinski; Mogens Nielsen (STACS, 2000)

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

Trading Probability for Fairness. - Marcin Jurdzinski; Orna Kupferman; Thomas A. Henzinger (CSL, 2002)

Simple Stochastic Parity Games. - Krishnendu Chatterjee; Marcin Jurdzinski; Thomas A. Henzinger (CSL, 2003)

Undecidability of domino games and hhp-bisimilarity. - Marcin Jurdzinski; Mogens Nielsen; Jirí Srba (Inf. Comput., 2003)

On Nash Equilibria in Stochastic Games. - Krishnendu Chatterjee; Rupak Majumdar; Marcin Jurdzinski (CSL, 2004)

Quantitative stochastic parity games. - Krishnendu Chatterjee; Marcin Jurdzinski; Thomas A. Henzinger (SODA, 2004)

Calculating Probabilities of Real-Time Test Cases. - Marcin Jurdzinski; Doron A. Peled; Hongyang Qu 001 (FATES, 2005)

Mean-Payoff Parity Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Marcin Jurdzinski (LICS, 2005)

Games with secure equilibria. - Krishnendu Chatterjee; Thomas A. Henzinger; Marcin Jurdzinski (Theor. Comput. Sci., 2006)

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

Reachability-Time Games on Timed Automata. - Marcin Jurdzinski; Ashutosh Trivedi 001 (ICALP, 2007)

Alternation-free modal mu-calculus for data trees. - Marcin Jurdzinski; Ranko Lazic 001 (LICS, 2007)

A Simple P-Matrix Linear Complementarity Problem for Discounted Games. - Marcin Jurdzinski; Rahul Savani (CiE, 2008)

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. - Patricia Bouyer; Thomas Brihaye; Marcin Jurdzinski; Ranko Lazic 001; Michal Rutkowski (FORMATS, 2008)

Concavely-Priced Timed Automata. - Marcin Jurdzinski; Ashutosh Trivedi 001 (FORMATS, 2008)

Average-Time Games. - Marcin Jurdzinski; Ashutosh Trivedi 001 (FSTTCS, 2008)

Model Checking Probabilistic Timed Automata with One or Two Clocks. - Marcin Jurdzinski; Jeremy Sproston; François Laroussinie (Log. Methods Comput. Sci., 2008)

A Deterministic Subexponential Algorithm for Solving Parity Games. - Marcin Jurdzinski; Mike Paterson; Uri Zwick (SIAM J. Comput., 2008)

Concavely-Priced Probabilistic Timed Automata. - Marcin Jurdzinski; Marta Z. Kwiatkowska; Gethin Norman; Ashutosh Trivedi 001 (CONCUR, 2009)

Algorithms for Solving Infinite Games. - Marcin Jurdzinski (SOFSEM, 2009)

Average-Time Games on Timed Automata - Marcin Jurdzinski; Ashutosh Trivedi 001 (CoRR, 2009)

Linear Complementarity Algorithms for Infinite Games. - John Fearnley; Marcin Jurdzinski; Rahul Savani (SOFSEM, 2010)

Algorithms for solving parity games. - Marcin Jurdzinski (Lectures in Game Theory for Computer Scientists, 2011)

Average-price-per-reward games on hybrid automata with strong resets. - Michal Rutkowski; Ranko Lazic 001; Marcin Jurdzinski (Int. J. Softw. Tools Technol. Transf., 2011)

Alternating automata on data trees and XPath satisfiability. - Marcin Jurdzinski; Ranko Lazic 001 (ACM Trans. Comput. Log., 2011)

Almost-Sure Model-Checking of Reactive Timed Automata. - Patricia Bouyer; Thomas Brihaye; Marcin Jurdzinski; Quentin Menet (QEST, 2012)

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

Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. - Artur Czumaj; Michail Fasoulakis; Marcin Jurdzinski (SAGT, 2014)

Stochastic Timed Automata. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Quentin Menet; Christel Baier; Marcus Größer; Marcin Jurdzinski (Log. Methods Comput. Sci., 2014)

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. - Marcin Jurdzinski; Ranko Lazic 001; Sylvain Schmitz (ICALP (2), 2015)

Approximate Nash Equilibria with Near Optimal Social Welfare. - Artur Czumaj; Michail Fasoulakis; Marcin Jurdzinski (IJCAI, 2015)

Reachability in two-clock timed automata is PSPACE-complete. - John Fearnley; Marcin Jurdzinski (Inf. Comput., 2015)

Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). - Artur Czumaj; Michail Fasoulakis; Marcin Jurdzinski (AAMAS, 2016)

Mean-Payoff Games on Timed Automata. - Shibashis Guha; Marcin Jurdzinski; Shankara Narayanan Krishna; Ashutosh Trivedi 001 (FSTTCS, 2016)

Multi-player Approximate Nash Equilibria. - Artur Czumaj; Michail Fasoulakis; Marcin Jurdzinski (AAMAS, 2017)

Zero-Sum Game Techniques for Approximate Nash Equilibria. - Artur Czumaj; Michail Fasoulakis; Marcin Jurdzinski (AAMAS, 2017)

Perfect half space games. - Thomas Colcombet; Marcin Jurdzinski; Ranko Lazic 001; Sylvain Schmitz (LICS, 2017)

Succinct progress measures for solving parity games. - Marcin Jurdzinski; Ranko Lazic 001 (LICS, 2017)

When is Containment Decidable for Probabilistic Automata?. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001; Filip Mazowiecki; Guillermo A. Pérez 001; James Worrell 001 (ICALP, 2018)

A pseudo-quasi-polynomial algorithm for mean-payoff parity games. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001 (LICS, 2018)

A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001 (CoRR, 2018)

Alternating Weak Automata from Universal Trees. - Laure Daviaud; Marcin Jurdzinski; Karoliina Lehtinen (CONCUR, 2019)

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. - Wojciech Czerwinski; Laure Daviaud; Nathanaël Fijalkow; Marcin Jurdzinski; Ranko Lazic 001; Pawel Parys (SODA, 2019)

Distributed Methods for Computing Approximate Equilibria. - Artur Czumaj; Argyrios Deligkas; Michail Fasoulakis; John Fearnley; Marcin Jurdzinski; Rahul Savani (Algorithmica, 2019)

The Strahler Number of a Parity Game. - Laure Daviaud; Marcin Jurdzinski; K. S. Thejaswini (ICALP, 2020)

A Universal Attractor Decomposition Algorithm for Parity Games. - Marcin Jurdzinski; Rémi Morvan (CoRR, 2020)

A symmetric attractor-decomposition lifting algorithm for parity games. - Marcin Jurdzinski; Rémi Morvan; Pierre Ohlmann; K. S. Thejaswini (CoRR, 2020)

When are emptiness and containment decidable for probabilistic automata? - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001; Filip Mazowiecki; Guillermo A. Pérez 001; James Worrell 001 (J. Comput. Syst. Sci., 2021)

Universal Algorithms for Parity Games and Nested Fixpoints. - Marcin Jurdzinski; Rémi Morvan; K. S. Thejaswini (Principles of Systems Design, 2022)

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. - K. S. Thejaswini; Pierre Ohlmann; Marcin Jurdzinski (FSTTCS, 2022)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. - Rohan Acharya; Marcin Jurdzinski; Aditya Prakash 002 (ICALP, 2024)