2009 |
31 | EE | Marcin Jurdzinski:
Algorithms for Solving Infinite Games.
SOFSEM 2009: 46-48 |
30 | EE | Marcin Jurdzinski,
Ranko Lazic,
Michal Rutkowski:
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets.
VMCAI 2009: 167-181 |
2008 |
29 | | P. Jean-Jacques Herings,
Marcin Jurdzinski,
Peter Bro Miltersen,
Éva Tardos,
Bernhard von Stengel:
Equilibrium Computation, 18.11. - 23.11.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
28 | EE | Marcin Jurdzinski,
Rahul Savani:
A Simple P-Matrix Linear Complementarity Problem for Discounted Games.
CiE 2008: 283-293 |
27 | EE | Marcin Jurdzinski,
Ashutosh Trivedi:
Concavely-Priced Timed Automata.
FORMATS 2008: 48-62 |
26 | EE | 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 |
25 | EE | Marcin Jurdzinski,
Ashutosh Trivedi:
Average-Time Games.
FSTTCS 2008 |
24 | EE | Marcin Jurdzinski,
Ranko Lazic:
Alternating Automata on Data Trees and XPath Satisfiability
CoRR abs/0805.0330: (2008) |
23 | EE | Marcin Jurdzinski,
François Laroussinie,
Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks
CoRR abs/0809.0060: (2008) |
22 | EE | Marcin Jurdzinski,
Mike Paterson,
Uri Zwick:
A Deterministic Subexponential Algorithm for Solving Parity Games.
SIAM J. Comput. 38(4): 1519-1532 (2008) |
2007 |
21 | EE | P. Jean-Jacques Herings,
Marcin Jurdzinski,
Peter Bro Miltersen,
Éva Tardos,
Bernhard von Stengel:
07471 Abstracts Collection - Equilibrium Computation.
Equilibrium Computation 2007 |
20 | EE | Marcin Jurdzinski,
Ashutosh Trivedi:
Reachability-Time Games on Timed Automata.
ICALP 2007: 838-849 |
19 | EE | Marcin Jurdzinski,
Ranko Lazic:
Alternation-free modal mu-calculus for data trees.
LICS 2007: 131-140 |
18 | EE | Marcin Jurdzinski,
François Laroussinie,
Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks.
TACAS 2007: 170-184 |
2006 |
17 | EE | Marcin Jurdzinski,
Mike Paterson,
Uri Zwick:
A deterministic subexponential algorithm for solving parity games.
SODA 2006: 117-123 |
16 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Games with secure equilibria.
Theor. Comput. Sci. 365(1-2): 67-82 (2006) |
2005 |
15 | EE | Marcin Jurdzinski,
Doron Peled,
Hongyang Qu:
Calculating Probabilities of Real-Time Test Cases.
FATES 2005: 134-151 |
14 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Mean-Payoff Parity Games.
LICS 2005: 178-187 |
2004 |
13 | EE | Krishnendu Chatterjee,
Rupak Majumdar,
Marcin Jurdzinski:
On Nash Equilibria in Stochastic Games.
CSL 2004: 26-40 |
12 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Games with Secure Equilibria.
FMCO 2004: 141-161 |
11 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Games with Secure Equilibria.
LICS 2004: 160-169 |
10 | EE | Krishnendu Chatterjee,
Marcin Jurdzinski,
Thomas A. Henzinger:
Quantitative stochastic parity games.
SODA 2004: 121-130 |
2003 |
9 | EE | Krishnendu Chatterjee,
Marcin Jurdzinski,
Thomas A. Henzinger:
Simple Stochastic Parity Games.
CSL 2003: 100-113 |
8 | EE | Marcin Jurdzinski,
Mogens Nielsen,
Jirí Srba:
Undecidability of domino games and hhp-bisimilarity.
Inf. Comput. 184(2): 343-368 (2003) |
2002 |
7 | EE | Arindam Chakrabarti,
Luca de Alfaro,
Thomas A. Henzinger,
Marcin Jurdzinski,
Freddy Y. C. Mang:
Interface Compatibility Checking for Software Modules.
CAV 2002: 428-441 |
6 | EE | Marcin Jurdzinski,
Orna Kupferman,
Thomas A. Henzinger:
Trading Probability for Fairness.
CSL 2002: 292-305 |
2000 |
5 | | Jens Vöge,
Marcin Jurdzinski:
A Discrete Strategy Improvement Algorithm for Solving Parity Games.
CAV 2000: 202-215 |
4 | EE | Marcin Jurdzinski:
Small Progress Measures for Solving Parity Games.
STACS 2000: 290-301 |
3 | EE | Marcin Jurdzinski,
Mogens Nielsen:
Hereditary History Preserving Bisimilarity Is Undecidable.
STACS 2000: 358-369 |
1998 |
2 | EE | Marcin Jurdzinski:
Deciding the Winner in Parity Games is in UP \cap co-Up.
Inf. Process. Lett. 68(3): 119-124 (1998) |
1997 |
1 | EE | Stefan Dziembowski,
Marcin Jurdzinski,
Igor Walukiewicz:
How Much Memory is Needed to Win Infinite Games?
LICS 1997: 99-110 |