Marcin Jurdzinski

	2010
38		John Fearnley, Marcin Jurdzinski, Rahul Savani: Linear Complementarity Algorithms for Infinite Games. SOFSEM 2010: 382-393
	2009
37		Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Trivedi: Concavely-Priced Probabilistic Timed Automata. CONCUR 2009: 415-430
36		Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192
35		Marcin Jurdzinski: Algorithms for Solving Infinite Games. SOFSEM 2009: 46-48
34		Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI 2009: 167-181
33		Marcin Jurdzinski, Ashutosh Trivedi: Reachability-time games on timed automata CoRR abs/0907.3414: (2009)
32		John Fearnley, Marcin Jurdzinski, Rahul Savani: Linear Complementarity Algorithms for Infinite Games CoRR abs/0909.5653: (2009)
31		Marcin Jurdzinski, Ashutosh Trivedi: Average-Time Games on Timed Automata CoRR abs/0910.2891: (2009)
	2008
30		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
29		Marcin Jurdzinski, Rahul Savani: A Simple P-Matrix Linear Complementarity Problem for Discounted Games. CiE 2008: 283-293
28		Marcin Jurdzinski, Ashutosh Trivedi: Concavely-Priced Timed Automata. FORMATS 2008: 48-62
27		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
26		Marcin Jurdzinski, Ashutosh Trivedi: Average-Time Games. FSTTCS 2008: 340-351
25		Marcin Jurdzinski, Ranko Lazic: Alternating Automata on Data Trees and XPath Satisfiability CoRR abs/0805.0330: (2008)
24		Marcin Jurdzinski, François Laroussinie, Jeremy Sproston: Model Checking Probabilistic Timed Automata with One or Two Clocks CoRR abs/0809.0060: (2008)
23		Marcin Jurdzinski, Jeremy Sproston, François Laroussinie: Model Checking Probabilistic Timed Automata with One or Two Clocks. Logical Methods in Computer Science 4(3): (2008)
22		Marcin Jurdzinski, Mike Paterson, Uri Zwick: A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38(4): 1519-1532 (2008)
	2007
21		P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007
20		Marcin Jurdzinski, Ashutosh Trivedi: Reachability-Time Games on Timed Automata. ICALP 2007: 838-849
19		Marcin Jurdzinski, Ranko Lazic: Alternation-free modal mu-calculus for data trees. LICS 2007: 131-140
18		Marcin Jurdzinski, François Laroussinie, Jeremy Sproston: Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS 2007: 170-184
	2006
17		Marcin Jurdzinski, Mike Paterson, Uri Zwick: A deterministic subexponential algorithm for solving parity games. SODA 2006: 117-123
16		Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with secure equilibria. Theor. Comput. Sci. 365(1-2): 67-82 (2006)
	2005
15		Marcin Jurdzinski, Doron Peled, Hongyang Qu: Calculating Probabilities of Real-Time Test Cases. FATES 2005: 134-151
14		Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Mean-Payoff Parity Games. LICS 2005: 178-187
	2004
13		Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski: On Nash Equilibria in Stochastic Games. CSL 2004: 26-40
12		Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with Secure Equilibria. FMCO 2004: 141-161
11		Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with Secure Equilibria. LICS 2004: 160-169
10		Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Quantitative stochastic parity games. SODA 2004: 121-130
	2003
9		Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Simple Stochastic Parity Games. CSL 2003: 100-113
8		Marcin Jurdzinski, Mogens Nielsen, Jirí Srba: Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184(2): 343-368 (2003)
	2002
7		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		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		Marcin Jurdzinski: Small Progress Measures for Solving Parity Games. STACS 2000: 290-301
3		Marcin Jurdzinski, Mogens Nielsen: Hereditary History Preserving Bisimilarity Is Undecidable. STACS 2000: 358-369
	1998
2		Marcin Jurdzinski: Deciding the Winner in Parity Games is in UP \cap co-Up. Inf. Process. Lett. 68(3): 119-124 (1998)
	1997
1		Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz: How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110

Coauthor Index

1	Luca de Alfaro	[7]
2	Patricia Bouyer	[27]
3	Thomas Brihaye	[27]
4	Arindam Chakrabarti	[7]
5	Krishnendu Chatterjee	[9] [10] [11] [12] [13] [14] [16]
6	Stéphane Demri	[36]
7	Stefan Dziembowski	[1]
8	John Fearnley	[32] [38]
9	Thomas A. Henzinger	[6] [7] [9] [10] [11] [12] [14] [16]
10	P. Jean-Jacques Herings	[21] [30]
11	Orna Kupferman	[6]
12	Marta Z. Kwiatkowska	[37]
13	Oded Lachish	[36]
14	François Laroussinie	[18] [23] [24]
15	Ranko Lazic (R. S. Lazic)	[19] [25] [27] [34] [36]
16	Rupak Majumdar	[13]
17	Freddy Y. C. Mang	[7]
18	Peter Bro Miltersen	[21] [30]
19	Mogens Nielsen	[3] [8]
20	Gethin Norman	[37]
21	Mike Paterson	[17] [22]
22	Doron Peled	[15]
23	Hongyang Qu	[15]
24	Michal Rutkowski	[27] [34]
25	Rahul Savani	[29] [32] [38]
26	Jeremy Sproston	[18] [23] [24]
27	Jirí Srba	[8]
28	Bernhard von Stengel	[21] [30]
29	Éva Tardos	[21] [30]
30	Ashutosh Trivedi	[20] [26] [28] [31] [33] [37]
31	Jens Vöge	[5]
32	Igor Walukiewicz	[1]
33	Uri Zwick	[17] [22]

Colors in the list of coauthors