Marcin Jurdzinski

Orcid: 0000-0003-3640-8481

Affiliations:
  • University of Warwick, Coventry, UK


According to our database1, Marcin Jurdzinski authored at least 56 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Universal Algorithms for Parity Games and Nested Fixpoints.
Proceedings of the Principles of Systems Design, 2022

2021
When are emptiness and containment decidable for probabilistic automata?
J. Comput. Syst. Sci., 2021

2020
A symmetric attractor-decomposition lifting algorithm for parity games.
CoRR, 2020

A Universal Attractor Decomposition Algorithm for Parity Games.
CoRR, 2020

The Strahler Number of a Parity Game.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Distributed Methods for Computing Approximate Equilibria.
Algorithmica, 2019

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Alternating Weak Automata from Universal Trees.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.
CoRR, 2018

A pseudo-quasi-polynomial algorithm for mean-payoff parity games.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

When is Containment Decidable for Probabilistic Automata?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Succinct progress measures for solving parity games.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Perfect half space games.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Zero-Sum Game Techniques for Approximate Nash Equilibria.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Multi-player Approximate Nash Equilibria.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Mean-Payoff Games on Timed Automata.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Reachability in two-clock timed automata is PSPACE-complete.
Inf. Comput., 2015

Approximate Nash Equilibria with Near Optimal Social Welfare.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Stochastic Timed Automata.
Log. Methods Comput. Sci., 2014

Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013
The covering and boundedness problems for branching vector addition systems.
J. Comput. Syst. Sci., 2013

2012
Almost-Sure Model-Checking of Reactive Timed Automata.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

2011
Alternating automata on data trees and XPath satisfiability.
ACM Trans. Comput. Log., 2011

Average-price-per-reward games on hybrid automata with strong resets.
Int. J. Softw. Tools Technol. Transf., 2011

Algorithms for solving parity games.
Proceedings of the Lectures in Game Theory for Computer Scientists., 2011

2010
Linear Complementarity Algorithms for Infinite Games.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2009
Average-Time Games on Timed Automata
CoRR, 2009

Algorithms for Solving Infinite Games.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Concavely-Priced Probabilistic Timed Automata.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
A Deterministic Subexponential Algorithm for Solving Parity Games.
SIAM J. Comput., 2008

Model Checking Probabilistic Timed Automata with One or Two Clocks.
Log. Methods Comput. Sci., 2008

Average-Time Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Concavely-Priced Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

A Simple P-Matrix Linear Complementarity Problem for Discounted Games.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Alternation-free modal mu-calculus for data trees.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Reachability-Time Games on Timed Automata.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

07471 Abstracts Collection - Equilibrium Computation.
Proceedings of the Equilibrium Computation, 18.11. - 23.11.2007, 2007

2006
Games with secure equilibria.
Theor. Comput. Sci., 2006

2005
Mean-Payoff Parity Games.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Calculating Probabilities of Real-Time Test Cases.
Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005

2004
Quantitative stochastic parity games.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On Nash Equilibria in Stochastic Games.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Undecidability of domino games and hhp-bisimilarity.
Inf. Comput., 2003

Simple Stochastic Parity Games.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Trading Probability for Fairness.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Interface Compatibility Checking for Software Modules.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2000
Hereditary History Preserving Bisimilarity Is Undecidable.
Proceedings of the STACS 2000, 2000

Small Progress Measures for Solving Parity Games.
Proceedings of the STACS 2000, 2000

A Discrete Strategy Improvement Algorithm for Solving Parity Games.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1998
Deciding the Winner in Parity Games is in UP \cap co-Up.
Inf. Process. Lett., 1998

1997
How Much Memory is Needed to Win Infinite Games?
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997


  Loading...