| 2007 |
|---|
| 22 | EE | Hugo Gimbert,
Wieslaw Zielonka:
Perfect Information Stochastic Priority Games.
ICALP 2007: 850-861 |
| 21 | EE | Hugo Gimbert,
Wieslaw Zielonka:
Limits of Multi-Discounted Markov Decision Processes.
LICS 2007: 89-98 |
| 2006 |
|---|
| 20 | EE | Hugo Gimbert,
Wieslaw Zielonka:
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games.
ICALP (2) 2006: 312-323 |
| 19 | EE | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Local Computations in Graphs: The Case of Cellular Edge Local Computations.
Fundam. Inform. 74(1): 85-114 (2006) |
| 18 | EE | Wieslaw Zielonka:
Time-stamps for Mazurkiewicz traces.
Theor. Comput. Sci. 356(1-2): 255-262 (2006) |
| 2005 |
|---|
| 17 | EE | Hugo Gimbert,
Wieslaw Zielonka:
Games Where You Can Play Optimally Without Any Memory.
CONCUR 2005: 428-442 |
| 16 | EE | Wieslaw Zielonka:
An Invitation to Play.
MFCS 2005: 58-70 |
| 15 | | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Local Computation in Graphs: The Case of Cellular Edge Local Computations.
Bulletin of the EATCS 85: 105-109 (2005) |
| 14 | EE | Hugo Gimbert,
Wieslaw Zielonka:
Discounting Infinite Games But How and Why?
Electr. Notes Theor. Comput. Sci. 119(1): 3-9 (2005) |
| 2004 |
|---|
| 13 | EE | Wieslaw Zielonka:
Perfect-Information Stochastic Parity Games.
FoSSaCS 2004: 499-513 |
| 12 | EE | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Election, Naming and Cellular Edge Local Computations.
ICGT 2004: 242-256 |
| 11 | EE | Hugo Gimbert,
Wieslaw Zielonka:
When Can You Play Positionally?
MFCS 2004: 686-697 |
| 1998 |
|---|
| 10 | EE | François Demichelis,
Wieslaw Zielonka:
Controlled Timed Automata.
CONCUR 1998: 455-469 |
| 9 | EE | Wieslaw Zielonka:
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theor. Comput. Sci. 200(1-2): 135-183 (1998) |
| 1995 |
|---|
| 8 | | Igor Litovsky,
Yves Métivier,
Wieslaw Zielonka:
On the Recognition of Families of Graphs with Local Computations
Inf. Comput. 118(1): 110-119 (1995) |
| 1994 |
|---|
| 7 | | Paul Gastin,
Antoine Petit,
Wieslaw Zielonka:
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.
Theor. Comput. Sci. 125(2): 167-204 (1994) |
| 1993 |
|---|
| 6 | | Robert Cori,
Yves Métivier,
Wieslaw Zielonka:
Asynchronous Mappings and Asynchronous Cellular Automata
Inf. Comput. 106(2): 159-202 (1993) |
| 1992 |
|---|
| 5 | | Mireille Clerbout,
Yves Roos,
Wieslaw Zielonka:
Semi-Commutations and Rational Expressions.
ICALP 1992: 113-125 |
| 4 | | Igor Litovsky,
Yves Métivier,
Wieslaw Zielonka:
The Power and the Limitations of Local Computations on Graphs.
WG 1992: 333-345 |
| 1991 |
|---|
| 3 | | Paul Gastin,
Antoine Petit,
Wieslaw Zielonka:
A Kleene Theorem for Infinite Trace Languages.
ICALP 1991: 254-266 |
| 1989 |
|---|
| 2 | | Wieslaw Zielonka:
Safe Executions of Recognizable Trace Languages by Asynchronous Automata.
Logic at Botik 1989: 278-289 |
| 1987 |
|---|
| 1 | | Wieslaw Zielonka:
Notes on Finite Asynchronous Automata.
ITA 21(2): 99-135 (1987) |
