195

156

• 
  Reinis Cirpons, Florent Hivert, Assia Mahboubi, Guillaume Melquiond, James D Mitchell, et al.. Certifying the Decidability of the Word Problem in Monoids at Large. Certified Programs and Proofs, Jan 2026, Rennes, France. pp.128-142, ⟨10.1145/3779031.3779101⟩. ⟨hal-05448783⟩
• 
  Jȩdrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Centered colorings in minor-closed graph classes. Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2026, Vancouver, Canada. ⟨hal-04819300⟩
• 
  Benjamin Hellouin de Menibus, Victor Lutfalla, Pascal Vanier. Decision problems on geometric tilings. 2025. ⟨hal-04693345v2⟩
• 
  Valentin Dardilhac. Vote mechanisms and solution of inequation systems with real variables. Computational Complexity [cs.CC]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG045⟩. ⟨tel-05300167⟩
• 
  Djamel Eddine Amir, Benjamin Hellouin de Menibus. Minimality and computability of languages of G-shifts. ICALP 2025, Aarhus University, Jul 2025, Aarhus, Denmark. ⟨hal-05117426⟩
• 
  Felipe Furquim, Valentin Dardilhac, Daniel Cordeiro, Johanne Cohen. Characterizing Strategyproofness Through Score Functions in Voting Mechanisms. Frontiers of Algorithmics (IJTCS-FAW 2025), Jun 2025, Paris, France. pp.279-292, ⟨10.1007/978-981-96-8312-3_21⟩. ⟨hal-05040764⟩
• 
  Manon Blanc. Discrete-Time and Continuous-Time Systems over the Reals : Relating Complexity with Robustness, Length and Precision. Computational Complexity [cs.CC]. Institut Polytechnique de Paris, 2025. English. ⟨NNT : 2025IPPAX024⟩. ⟨tel-05118950⟩
• 
  Nicolas Atienza, Christophe Labreuche, Johanne Cohen, Michèle Sebag. Provably Safeguarding a Classifier from OOD and Adversarial Samples: an Extreme Value Theory Approach. 13th International Conference on Learning Representations - ICLR 2025, Apr 2025, Singapore, Singapore. ⟨hal-04922382⟩
• 
  Pierre Thomas Froidevaux, Alexandre Blondin-Massé, Chiara Marmo, Jérémy Neveu, Jean Privat, et al.. Travo. 2025, ⟨swh:1:dir:25c53be9cb372dca46dc311c114c9d961127225b;origin=https://gitlab.com/travo-cr/travo;visit=swh:1:snp:5f0faa62d3619f576a8a041c609ac66820f54a80;anchor=swh:1:rev:fd9302aab27cb93dc1ef24b3ab13a3da163564ca⟩. ⟨hal-05030605⟩
• 
  Benjamin Hellouin de Menibus, Ville Salo, Ilkka Törmä. Symbol Frequencies in Surjective Cellular Automata. 2025. ⟨hal-05026614⟩
• 
  Nicolas Atienza. Towards Reliable ML : Leveraging Multi-Modal Representations, Information Bottleneck and Extreme Value Theory. Machine Learning [stat.ML]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG025⟩. ⟨tel-05140441⟩
• 
  Benjamin Hellouin de Menibus, Pacôme Perrotin. Subshifts Defined by Nondeterministic and Alternating Plane-walking Automata. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Iena, Germany. pp.56, ⟨10.4230/LIPIcs.STACS.2025.56⟩. ⟨hal-04951292⟩
• 
  Christophe Hohlweg, Viviane Pons. A conjecture on descents, inversions and the weak order. 2025. ⟨hal-04966542⟩
• 
  Jean-Philippe Chancelier, Michel de Lara, Antoine Deza, Lionel Pournin. Geometry of Sparsity-Inducing Norms. 2025. ⟨hal-04886852⟩
• 
  Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Weak coloring numbers of minor-closed graph classes. ACM-SIAM Symposium on Discrete Algorithms (SODA25), Jan 2025, New Orleans, United States. pp.3325-3334, ⟨10.1137/1.9781611978322.107⟩. ⟨hal-04819269⟩
• 
  Johanne Cohen, Laurence Pilard, Jonas Sénizergues. Autostabilizing Minimal Clique Decomposition with Byzantine Faults tolerance. 2025. ⟨hal-04872001⟩
• 
  Emmanuel Goutierre. Machine learning-based particle accelerator modeling. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG106⟩. ⟨tel-04995631⟩
• 
  Stijn Cambie, François Dross, Kolja Knauer, Xuan Hoang La, Petru Valicov. Partitions of planar (oriented) graphs into a connected acyclic and an independent set. 2024. ⟨hal-04840861⟩
• 
  Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Quickly excluding an apex-forest. 2024. ⟨hal-04819247⟩
• 
  Nathalie Aubrun, Nicolás Bitar. Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics. The Electronic Journal of Combinatorics, 2024, 31 (4), pp.P4.24. ⟨10.37236/13065⟩. ⟨hal-04807272⟩
• 
  Hugo Thimonier. Advancing Anomaly Detection in Tabular Data : A Case-Study on Credit Card Fraud Identification. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG046⟩. ⟨tel-05351694⟩
• 
  Cesar Ceballos, Viviane Pons. The s-weak order and s-permutahedra II: the combinatorial complex of pure intervals. The Electronic Journal of Combinatorics, 2024, 31 (3), pp.P3.12. ⟨10.37236/12438⟩. ⟨hal-04390514⟩
• 
  Nicolas Atienza, Roman Bresson, Cyriaque Rousselot, Philippe Caillou, Johanne Cohen, et al.. Cutting the Black Box: Conceptual Interpretation of a Deep Neural Net with Multi-Modal Embeddings and Multi-Criteria Decision Aid. IJCAI 2024, 33rd International Joint Conference on Artificial Intelligence, Aug 2024, Jeju, South Korea. pp.3669-3678, ⟨10.24963/ijcai.2024/406⟩. ⟨hal-04728875⟩
• 
  Manon Blanc, Olivier Bournez. The Complexity of Computing in Continuous Time: Space Complexity Is Precision. International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.129⟩. ⟨hal-04664615⟩
• 
  Benjamin Hellouin de Menibus, Rémi Pallen. Two-player Domino games. Computability in Europe (CiE) 2024, Jul 2024, Amsterdam, Netherlands. pp 139-152, ⟨10.1007/978-3-031-64309-5_12⟩. ⟨hal-04265421v2⟩
• 
  Pierre Béaur. Algorithmique et combinatoire des mots par les représentations S-adiques. Mathématique discrète [cs.DM]. Université Paris-Saclay, 2024. Français. ⟨NNT : 2024UPASG033⟩. ⟨tel-04661982⟩
• 
  Nicolás Bitar. Subshifts of Finite Type on Groups : Emptiness and Aperiodicity. Dynamical Systems [math.DS]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG034⟩. ⟨tel-04635844⟩
• 
  Nathalie Aubrun, Michael Schraudner. Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag–Solitar groups BS ( 1 , n ). Comptes Rendus. Mathématique, 2024, 362 (G5), pp.553-580. ⟨10.5802/crmath.571⟩. ⟨hal-04727536⟩
• 
  Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser. Maximal Line Digraphs. 2024. ⟨hal-04587485v2⟩
• 
  Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing minimum cycle bases intersection. 2024. ⟨hal-04559959v2⟩