default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Jurdzinski
Person information
- affiliation: University of Warwick, Coventry, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c46]Rohan Acharya
, Marcin Jurdzinski, Aditya Prakash:
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. ICALP 2024: 124:1-124:18- [i21]Rohan Acharya, Marcin Jurdzinski, Aditya Prakash:
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. CoRR abs/2404.17530 (2024) - 2022
- [c45]Marcin Jurdzinski, Rémi Morvan, K. S. Thejaswini:
Universal Algorithms for Parity Games and Nested Fixpoints. Principles of Systems Design 2022: 252-271 - [c44]K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski:
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. FSTTCS 2022: 44:1-44:20 - 2021
- [j12]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119: 78-96 (2021) - 2020
- [c43]Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini:
The Strahler Number of a Parity Game. ICALP 2020: 123:1-123:19 - [i20]Marcin Jurdzinski, Rémi Morvan:
A Universal Attractor Decomposition Algorithm for Parity Games. CoRR abs/2001.04333 (2020) - [i19]Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini:
The Strahler number of a parity game. CoRR abs/2003.08627 (2020) - [i18]Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini:
A symmetric attractor-decomposition lifting algorithm for parity games. CoRR abs/2010.08288 (2020)
2010 – 2019
- 2019
- [j11]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81(3): 1205-1231 (2019) - [c42]Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. CONCUR 2019: 18:1-18:14 - [c41]Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys:
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA 2019: 2333-2349 - [i17]Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. CoRR abs/1903.12620 (2019) - 2018
- [c40]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata?. ICALP 2018: 121:1-121:14 - [c39]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic:
A pseudo-quasi-polynomial algorithm for mean-payoff parity games. LICS 2018: 325-334 - [i16]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic:
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. CoRR abs/1803.04756 (2018) - [i15]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata? CoRR abs/1804.09077 (2018) - [i14]Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys:
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR abs/1807.10546 (2018) - 2017
- [c38]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Multi-player Approximate Nash Equilibria. AAMAS 2017: 1511-1513 - [c37]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Zero-Sum Game Techniques for Approximate Nash Equilibria. AAMAS 2017: 1514-1516 - [c36]Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect half space games. LICS 2017: 1-11 - [c35]Marcin Jurdzinski, Ranko Lazic:
Succinct progress measures for solving parity games. LICS 2017: 1-9 - [i13]Marcin Jurdzinski, Ranko Lazic:
Succinct progress measures for solving parity games. CoRR abs/1702.05051 (2017) - [i12]Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect Half Space Games. CoRR abs/1704.05626 (2017) - 2016
- [c34]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). AAMAS 2016: 1409-1410 - [c33]Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi:
Mean-Payoff Games on Timed Automata. FSTTCS 2016: 44:1-44:14 - [c32]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. WINE 2016: 15-28 - [i11]Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi:
Mean-Payoff Games on Timed Automata. CoRR abs/1607.08480 (2016) - 2015
- [j10]John Fearnley, Marcin Jurdzinski:
Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. 243: 26-36 (2015) - [c31]Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ICALP (2) 2015: 260-272 - [c30]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Nash Equilibria with Near Optimal Social Welfare. IJCAI 2015: 504-510 - [i10]Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. CoRR abs/1502.06875 (2015) - [i9]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. CoRR abs/1512.03315 (2015) - 2014
- [j9]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski:
Stochastic Timed Automata. Log. Methods Comput. Sci. 10(4) (2014) - [c29]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. SAGT 2014: 244-254 - [i8]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate well-supported Nash equilibria in symmetric bimatrix games. CoRR abs/1407.3004 (2014) - 2013
- [j8]Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic:
The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1): 23-38 (2013) - [c28]John Fearnley, Marcin Jurdzinski:
Reachability in Two-Clock Timed Automata Is PSPACE-Complete. ICALP (2) 2013: 212-223 - [i7]John Fearnley, Marcin Jurdzinski:
Reachability in Two-Clock Timed Automata is PSPACE-complete. CoRR abs/1302.3109 (2013) - 2012
- [c27]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet:
Almost-Sure Model-Checking of Reactive Timed Automata. QEST 2012: 138-147 - [e2]Marcin Jurdzinski, Dejan Nickovic:
Formal Modeling and Analysis of Timed Systems - 10th International Conference, FORMATS 2012, London, UK, September 18-20, 2012. Proceedings. Lecture Notes in Computer Science 7595, Springer 2012, ISBN 978-3-642-33364-4 [contents] - 2011
- [j7]Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski:
Average-price-per-reward games on hybrid automata with strong resets. Int. J. Softw. Tools Technol. Transf. 13(6): 553-569 (2011) - [j6]Marcin Jurdzinski, Ranko Lazic:
Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12(3): 19:1-19:21 (2011) - [p1]Marcin Jurdzinski:
Algorithms for solving parity games. Lectures in Game Theory for Computer Scientists 2011: 74-98 - 2010
- [c26]John Fearnley, Marcin Jurdzinski, Rahul Savani:
Linear Complementarity Algorithms for Infinite Games. SOFSEM 2010: 382-393
2000 – 2009
- 2009
- [c25]Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Trivedi:
Concavely-Priced Probabilistic Timed Automata. CONCUR 2009: 415-430 - [c24]Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic:
The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192 - [c23]Marcin Jurdzinski:
Algorithms for Solving Infinite Games. SOFSEM 2009: 46-48 - [c22]Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski:
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI 2009: 167-181 - [i6]Marcin Jurdzinski, Ashutosh Trivedi:
Reachability-time games on timed automata. CoRR abs/0907.3414 (2009) - [i5]John Fearnley, Marcin Jurdzinski, Rahul Savani:
Linear Complementarity Algorithms for Infinite Games. CoRR abs/0909.5653 (2009) - [i4]Marcin Jurdzinski, Ashutosh Trivedi:
Average-Time Games on Timed Automata. CoRR abs/0910.2891 (2009) - 2008
- [j5]Marcin Jurdzinski, Jeremy Sproston, François Laroussinie:
Model Checking Probabilistic Timed Automata with One or Two Clocks. Log. Methods Comput. Sci. 4(3) (2008) - [j4]Marcin Jurdzinski, Mike Paterson, Uri Zwick:
A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38(4): 1519-1532 (2008) - [c21]Marcin Jurdzinski, Rahul Savani:
A Simple P-Matrix Linear Complementarity Problem for Discounted Games. CiE 2008: 283-293 - [c20]Marcin Jurdzinski, Ashutosh Trivedi:
Concavely-Priced Timed Automata. FORMATS 2008: 48-62 - [c19]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 - [c18]Marcin Jurdzinski, Ashutosh Trivedi:
Average-Time Games. FSTTCS 2008: 340-351 - [e1]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel:
Equilibrium Computation, 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings 07471, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i3]Marcin Jurdzinski, Ranko Lazic:
Alternating Automata on Data Trees and XPath Satisfiability. CoRR abs/0805.0330 (2008) - [i2]Marcin Jurdzinski, François Laroussinie, Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks. CoRR abs/0809.0060 (2008) - 2007
- [c17]Marcin Jurdzinski, Ashutosh Trivedi:
Reachability-Time Games on Timed Automata. ICALP 2007: 838-849 - [c16]Marcin Jurdzinski, Ranko Lazic:
Alternation-free modal mu-calculus for data trees. LICS 2007: 131-140 - [c15]Marcin Jurdzinski, François Laroussinie, Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS 2007: 170-184 - [i1]P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel:
07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007 - 2006
- [j3]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
Games with secure equilibria. Theor. Comput. Sci. 365(1-2): 67-82 (2006) - [c14]Marcin Jurdzinski, Mike Paterson, Uri Zwick:
A deterministic subexponential algorithm for solving parity games. SODA 2006: 117-123 - 2005
- [c13]Marcin Jurdzinski, Doron A. Peled, Hongyang Qu:
Calculating Probabilities of Real-Time Test Cases. FATES 2005: 134-151 - [c12]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
Mean-Payoff Parity Games. LICS 2005: 178-187 - 2004
- [c11]Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski:
On Nash Equilibria in Stochastic Games. CSL 2004: 26-40 - [c10]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
Games with Secure Equilibria. FMCO 2004: 141-161 - [c9]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
Games with Secure Equilibria. LICS 2004: 160-169 - [c8]Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger:
Quantitative stochastic parity games. SODA 2004: 121-130 - 2003
- [j2]Marcin Jurdzinski, Mogens Nielsen, Jirí Srba:
Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184(2): 343-368 (2003) - [c7]Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger:
Simple Stochastic Parity Games. CSL 2003: 100-113 - 2002
- [c6]Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, Marcin Jurdzinski, Freddy Y. C. Mang:
Interface Compatibility Checking for Software Modules. CAV 2002: 428-441 - [c5]Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger:
Trading Probability for Fairness. CSL 2002: 292-305 - 2000
- [c4]Jens Vöge, Marcin Jurdzinski:
A Discrete Strategy Improvement Algorithm for Solving Parity Games. CAV 2000: 202-215 - [c3]Marcin Jurdzinski:
Small Progress Measures for Solving Parity Games. STACS 2000: 290-301 - [c2]Marcin Jurdzinski, Mogens Nielsen:
Hereditary History Preserving Bisimilarity Is Undecidable. STACS 2000: 358-369
1990 – 1999
- 1998
- [j1]Marcin Jurdzinski:
Deciding the Winner in Parity Games is in UP \cap co-Up. Inf. Process. Lett. 68(3): 119-124 (1998) - 1997
- [c1]Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz:
How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
