• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 45 matches

• 2024
• 
  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)
• 
  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)
• 
  Shaull Almagor, Michaël Cadilhac, Asaf Yeshurun:
  Two-Way One-Counter Nets Revisited. CoRR abs/2410.22845 (2024)
• 2023
• 
  Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez, Ritam Raha:
  Parikh One-Counter Automata. MFCS 2023: 30:1-30:15
• 
  Michaël Cadilhac, Guillermo A. Pérez:
  Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. TACAS (2) 2023: 192-207
• 2022
• 
  Michaël Cadilhac, Charles Paperman:
  The regular languages of wire linear AC⁰. Acta Informatica 59(4): 321-336 (2022)
• 
  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
• 
  Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
  The Regular Languages of First-Order Logic with One Alternation. CoRR abs/2203.06075 (2022)
• 
  Michaël Cadilhac, Guillermo A. Pérez:
  Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. CoRR abs/2204.06079 (2022)
• 
  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)
• 2021
• 
  Michaël Cadilhac:
  Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff. SIGACT News 52(3): 11-13 (2021)
• 2020
• 
  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)
• 
  Michaël Cadilhac, Olivier Carton, Charles Paperman:
  Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16(1) (2020)
• 
  Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
  Rational Subsets of Baumslag-Solitar Groups. ICALP 2020: 116:1-116:16
• 
  Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
  On Polynomial Recursive Sequences. ICALP 2020: 117:1-117:17
• 
  Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
  On polynomial recursive sequences. CoRR abs/2002.08630 (2020)
• 
  Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
  Rational subsets of Baumslag-Solitar groups. CoRR abs/2006.11898 (2020)
• 2019
• 
  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
• 
  Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
  The Algebraic Theory of Parikh Automata. Theory Comput. Syst. 62(5): 1241-1268 (2018)
• 
  Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
  Weak Cost Register Automata Are Still Powerful. DLT 2018: 83-95
• 
  Michaël Cadilhac, Olivier Carton, Charles Paperman:
  Continuity and Rational Functions. CoRR abs/1802.10555 (2018)
• 
  Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
  Weak Cost Register Automata are Still Powerful. CoRR abs/1804.06336 (2018)
• 
  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
• 
  Michaël Cadilhac, Olivier Carton, Charles Paperman:
  Continuity and Rational Functions. ICALP 2017: 115:1-115:14
• 
  Michaël Cadilhac, Charles Paperman:
  A crevice on the Crane Beach: Finite-degree predicates. LICS 2017: 1-9
• 
  Michaël Cadilhac, Charles Paperman:
  A Crevice on the Crane Beach: Finite-Degree Predicates. CoRR abs/1701.02673 (2017)
• 2016
• 
  Michaël Cadilhac:
  Review of: The Golden Ratio and Fibonacci Numbers by Richard A. Dunlap. SIGACT News 47(4): 15-17 (2016)
• 
  Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange:
  A Language-Theoretical Approach to Descriptive Complexity. DLT 2016: 64-76
• 2015
• 
  Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman:
  A Circuit Complexity Approach to Transductions. MFCS (1) 2015: 141-153
• 
  Michaël Cadilhac, Andreas Krebs, Nutan Limaye:
  Value Automata with Filters. CoRR abs/1510.02393 (2015)

skipping 15 more matches