Wieslaw Zielonka

30 papers A* 4B 8Journal 11Unranked 6
YearRankTypeTitle / Venue / Authors
2016 J jnl
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences.
CoRR
Hugo Gimbert, Wieslaw Zielonka
2015 B conf
Nearest Fixed Points and Concurrent Priority Games.
FCT
Bruno Karelovic, Wieslaw Zielonka
2014 J jnl
On the values of repeated games with signals.
CoRR
Hugo Gimbert, Jérôme Renault, Sylvain Sorin, Xavier Venel, Wieslaw Zielonka
2012 J jnl
Blackwell Optimal Strategies in Priority mean-Payoff Games.
Int. J. Found. Comput. Sci.
Hugo Gimbert, Wieslaw Zielonka
2010 — conf
Blackwell-Optimal Strategies in Priority Mean-Payoff Games
GANDALF
Hugo Gimbert, Wieslaw Zielonka
2010 — conf
Playing in stochastic environment: from multi-armed bandits to two-player games.
FSTTCS
Wieslaw Zielonka
2008 — conf
Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games.
Logic and Automata
Hugo Gimbert, Wieslaw Zielonka
2007 A* conf
Limits of Multi-Discounted Markov Decision Processes.
LICS
Hugo Gimbert, Wieslaw Zielonka
2007 A* conf
Perfect Information Stochastic Priority Games.
ICALP
Hugo Gimbert, Wieslaw Zielonka
2006 — conf
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games.
ICALP (2)
Hugo Gimbert, Wieslaw Zielonka
2006 J jnl
Local Computations in Graphs: The Case of Cellular Edge Local Computations.
Fundam. Informaticae
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2006 J jnl
Time-stamps for Mazurkiewicz traces.
Theor. Comput. Sci.
Wieslaw Zielonka
2005 B conf
An Invitation to Play.
MFCS
Wieslaw Zielonka
2005 B conf
Games Where You Can Play Optimally Without Any Memory.
CONCUR
Hugo Gimbert, Wieslaw Zielonka
2005 J jnl
Local Computation in Graphs: The Case of Cellular Edge Local Computations.
Bull. EATCS
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2004 — conf
Discounting Infinite Games But How and Why?
GDV@CAV
Hugo Gimbert, Wieslaw Zielonka
2004 B conf
Election, Naming and Cellular Edge Local Computations.
ICGT
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2004 B conf
Perfect-Information Stochastic Parity Games.
FoSSaCS
Wieslaw Zielonka
2004 B conf
When Can You Play Positionally?
MFCS
Hugo Gimbert, Wieslaw Zielonka
1998 B conf
Controlled Timed Automata.
CONCUR
François Demichelis, Wieslaw Zielonka
1998 J jnl
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theor. Comput. Sci.
Wieslaw Zielonka
1995 — ch.
Asynchronous Automata.
The Book of Traces
Wieslaw Zielonka
1995 J jnl
On the Recognition of Families of Graphs with Local Computations
Inf. Comput.
Igor Litovsky, Yves Métivier, Wieslaw Zielonka
1994 J jnl
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.
Theor. Comput. Sci.
Paul Gastin, Antoine Petit, Wieslaw Zielonka
1993 J jnl
Asynchronous Mappings and Asynchronous Cellular Automata
Inf. Comput.
Robert Cori, Yves Métivier, Wieslaw Zielonka
1992 A* conf
Semi-Commutations and Rational Expressions.
ICALP
Mireille Clerbout, Yves Roos, Wieslaw Zielonka
1992 B conf
The Power and the Limitations of Local Computations on Graphs.
WG
Igor Litovsky, Yves Métivier, Wieslaw Zielonka
1991 A* conf
A Kleene Theorem for Infinite Trace Languages.
ICALP
Paul Gastin, Antoine Petit, Wieslaw Zielonka
1989 — conf
Safe Executions of Recognizable Trace Languages by Asynchronous Automata.
Logic at Botik
Wieslaw Zielonka
1987 J jnl
Notes on Finite Asynchronous Automata.
RAIRO Theor. Informatics Appl.
Wieslaw Zielonka