Sledovat
Marcin Jurdziński
Marcin Jurdziński
University of Warwick, Department of Computer Science
E-mailová adresa ověřena na: warwick.ac.uk - Domovská stránka
Název
Citace
Citace
Rok
Small progress measures for solving parity games
M Jurdziński
STACS 2000 (Theoretical Aspects of Comp. Sci., 17th Annual Symposium), 290-301, 2000
5632000
Deciding the winner in parity games is in UP and co-UP
M Jurdziński
Information Processing Letters 68 (3), 119-124, 1998
5111998
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
3182000
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
2972008
Quantitative stochastic parity games
K Chatterjee, M Jurdziński, TA Henzinger
SODA 2004 (Discrete Algorithms, 15th ACM-SIAM Symposium), 121-130, 2004
2092004
Mean-payoff parity games
K Chatterjee, TA Henzinger, M Jurdziński
LICS 2005 (Logic in Comp. Sci., 20th IEEE Symposium), 178-187, 2005
1932005
How much memory is needed to win infinite games?
S Dziembowski, M Jurdziński, I Walukiewicz
LICS 1997 (Logic in Comp. Sci., 12th IEEE Symposium), 99-110, 1997
1931997
Simple stochastic parity games
K Chatterjee, M Jurdziński, TA Henzinger
CSL 2003 (Comp. Sci. Logic, 12th Annual Conference of the EACSL), 100-113, 2003
1662003
On Nash equilibria in stochastic games
K Chatterjee, R Majumdar, M Jurdziński
CSL 2004 (Comp. Sci. Logic, 13th Annual Conference of the EACSL), 26-40, 2004
1432004
Games with secure equilibria
K Chatterjee, TA Henzinger, M Jurdziński
LICS 2004 / Theoretical Comp. Sci. 365 (1-2), 67-82, 2006
1332006
Succinct progress measures for solving parity games
M Jurdziński, R Lazić
LICS 2017 (Logic in Comp. Sci., 32nd ACM/IEEE Symposium), 9pp, 2017
1242017
Alternating automata on data trees and XPath satisfiability
M Jurdziński, R Lazić
LICS 2007 / ACM Trans. on Computational Logic (TOCL) 12 (3:19), 1-21, 2011
121*2011
Model checking probabilistic timed automata with one or two clocks
M Jurdziński, F Laroussinie, J Sproston
TACAS 2007 / Logical Methods in Comp. Sci. 4 (3:12), 1-28, 2008
1102008
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
1092002
Reachability in two-clock timed automata is PSPACE-complete
J Fearnley, M Jurdziński
ICALP 2013 / Information and Computation 243, 26-36, 2015
932015
The covering and boundedness problems for branching vector addition systems
S Demri, M Jurdziński, O Lachish, R Lazić
FSTTCS 2009 / J. of Computer and System Sciences 79 (1), 23-38, 2013
75*2013
Stochastic timed automata
N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Groesser, ...
Logical Methods in Comp. Sci. 10 (4:6), 73pp, 2014
732014
Reachability-time games on timed automata
M Jurdziński, A Trivedi
ICALP 2007 (Automata, Languages, and Programming, 34th International …, 2007
652007
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
622015
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
SODA 2019 (Discrete Algorithms, 30th ACM-SIAM Symposium), 2333-2349, 2019
532019
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20