Wieslaw Zielonka

According to our database, Wieslaw Zielonka authored at least 29 papers between 1987 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences.

Hugo Gimbert, Wieslaw Zielonka

CoRR, 2016

2015

Nearest Fixed Points and Concurrent Priority Games.

Bruno Karelovic, Wieslaw Zielonka

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

On the values of repeated games with signals.

Hugo Gimbert, Jérôme Renault, Sylvain Sorin, Xavier Venel, Wieslaw Zielonka

CoRR, 2014

2012

Blackwell Optimal Strategies in Priority mean-Payoff Games.

Hugo Gimbert, Wieslaw Zielonka

Int. J. Found. Comput. Sci., 2012

2010

Playing in stochastic environment: from multi-armed bandits to two-player games.

Wieslaw Zielonka

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008

Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games.

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Limits of Multi-Discounted Markov Decision Processes.

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Perfect Information Stochastic Priority Games.

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Time-stamps for Mazurkiewicz traces.

Wieslaw Zielonka

Theor. Comput. Sci., 2006

Local Computations in Graphs: The Case of Cellular Edge Local Computations.

Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka

Fundam. Informaticae, 2006

Deterministic Priority Mean-Payoff Games as Limits of Discounted Games.

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Local Computation in Graphs: The Case of Cellular Edge Local Computations.

Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka

Bull. EATCS, 2005

An Invitation to Play.

Wieslaw Zielonka

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Games Where You Can Play Optimally Without Any Memory.

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Discounting Infinite Games But How and Why?

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the Workshop on Games in Design and Verification, 2004

When Can You Play Positionally?

Hugo Gimbert, Wieslaw Zielonka

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Election, Naming and Cellular Edge Local Computations.

Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka

Proceedings of the Graph Transformations, Second International Conference, 2004

Perfect-Information Stochastic Parity Games.

Wieslaw Zielonka

Proceedings of the Foundations of Software Science and Computation Structures, 2004

1998

Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.

Wieslaw Zielonka

Theor. Comput. Sci., 1998

Controlled Timed Automata.

François Demichelis, Wieslaw Zielonka

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1995

On the Recognition of Families of Graphs with Local Computations

Igor Litovsky, Yves Métivier, Wieslaw Zielonka

Inf. Comput., April, 1995

Asynchronous Automata.

Wieslaw Zielonka

Proceedings of the Book of Traces, 1995

1994

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.

Paul Gastin, Antoine Petit, Wieslaw Zielonka

Theor. Comput. Sci., 1994

1993

Asynchronous Mappings and Asynchronous Cellular Automata

Robert Cori, Yves Métivier, Wieslaw Zielonka

Inf. Comput., October, 1993

1992

The Power and the Limitations of Local Computations on Graphs.

Igor Litovsky, Yves Métivier, Wieslaw Zielonka

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Semi-Commutations and Rational Expressions.

Mireille Clerbout, Yves Roos, Wieslaw Zielonka

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

A Kleene Theorem for Infinite Trace Languages.

Paul Gastin, Antoine Petit, Wieslaw Zielonka

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1989

Safe Executions of Recognizable Trace Languages by Asynchronous Automata.

Wieslaw Zielonka

Proceedings of the Logic at Botik '89, 1989

1987

Notes on Finite Asynchronous Automata.

Wieslaw Zielonka

RAIRO Theor. Informatics Appl., 1987