• 
  Julien Courtiel, Martin Pépin. Random Generation of Git Graphs. 2024. ⟨hal-04487862⟩
• 
  Etienne Grandjean, Théo Grente, Véronique Terrier. Inductive definitions in logic versus programs of real-time cellular automata. Theoretical Computer Science, 2024, 987, pp.1-69. ⟨hal-02474520⟩
• 
  Paul Dorbec, Michael Antony Henning. The 1/3-conjectures for domination in cubic graphs. 2024. ⟨hal-04427896⟩
• 
  Antonin Callard, Léo Paviet Salomon, Pascal Vanier. Computability of extender sets in multidimensional subshifts. 2024. ⟨hal-04390697⟩
• 
  Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders. Lattice Signature with Efficient Protocols, Application to Anonymous Credentials. Crypto 2023 - 43rd Annual International Cryptology Conference, Aug 2023, Santa Barbara, United States. pp.351-383, ⟨10.1007/978-3-031-38545-2_12⟩. ⟨hal-04242499⟩
• 
  Malika Izabachène, Lucas Prabel, Adeline Roux-Langlois. Identity-Based Encryption from Lattices Using Approximate Trapdoors. ACISP 2023 - 28th Australasian Conference on Information Security and Privacy, Jul 2023, Brisbane, Australia. pp.270-290, ⟨10.1007/978-3-031-35486-1_13⟩. ⟨hal-04163136⟩
• 
  Benjamin Hellouin de Menibus, Victor H Lutfalla, Camille Noûs. The Domino problem is undecidable on every rhombus subshift. Developments in Language Theory (DLT) 2023, Frank Drewes; Martin Berglund; Johanna Björklund; Lena Strobl, Jun 2023, Umeå, Sweden. ⟨hal-04004801⟩
• 
  Pierre-Alain Fouque, Adela Georgescu, Chen Qian, Adeline Roux-Langlois, Weiqiang Wen. A Generic Transform from Multi-Round Interactive Proof to NIZK. PKC 2023 - International Conference on Practice and Theory of Public-Key Cryptography, May 2023, Atlanta, United States. pp.461-481, ⟨10.1007/978-3-031-31371-4_16⟩. ⟨hal-04163128⟩
• 
  Adeline Roux-Langlois. Using Structured Variants in Lattice-Based Cryptography. École thématique. Journées nationales de calcul formel, Luminy, France. 2023. ⟨hal-04206009⟩
• 
  Julien Courtiel, Paul Dorbec, Romain Lecoq. Theoretical analysis of git bisect. Algorithmica, In press, ⟨10.1007/s00453-023-01194-0⟩. ⟨hal-04354327⟩
• 
  Léo Paviet Salomon, Pascal Vanier. Realizing finitely presented groups as projective fundamental groups of SFTs. Mathematical Foundations of Computer Science (MFCS), 2023, Bordeaux, France. ⟨10.4230/LIPIcs.MFCS.2023.75⟩. ⟨hal-03622497v2⟩
• 
  Paul Dorbec, Fatma Kaci. Disjoint Maximal Independent Sets in Graphs and Hypergraphs. Discussiones Mathematicae Graph Theory, In press, ⟨10.7151/dmgt.2500⟩. ⟨hal-03641758⟩
• 
  Martin Pépin, Alfredo Viola. Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs. 2023. ⟨hal-04551793⟩
• 
  Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen. On the Hardness of Module Learning with Errors with Short Distributions. Journal of Cryptology, 2023, 36 (1), pp.1-72. ⟨10.1007/s00145-022-09441-3⟩. ⟨hal-04028217⟩
• 
  Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen. Entropic Hardness of Module-LWE from Module-NTRU. Indocrypt, Dec 2022, Kolkata, India. pp.78 - 99, ⟨10.1007/978-3-031-22912-1_4⟩. ⟨hal-04028179⟩

170

124