Evaluating Complex MAC Protocols for Sensor Networks with APMC. - Michaël Cadilhac; Thomas Hérault; Richard Lassaigne; Sylvain Peyronnet; Sébastien Tixeuil (AVoCS, 2006)

On the Expressiveness of Parikh Automata and Related Models. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (NCMA, 2011)

Storming the Parikh Automaton - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (CoRR, 2011)

Review of combinatorics: a guided tour by David R. Mazur. - Michaël Cadilhac (SIGACT News, 2011)

Bounded Parikh Automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (Int. J. Found. Comput. Sci., 2012)

Affine Parikh automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (RAIRO Theor. Informatics Appl., 2012)

Review of handbook of weighted automata, edited by Manfred Droste, Werner Kuich and Heiko Vogler. - Michaël Cadilhac (SIGACT News, 2012)

The Algebraic Theory of Parikh Automata. - Michaël Cadilhac; Andreas Krebs; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2013)

Unambiguous constrained Automata. - Michaël Cadilhac; Alain Finkel; Pierre McKenzie (Int. J. Found. Comput. Sci., 2013)

Review of proofs and algorithms by Gilles Dowek (translation by Maribel Fernandez). - Michaël Cadilhac (SIGACT News, 2013)

Extremely uniform branching programs. - Michaël Cadilhac; Andreas Krebs; Pierre McKenzie (NCMA, 2014)

Review of graph structure and monadic second-order logic: a language-theoretic approach by Bruno Courcelle and Joost Engelfriet. - Michaël Cadilhac (SIGACT News, 2014)

A Circuit Complexity Approach to Transductions. - Michaël Cadilhac; Andreas Krebs; Michael Ludwig; Charles Paperman (MFCS (1), 2015)

Value Automata with Filters. - Michaël Cadilhac; Andreas Krebs; Nutan Limaye (CoRR, 2015)

A Language-Theoretical Approach to Descriptive Complexity. - Michaël Cadilhac; Andreas Krebs; Klaus-Jörn Lange (DLT, 2016)

Review of: The Golden Ratio and Fibonacci Numbers by Richard A. Dunlap. - Michaël Cadilhac (SIGACT News, 2016)

Continuity and Rational Functions. - Michaël Cadilhac; Olivier Carton; Charles Paperman (ICALP, 2017)

A crevice on the Crane Beach: Finite-degree predicates. - Michaël Cadilhac; Charles Paperman (LICS, 2017)

The Impatient May Use Limited Optimism to Minimize Regret. - Michaël Cadilhac; Guillermo A. Pérez 001; Marie van den Bogaard (FoSSaCS, 2019)

Rational Subsets of Baumslag-Solitar Groups. - Michaël Cadilhac; Dmitry Chistikov 001; Georg Zetzsche (ICALP, 2020)

Weak Cost Register Automata are Still Powerful. - Shaull Almagor; Michaël Cadilhac; Filip Mazowiecki; Guillermo A. Pérez 001 (Int. J. Found. Comput. Sci., 2020)

Continuity of Functional Transducers: A Profinite Study of Rational Functions. - Michaël Cadilhac; Olivier Carton; Charles Paperman (Log. Methods Comput. Sci., 2020)

Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff. - Michaël Cadilhac (SIGACT News, 2021)

The Regular Languages of First-Order Logic with One Alternation. - Corentin Barloy; Michaël Cadilhac; Charles Paperman; Thomas Zeume (LICS, 2022)

The regular languages of wire linear AC0. - Michaël Cadilhac; Charles Paperman (Acta Informatica, 2022)

Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. - Michaël Cadilhac; Guillermo A. Pérez 001 (TACAS (2), 2023)

On Polynomial Recursive Sequences. - Michaël Cadilhac; Filip Mazowiecki; Charles Paperman; Michal Pilipczuk; Géraud Sénizergues (Theory Comput. Syst., 2024)

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. - Swen Jacobs; Guillermo A. Pérez 001; 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 001; et al. (Int. J. Softw. Tools Technol. Transf., 2024)

Two-Way One-Counter Nets Revisited. - Shaull Almagor; Michaël Cadilhac; Asaf Yeshurun (CSL, 2025)

Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification. - Michael Blondin; Michaël Cadilhac; Xin-Yi Cui; Philipp Czerner; Javier Esparza; Jakob Schulz (TACAS (3), 2025)

Fast value iteration: A uniform approach to efficient algorithms for energy games. - Michaël Cadilhac; Antonio Casares; Pierre Ohlmann (TACAS (2), 2025)

Parikh one-counter automata. - Michaël Cadilhac; Arka Ghosh 002; Guillermo A. Pérez 001; Ritam Raha (Inf. Comput., 2025)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice. - Michaël Cadilhac; Vanessa Flügel; Guillermo A. Pérez 001; Shrisha Rao 002 (CoRR, 2025)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy. - Andy Yang; Michaël Cadilhac; David Chiang 001 (CoRR, 2025)