default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Colcombet
- > Home > Persons > Thomas Colcombet
Publications
- 2024
[j17]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. Log. Methods Comput. Sci. 20(1) (2024)- [j16]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. TheoretiCS 3 (2024) - 2023
- [i23]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR abs/2305.04323 (2023) - 2022
- [j14]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. 18(3) (2022) - [i19]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. CoRR abs/2212.12024 (2022) - 2021
- [j13]Thomas Colcombet
, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a random population. Log. Methods Comput. Sci. 17(4) (2021) - [c51]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow:
Optimal Transformations of Games and Automata Using Muller Conditions. ICALP 2021: 123:1-123:14 - [i18]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. CoRR abs/2104.05262 (2021) - 2020
- [c49]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a Random Population. FoSSaCS 2020: 119-135 - [i14]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow:
Optimal transformations of Muller conditions. CoRR abs/2011.13041 (2020) - 2019
- [c46]Thomas Colcombet, Nathanaël Fijalkow:
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS 2019: 1-26 - [i11]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a random population. CoRR abs/1911.01195 (2019) - 2018
- [i10]Thomas Colcombet, Nathanaël Fijalkow:
Parity games and universal graphs. CoRR abs/1810.05106 (2018) - 2016
- [c39]Thomas Colcombet, Nathanaël Fijalkow:
The Bridge Between Regular Cost Functions and Omega-Regular Languages. ICALP 2016: 126:1-126:13 - 2014
- [c28]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe. FSTTCS 2014: 379-390
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-09-11 00:32 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:
