default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichaël Cadilhac
Person information
- affiliation: DePaul University, Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Michaël Cadilhac
, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. Theory Comput. Syst. 68(4): 593-614 (2024)- [j14]Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. Int. J. Softw. Tools Technol. Transf. 26(5): 551-567 (2024) - 2022
- [j13]Michaël Cadilhac, Charles Paperman:
The regular languages of wire linear AC0. Acta Informatica 59(4): 321-336 (2022) - 2021
- [j12]Michaël Cadilhac:
Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff. SIGACT News 52(3): 11-13 (2021) - 2020
- [j11]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata are Still Powerful. Int. J. Found. Comput. Sci. 31(6): 689-709 (2020) - [j10]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16(1) (2020) - 2018
- [j9]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. Theory Comput. Syst. 62(5): 1241-1268 (2018) - 2016
- [j8]Michaël Cadilhac:
Review of: The Golden Ratio and Fibonacci Numbers by Richard A. Dunlap. SIGACT News 47(4): 15-17 (2016) - 2014
- [j7]Michaël Cadilhac:
Review of graph structure and monadic second-order logic: a language-theoretic approach by Bruno Courcelle and Joost Engelfriet. SIGACT News 45(3): 24-25 (2014) - 2013
- [j6]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous constrained Automata. Int. J. Found. Comput. Sci. 24(7): 1099-1116 (2013) - [j5]Michaël Cadilhac:
Review of proofs and algorithms by Gilles Dowek (translation by Maribel Fernandez). SIGACT News 44(4): 35-37 (2013) - 2012
- [j4]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23(8): 1691-1710 (2012) - [j3]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Affine Parikh automata. RAIRO Theor. Informatics Appl. 46(4): 511-545 (2012) - [j2]Michaël Cadilhac:
Review of handbook of weighted automata, edited by Manfred Droste, Werner Kuich and Heiko Vogler. SIGACT News 43(3): 32-37 (2012) - 2011
- [j1]Michaël Cadilhac:
Review of combinatorics: a guided tour by David R. Mazur. SIGACT News 42(3): 34-36 (2011)
Conference and Workshop Papers
- 2023
- [c17]Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez, Ritam Raha:
Parikh One-Counter Automata. MFCS 2023: 30:1-30:15 - [c16]Michaël Cadilhac, Guillermo A. Pérez:
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. TACAS (2) 2023: 192-207 - 2022
- [c15]Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. LICS 2022: 58:1-58:11 - 2020
- [c14]Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
Rational Subsets of Baumslag-Solitar Groups. ICALP 2020: 116:1-116:16 - [c13]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. ICALP 2020: 117:1-117:17 - 2019
- [c12]Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard:
The Impatient May Use Limited Optimism to Minimize Regret. FoSSaCS 2019: 133-149 - 2018
- [c11]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata Are Still Powerful. DLT 2018: 83-95 - 2017
- [c10]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity and Rational Functions. ICALP 2017: 115:1-115:14 - [c9]Michaël Cadilhac, Charles Paperman:
A crevice on the Crane Beach: Finite-degree predicates. LICS 2017: 1-9 - 2016
- [c8]Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange:
A Language-Theoretical Approach to Descriptive Complexity. DLT 2016: 64-76 - 2015
- [c7]Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman:
A Circuit Complexity Approach to Transductions. MFCS (1) 2015: 141-153 - 2014
- [c6]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
Extremely uniform branching programs. NCMA 2014: 73-83 - 2013
- [c5]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. CAI 2013: 60-73 - 2012
- [c4]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous Constrained Automata. Developments in Language Theory 2012: 239-250 - 2011
- [c3]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
On the Expressiveness of Parikh Automata and Related Models. NCMA 2011: 103-119 - [c2]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. WORDS 2011: 93-102 - 2006
- [c1]Michaël Cadilhac, Thomas Hérault, Richard Lassaigne, Sylvain Peyronnet, Sébastien Tixeuil:
Evaluating Complex MAC Protocols for Sensor Networks with APMC. AVoCS 2006: 33-46
Informal and Other Publications
- 2022
- [i12]Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. CoRR abs/2203.06075 (2022) - [i11]Michaël Cadilhac, Guillermo A. Pérez:
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. CoRR abs/2204.06079 (2022) - [i10]Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR abs/2206.00251 (2022) - 2020
- [i9]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On polynomial recursive sequences. CoRR abs/2002.08630 (2020) - [i8]Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
Rational subsets of Baumslag-Solitar groups. CoRR abs/2006.11898 (2020) - 2018
- [i7]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity and Rational Functions. CoRR abs/1802.10555 (2018) - [i6]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata are Still Powerful. CoRR abs/1804.06336 (2018) - [i5]Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard:
The Impatient May Use Limited Optimism to Minimize Regret. CoRR abs/1811.07146 (2018) - 2017
- [i4]Michaël Cadilhac, Charles Paperman:
A Crevice on the Crane Beach: Finite-Degree Predicates. CoRR abs/1701.02673 (2017) - 2015
- [i3]Michaël Cadilhac, Andreas Krebs, Nutan Limaye:
Value Automata with Filters. CoRR abs/1510.02393 (2015) - 2013
- [i2]Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
The Algebraic Theory of Parikh Automata. Electron. Colloquium Comput. Complex. TR13 (2013) - 2011
- [i1]Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Storming the Parikh Automaton. CoRR abs/1101.1547 (2011)
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-10-16 21:27 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:
