Marcin Jurdzinski
Marcin Jurdzinski
University of Warwick, Department of Computer Science
Verified email at warwick.ac.uk - Homepage
TitleCited byYear
Small progress measures for solving parity games
M Jurdziński
STACS 2000 (Theoretical Aspects of Computer Science, 17th Annual Symposium …, 2000
4382000
Deciding the winner in parity games is in UP and Co-UP
M Jurdzinski
Information Processing Letters 68 (3), 119-124, 1998
3921998
A discrete strategy improvement algorithm for solving parity games
J Vöge, M Jurdziński
CAV 2000 (Computer Aided Verification, 12th International Conference), 202-215, 2000
2632000
A deterministic subexponential algorithm for solving parity games
M Jurdziński, M Paterson, U Zwick
SODA 2006 / SIAM J. on Computing 38 (4), 1519-1532, 2008
2462008
Quantitative stochastic parity games
K Chatterjee, M Jurdziński, TA Henzinger
SODA 2004 (Discrete Algorithms, 15th ACM-SIAM Symposium), 121-130, 2004
1632004
How much memory is needed to win infinite games?
S Dziembowski, M Jurdzinski, I Walukiewicz
LICS 1997 (Logic in Computer Science, 12th IEEE Symposium), 99-110, 1997
1421997
Mean-payoff parity games
K Chatterjee, TA Henzinger, M Jurdzinski
LICS 2005 (Logic in Computer Science, 20th IEEE Symposium), 178-187, 2005
1352005
Simple stochastic parity games
K Chatterjee, M Jurdziński, TA Henzinger
CSL 2003 (Computer Science Logic, 12th Annual Conference of the EACSL), 100-113, 2003
1322003
Interface compatibility checking for software modules
A Chakrabarti, L De Alfaro, TA Henzinger, M Jurdziński, FYC Mang
CAV 2002 (Computer Aided Verification, 14th International Conference), 428-441, 2002
992002
Alternating automata on data trees and XPath satisfiability
M Jurdziński, R Lazić
LICS 2007 / ACM Transactions on Computational Logic (TOCL) 12 (3:19), 1-21, 2011
97*2011
Games with secure equilibria
K Chatterjee, TA Henzinger, M Jurdzinski
LICS 2004 / Theoretical Computer Science 365 (1-2), 67-82, 2006
972006
On Nash equilibria in stochastic games
K Chatterjee, R Majumdar, M Jurdziński
CSL 2004 (Computer Science Logic, 13th Annual Conference of the EACSL), 26-40, 2004
902004
Model checking probabilistic timed automata with one or two clocks
M Jurdziński, F Laroussinie, J Sproston
TACAS 2007 / Logical Methods in Computer Science 4 (3:12), 1-28, 2008
732008
The covering and boundedness problems for branching vector addition systems
S Demri, M Jurdziński, O Lachish, R Lazić
FSTTCS 2009 / Journal of Computer and System Sciences 79 (1), 23-38, 2013
54*2013
Undecidability of domino games and hhp-bisimilarity
M Jurdziński, M Nielsen, J Srba
STACS 2000 / Information and Computation 184 (2), 343-368, 2003
41*2003
Reachability-time games on timed automata
M Jurdziński, A Trivedi
ICALP 2007 (Automata, Languages, and Programming, 34th International …, 2007
392007
Reachability in two-clock timed automata is PSPACE-complete
J Fearnley, M Jurdziński
ICALP 2013 / Information and Computation 243, 26-36, 2015
372015
Succinct progress measures for solving parity games
M Jurdziński, R Lazić
LICS 2017 (Logic in Computer Science, 32nd ACM/IEEE Symposium), 9pp, 2017
362017
Fixed-dimensional energy games are in pseudo-polynomial time
M Jurdziński, R Lazić, S Schmitz
ICALP 2015 (Automata, Languages, and Programming, 42nd International …, 2015
272015
Concavely-priced probabilistic timed automata
M Jurdziński, M Kwiatkowska, G Norman, A Trivedi
CONCUR 2009 (Concurrency Theory, 20th International Conference), 415-430, 2009
232009
The system can't perform the operation now. Try again later.
Articles 1–20