BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Denmark
1 × Finland
1 × Japan
1 × Latvia
1 × Portugal
2 × United Kingdom
3 × USA
4 × Poland
Collaborated with:
T.A.Henzinger K.Chatterjee R.Lazic J.Fearnley A.Trivedi J.Vöge S.Schmitz M.Rutkowski F.Laroussinie J.Sproston D.Peled H.Qu R.Majumdar O.Kupferman S.Dziembowski I.Walukiewicz A.Chakrabarti L.d.Alfaro F.Y.C.Mang
Talks about:
game (9) time (6) automata (4) pariti (3) equilibria (2) stochast (2) reachabl (2) probabl (2) clock (2) check (2)

Person: Marcin Jurdzinski

DBLP DBLP: Jurdzinski:Marcin

Contributed to:

ICALP (2) 20152015
ICALP (2) 20132013
VMCAI 20092009
ICALP 20072007
LICS 20072007
TACAS 20072007
FATES 20052005
LICS 20052005
CSL 20042004
LICS 20042004
CSL 20032003
CAV 20022002
CSL 20022002
CAV 20002000
LICS 19971997

Wrote 15 papers:

ICALP-v2-2015-JurdzinskiLS #energy #game studies #pseudo
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (MJ, RL, SS), pp. 260–272.
ICALP-v2-2013-FearnleyJ #automaton #reachability
Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.
VMCAI-2009-JurdzinskiLR #automaton #game studies #hybrid
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (MJ, RL, MR), pp. 167–181.
ICALP-2007-JurdzinskiT #automaton #game studies
Reachability-Time Games on Timed Automata (MJ, AT), pp. 838–849.
LICS-2007-JurdzinskiL #calculus #μ-calculus
Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.
TACAS-2007-JurdzinskiLS #automaton #model checking #probability
Model Checking Probabilistic Timed Automata with One or Two Clocks (MJ, FL, JS), pp. 170–184.
FATES-2005-JurdzinskiPQ #realtime #testing
Calculating Probabilities of Real-Time Test Cases (MJ, DP, HQ), pp. 134–151.
LICS-2005-ChatterjeeHJ #game studies
Mean-Payoff Parity Games (KC, TAH, MJ), pp. 178–187.
CSL-2004-ChatterjeeMJ #game studies #nash #on the #probability
On Nash Equilibria in Stochastic Games (KC, RM, MJ), pp. 26–40.
LICS-2004-ChatterjeeHJ #game studies
Games with Secure Equilibria (KC, TAH, MJ), pp. 160–169.
CSL-2003-ChatterjeeJH #game studies #probability
Simple Stochastic Parity Games (KC, MJ, TAH), pp. 100–113.
CAV-2002-ChakrabartiAHJM #interface
Interface Compatibility Checking for Software Modules (AC, LdA, TAH, MJ, FYCM), pp. 428–441.
CSL-2002-JurdzinskiKH #probability
Trading Probability for Fairness (MJ, OK, TAH), pp. 292–305.
CAV-2000-VogeJ #algorithm #game studies
A Discrete Strategy Improvement Algorithm for Solving Parity Games (JV, MJ), pp. 202–215.
LICS-1997-DziembowskiJW #game studies #how #infinity #memory management #question
How Much Memory is Needed to Win Infinite Games? (SD, MJ, IW), pp. 99–110.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.