| Regular separability of Parikh automata L Clemente, W Czerwiński, S Lasota, C Paperman arXiv preprint arXiv:1612.06233, 2016 | 27 | 2016 |
| Separability of reachability sets of vector addition systems L Clemente, W Czerwiński, S Lasota, C Paperman arXiv preprint arXiv:1609.00214, 2016 | 23 | 2016 |
| On polynomial recursive sequences M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues Theory of Computing Systems, 1-22, 2021 | 18 | 2021 |
| Efficient enumeration for annotated grammars A Amarilli, L Jachiet, M Muñoz, C Riveros Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022 | 14 | 2022 |
| Two-variable first order logic with modular predicates over words L Dartois, C Paperman 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 12 | 2013 |
| Dynamic membership for regular languages A Amarilli, L Jachiet, C Paperman arXiv preprint arXiv:2102.07728, 2021 | 11 | 2021 |
| Continuity and rational functions M Cadilhac, O Carton, C Paperman The 44th International Colloquium on Automata, Languages, and Programming …, 2017 | 11 | 2017 |
| A circuit complexity approach to transductions M Cadilhac, A Krebs, M Ludwig, C Paperman Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 9 | 2015 |
| Alternation hierarchies of first order logic with regular predicates L Dartois, C Paperman Fundamentals of Computation Theory: 20th International Symposium, FCT 2015 …, 2015 | 7 | 2015 |
| Topological sorting under regular constraints A Amarilli, C Paperman arXiv preprint arXiv:1707.04310, 2017 | 6 | 2017 |
| Adding modular predicates to first-order fragments L Dartois, C Paperman arXiv preprint arXiv:1401.6576, 2014 | 6 | 2014 |
| Circuits booléens, prédicats modulaires et langages réguliers C Paperman éditeur inconnu, 2014 | 5 | 2014 |
| Stackless processing of streamed trees C Barloy, F Murlak, C Paperman Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2021 | 4 | 2021 |
| Monadic second-order logic with arbitrary monadic predicates N Fijalkow, C Paperman ACM Transactions on Computational Logic (TOCL) 18 (3), 1-17, 2017 | 4 | 2017 |
| Locality and centrality: The variety ZG A Amarilli, C Paperman Logical Methods in Computer Science 19, 2023 | 3 | 2023 |
| Schema validation via streaming circuits F Murlak, C Paperman, M Pilipczuk Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 3 | 2016 |
| 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) A Dawar, D Kozen, S Ronchi Della Rocca, M Abadi, C Carapelle, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | 3 | 2015 |
| Supporting Descendants in SIMD-Accelerated JSONPath M Gienieczko, F Murlak, C Paperman Proceedings of the 28th ACM International Conference on Architectural …, 2023 | 2 | 2023 |
| Continuity of functional transducers: a profinite study of rational functions M Cadilhac, O Carton, C Paperman Logical Methods in Computer Science 16, 2020 | 2 | 2020 |
| Classes of languages generated by the Kleene star of a word L Daviaud, C Paperman International Symposium on Mathematical Foundations of Computer Science, 167-178, 2015 | 2 | 2015 |
Michaël CadilhacDePaul UniversityVerified email at cadilhac.name
