- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j10 |      | Hugo Gimbert, Wieslaw Zielonka: Blackwell Optimal Strategies in Priority mean-Payoff Games. Int. J. Found. Comput. Sci. 23(3): 687-711 (2012) |
| 2010 | ||
| c16 | | Wieslaw Zielonka: Playing in stochastic environment: from multi-armed bandits to two-player games. FSTTCS 2010: 65-72 |
| c15 | | Hugo Gimbert, Wieslaw Zielonka: Blackwell-Optimal Strategies in Priority Mean-Payoff Games. GANDALF 2010: 7-21 |
| 2008 | ||
| c14 |  | Hugo Gimbert, Wieslaw Zielonka: Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. Logic and Automata 2008: 331-356 |
| 2007 | ||
| c13 | | |
| c12 | | Hugo Gimbert, Wieslaw Zielonka: Limits of Multi-Discounted Markov Decision Processes. LICS 2007: 89-98 |
| 2006 | ||
| j9 | | 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) |
| j8 | | |
| c11 | | Hugo Gimbert, Wieslaw Zielonka: Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. ICALP (2) 2006: 312-323 |
| 2005 | ||
| j7 | | 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) |
| j6 | | Hugo Gimbert, Wieslaw Zielonka: Discounting Infinite Games But How and Why? Electr. Notes Theor. Comput. Sci. 119(1): 3-9 (2005) |
| c10 | | Hugo Gimbert, Wieslaw Zielonka: Games Where You Can Play Optimally Without Any Memory. CONCUR 2005: 428-442 |
| c9 | | |
| 2004 | ||
| c8 | | |
| c7 | | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka: Election, Naming and Cellular Edge Local Computations. ICGT 2004: 242-256 |
| c6 | | |
| 1998 | ||
| j5 | | Wieslaw Zielonka: Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theor. Comput. Sci. 200(1-2): 135-183 (1998) |
| c5 | | |
| 1995 | ||
| j4 | | 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 | ||
| j3 | | 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 | ||
| j2 | | Robert Cori, Yves Métivier, Wieslaw Zielonka: Asynchronous Mappings and Asynchronous Cellular Automata. Inf. Comput. 106(2): 159-202 (1993) |
| 1992 | ||
| c4 | | Mireille Clerbout, Yves Roos, Wieslaw Zielonka: Semi-Commutations and Rational Expressions. ICALP 1992: 113-125 |
| c3 | | Igor Litovsky, Yves Métivier, Wieslaw Zielonka: The Power and the Limitations of Local Computations on Graphs. WG 1992: 333-345 |
| 1991 | ||
| c2 | | Paul Gastin, Antoine Petit, Wieslaw Zielonka: A Kleene Theorem for Infinite Trace Languages. ICALP 1991: 254-266 |
| 1989 | ||
| c1 | | Wieslaw Zielonka: Safe Executions of Recognizable Trace Languages by Asynchronous Automata. Logic at Botik 1989: 278-289 |
| 1987 | ||
| j1 | | |
| 1 | Jérémie Chalopin | |
| 2 | Mireille Clerbout | |
| 3 | Robert Cori | |
| 4 | François Demichelis | |
| 5 | Paul Gastin | |
| 6 | Hugo Gimbert | |
| 7 | Igor Litovsky | |
| 8 | Yves Métivier | |
| 9 | Antoine Petit | |
| 10 | Yves Roos |
Data released under the ODC-BY 1.0 license — See also our legal information page