The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wieslaw Zielonka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  23. Blackwell-Optimal Strategies in Priority Mean-Payoff Games [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002