default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWieslaw Zielonka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[i2]Hugo Gimbert, Wieslaw Zielonka:
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences. CoRR abs/1611.08487 (2016)- 2015
- [c18]Bruno Karelovic, Wieslaw Zielonka:
Nearest Fixed Points and Concurrent Priority Games. FCT 2015: 381-393 - 2014
- [i1]Hugo Gimbert, Jérôme Renault, Sylvain Sorin, Xavier Venel, Wieslaw Zielonka:
On the values of repeated games with signals. CoRR abs/1406.4248 (2014) - 2012
- [j9]Hugo Gimbert, Wieslaw Zielonka:
Blackwell Optimal Strategies in Priority mean-Payoff Games. Int. J. Found. Comput. Sci. 23(3): 687-711 (2012) - 2010
- [c17]Wieslaw Zielonka:
Playing in stochastic environment: from multi-armed bandits to two-player games. FSTTCS 2010: 65-72 - [c16]Hugo Gimbert, Wieslaw Zielonka:
Blackwell-Optimal Strategies in Priority Mean-Payoff Games. GANDALF 2010: 7-21
2000 – 2009
- 2008
- [c15]Hugo Gimbert, Wieslaw Zielonka:
Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. Logic and Automata 2008: 331-356 - 2007
- [c14]Hugo Gimbert, Wieslaw Zielonka:
Perfect Information Stochastic Priority Games. ICALP 2007: 850-861 - [c13]Hugo Gimbert, Wieslaw Zielonka:
Limits of Multi-Discounted Markov Decision Processes. LICS 2007: 89-98 - 2006
- [j8]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae 74(1): 85-114 (2006) - [j7]Wieslaw Zielonka:
Time-stamps for Mazurkiewicz traces. Theor. Comput. Sci. 356(1-2): 255-262 (2006) - [c12]Hugo Gimbert, Wieslaw Zielonka:
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. ICALP (2) 2006: 312-323 - 2005
- [j6]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS 85: 105-109 (2005) - [c11]Hugo Gimbert, Wieslaw Zielonka:
Games Where You Can Play Optimally Without Any Memory. CONCUR 2005: 428-442 - [c10]Wieslaw Zielonka:
An Invitation to Play. MFCS 2005: 58-70 - 2004
- [c9]Wieslaw Zielonka:
Perfect-Information Stochastic Parity Games. FoSSaCS 2004: 499-513 - [c8]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Election, Naming and Cellular Edge Local Computations. ICGT 2004: 242-256 - [c7]Hugo Gimbert, Wieslaw Zielonka:
When Can You Play Positionally? MFCS 2004: 686-697 - [c6]Hugo Gimbert, Wieslaw Zielonka:
Discounting Infinite Games But How and Why? GDV@CAV 2004: 3-9
1990 – 1999
- 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]François Demichelis, Wieslaw Zielonka:
Controlled Timed Automata. CONCUR 1998: 455-469 - 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) - [p1]Wieslaw Zielonka:
Asynchronous Automata. The Book of Traces 1995: 205-247 - 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
1980 – 1989
- 1989
- [c1]Wieslaw Zielonka:
Safe Executions of Recognizable Trace Languages by Asynchronous Automata. Logic at Botik 1989: 278-289 - 1987
- [j1]Wieslaw Zielonka:
Notes on Finite Asynchronous Automata. RAIRO Theor. Informatics Appl. 21(2): 99-135 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
