Marcin Jurdziński

Cited by

	All	Since 2019
Citations	4071	1087
h-index	24	20
i10-index	41	27

280

140

210

200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202428 28 40 52 78 110 99 163 174 190 175 188 191 185 222 191 224 264 274 211 201 179 172 175 147

Public access

View all

16 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Thomas HenzingerIST AustriaVerified email at ist.ac.at
Krishnendu ChatterjeeProfessor, IST AustriaVerified email at ist.ac.at
Laure DaviaudUniversity of East AngliaVerified email at uea.ac.uk
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Michail FasoulakisRoyal Holloway, University of LondonVerified email at ics.forth.gr
Ashutosh TrivediAssociate Professor, University of Colorado at BoulderVerified email at colorado.edu
John FearnleyUniversity of LiverpoolVerified email at liverpool.ac.uk
Mogens NielsenProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteVerified email at liverpool.ac.uk
Stefan DziembowskiUniversity of Warsaw and IDEAS NCBRVerified email at mimuw.edu.pl
Patricia BouyerLMF, Université Paris-Saclay, CNRS, ENS Paris-SaclayVerified email at lsv.fr
Thomas BrihayeUMONSVerified email at umons.ac.be
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Uri ZwickTel Aviv UniversityVerified email at tau.ac.il
Jeremy SprostonAssistant professor, University of TurinVerified email at di.unito.it
Quentin MenetUniversité de MonsVerified email at umons.ac.be
Igor WalukiewiczCNRS, LaBRI, Bordeaux UniversityVerified email at labri.fr
Sylvain SchmitzUniversité Paris CitéVerified email at irif.fr
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk

Marcin Jurdziński

University of Warwick, Department of Computer Science

Verified email at warwick.ac.uk - Homepage

theoretical computer science algorithms games automata logic


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Small progress measures for solving parity games M Jurdziński STACS 2000 (Theoretical Aspects of Comp. Sci., 17th Annual Symposium), 290-301, 2000	561	2000
Deciding the winner in parity games is in UP and co-UP M Jurdziński Information Processing Letters 68 (3), 119-124, 1998	508	1998
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	318	2000
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	296	2008
Quantitative stochastic parity games K Chatterjee, M Jurdziński, TA Henzinger SODA 2004 (Discrete Algorithms, 15th ACM-SIAM Symposium), 121-130, 2004	208	2004
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	193	1997
Mean-payoff parity games K Chatterjee, TA Henzinger, M Jurdziński LICS 2005 (Logic in Comp. Sci., 20th IEEE Symposium), 178-187, 2005	192	2005
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	166	2003
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	143	2004
Games with secure equilibria K Chatterjee, TA Henzinger, M Jurdziński LICS 2004 / Theoretical Comp. Sci. 365 (1-2), 67-82, 2006	131	2006
Succinct progress measures for solving parity games M Jurdziński, R Lazić LICS 2017 (Logic in Comp. Sci., 32nd ACM/IEEE Symposium), 9pp, 2017	124	2017
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	109	2008
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	108	2002
Reachability in two-clock timed automata is PSPACE-complete J Fearnley, M Jurdziński ICALP 2013 / Information and Computation 243, 26-36, 2015	89	2015
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	72	2014
Reachability-time games on timed automata M Jurdziński, A Trivedi ICALP 2007 (Automata, Languages, and Programming, 34th International …, 2007	64	2007
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	60	2015
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	53	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors