• 
  Paul Dorbec, Fatma Kaci. Disjoint Maximal Independent Sets in Graphs and Hypergraphs. 2022. ⟨hal-03641758⟩
• 
  Léo Paviet Salomon, Pascal Vanier. Realizing finitely presented groups as projective fundamental groups of SFTs. 2022. ⟨hal-03622497⟩
• 
  Julien Courtiel, Paul Dorbec, Romain Lecoq. Theoretical analysis of git bisect. 2021. ⟨hal-03431454⟩
• 
  Ghiles Ziat, Matthieu Dien, Vincent Botbol. Automated Random Testing of Numerical Constrained Types. 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Oct 2021, Montpellier, France. ⟨10.4230/LIPIcs.CP.2021.59⟩. ⟨hal-03667623⟩
• 
  Marthe Bonamy, Paul Dorbec, Paul Ouvrard. Dominating sets reconfiguration under token sliding. 2021. ⟨hal-02394839v2⟩
• 
  Théo Grente, Etienne Grandjean. Conjunctive grammars, cellular automata and logic. 2021. ⟨hal-03167529⟩
• 
  Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski. Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. Discrete Mathematics and Theoretical Computer Science, DMTCS, In press, Computational Logic and Applications (CLA'19), vol. 22 no. 3, Computational Logic and Applications (CLA'19) (3), ⟨10.46298/dmtcs.5820⟩. ⟨hal-02301925v4⟩
• 
  Theo Grente. Caractérisation et programmation en théorie des langages et en logique des classes de complexité efficace des automates cellulaires. Arithmétique des ordinateurs. Normandie Université, 2020. Français. ⟨NNT : 2020NORMC214⟩. ⟨tel-03093951⟩
• 
  Julien Courtiel, Andrew Elvey Price, Irène Marcovici. Bijections between walks inside a triangular domain and Motzkin paths of bounded amplitude. 2020. ⟨hal-02901546⟩
• 
  Valerie Berthe, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín D Safe, et al.. Two Arithmetical Sources and Their Associated Tries. 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2020, Klagenfurt, Austria. ⟨10.4230/LIPIcs.AofA.2020.4⟩. ⟨hal-02868527⟩
• 
  Etienne Grandjean, Théo Grente, Véronique Terrier. Inductive definitions in logic versus programs of real-time cellular automata. 2020. ⟨hal-02474520⟩
• 
  Julien Courtiel, Karen Yeats. Next-to$^k$ leading log expansions by chord diagrams. Communications in Mathematical Physics, Springer Verlag, 2020, 377, pp.469-501. ⟨10.1007/s00220-020-03691-7⟩. ⟨hal-02153783v2⟩
• 
  Paul Dorbec. Power domination in graphs. Topics in Domination in Graphs, 2020, 978-3-030-51117-3. ⟨10.1007/978-3-030-51117-3_16⟩. ⟨hal-03073783⟩
• 
  Julien Courtiel, Karen Yeats, Noam Zeilberger. Connected chord diagrams and bridgeless maps. The Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (4), pp.1-56. ⟨10.37236/7400⟩. ⟨hal-01650141v2⟩
• 
  Véronique Terrier. Communication complexity tools on recognizable picture languages. Theoretical Computer Science, Elsevier, 2019, ⟨10.1016/j.tcs.2019.05.040⟩. ⟨hal-02151118⟩
• 
  Heribert Vollmer, Brigitte Vallée. Guest Editorial: Special Issue on Theoretical Aspects of Computer Science (2017). Theory of Computing Systems, Springer Verlag, 2019, 63 (5), pp.923-925. ⟨10.1007/s00224-019-09934-y⟩. ⟨hal-02735297⟩
• 
  Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée. Dichotomic Selection on Words: A Probabilistic Analysis. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), Jun 2019, Pisa, Italy. pp.19:1-19:19, ⟨10.4230/LIPIcs.CPM.2019.19⟩. ⟨hal-02152162⟩
• 
  Etienne Grandjean, Théo Grente. Descriptive complexity for minimal time of cellular automata. 2019. ⟨hal-02020180v3⟩
• 
  Brigitte Vallée. The Depoissonisation Quintet: Rice-Poisson-Mellin-Newton-Laplace. 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Jun 2018, Uppsala, Sweden. pp.35, ⟨10.4230/LIPIcs.AofA.2018.35⟩. ⟨hal-01709408⟩
• 
  Olivier Bodini, Julien Courtiel, Sergey Dovgal, Hsien-Kuei Hwang. Asymptotic distribution of parameters in random maps. 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Jun 2018, Uppsala, Sweden. pp.13:1-13:12, ⟨10.4230/LIPIcs.AofA.2018.13⟩. ⟨hal-01900814⟩

273