Notes on Finite Asynchronous Automata. - Wieslaw Zielonka (RAIRO Theor. Informatics Appl., 1987)

Safe Executions of Recognizable Trace Languages by Asynchronous Automata. - Wieslaw Zielonka (Logic at Botik, 1989)

A Kleene Theorem for Infinite Trace Languages. - Paul Gastin; Antoine Petit 001; Wieslaw Zielonka (ICALP, 1991)

Semi-Commutations and Rational Expressions. - Mireille Clerbout; Yves Roos; Wieslaw Zielonka (ICALP, 1992)

The Power and the Limitations of Local Computations on Graphs. - Igor Litovsky; Yves Métivier; Wieslaw Zielonka (WG, 1992)

Asynchronous Mappings and Asynchronous Cellular Automata - Robert Cori; Yves Métivier; Wieslaw Zielonka (Inf. Comput., 1993)

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. - Paul Gastin; Antoine Petit 001; Wieslaw Zielonka (Theor. Comput. Sci., 1994)

Asynchronous Automata. - Wieslaw Zielonka (The Book of Traces, 1995)

On the Recognition of Families of Graphs with Local Computations - Igor Litovsky; Yves Métivier; Wieslaw Zielonka (Inf. Comput., 1995)

Controlled Timed Automata. - François Demichelis; Wieslaw Zielonka (CONCUR, 1998)

Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. - Wieslaw Zielonka (Theor. Comput. Sci., 1998)

Perfect-Information Stochastic Parity Games. - Wieslaw Zielonka (FoSSaCS, 2004)

Election, Naming and Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (ICGT, 2004)

When Can You Play Positionally? - Hugo Gimbert; Wieslaw Zielonka (MFCS, 2004)

Discounting Infinite Games But How and Why? - Hugo Gimbert; Wieslaw Zielonka (GDV@CAV, 2004)

Games Where You Can Play Optimally Without Any Memory. - Hugo Gimbert; Wieslaw Zielonka (CONCUR, 2005)

An Invitation to Play. - Wieslaw Zielonka (MFCS, 2005)

Local Computation in Graphs: The Case of Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (Bull. EATCS, 2005)

Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. - Hugo Gimbert; Wieslaw Zielonka (ICALP (2), 2006)

Local Computations in Graphs: The Case of Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (Fundam. Informaticae, 2006)

Time-stamps for Mazurkiewicz traces. - Wieslaw Zielonka (Theor. Comput. Sci., 2006)

Perfect Information Stochastic Priority Games. - Hugo Gimbert; Wieslaw Zielonka (ICALP, 2007)

Limits of Multi-Discounted Markov Decision Processes. - Hugo Gimbert; Wieslaw Zielonka (LICS, 2007)

Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. - Hugo Gimbert; Wieslaw Zielonka (Logic and Automata, 2008)

Playing in stochastic environment: from multi-armed bandits to two-player games. - Wieslaw Zielonka (FSTTCS, 2010)

Blackwell Optimal Strategies in Priority mean-Payoff Games. - Hugo Gimbert; Wieslaw Zielonka (Int. J. Found. Comput. Sci., 2012)

On the values of repeated games with signals. - Hugo Gimbert; Jérôme Renault; Sylvain Sorin; Xavier Venel; Wieslaw Zielonka (CoRR, 2014)

Nearest Fixed Points and Concurrent Priority Games. - Bruno Karelovic; Wieslaw Zielonka (FCT, 2015)

Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences. - Hugo Gimbert; Wieslaw Zielonka (CoRR, 2016)