2025

Anders, M. et al. (2025) Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables. In: 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26), Singapore, 20-27 January 2026, (Accepted for Publication)

2022

Delaune, Stéphanie, Derbez, Patrick, Gontier, Arthur ORCID: https://orcid.org/0000-0002-9579-5584 and Prud’homme, Charles (2022) New Algorithm for Exhausting Optimal Permutations for Generalized Feistel Networks. In: International Conference on Cryptology in India (INDOCRYPT 2022), Bose Institute, Kolkata, India, 11-14 December 2022, pp. 103-124. ISBN 9783031229114 (doi: 10.1007/978-3-031-22912-1_5)

2021

Delaune, Stéphanie, Derbez, Patrick, Gontier, Arthur ORCID: https://orcid.org/0000-0002-9579-5584 and Prud’Homme, Charles (2021) A Simpler Model for Recovering Superpoly on Trivium. In: 28th International Conference on Selected Areas in Cryptography (SAC2021), 29 September - 1 October 2021, pp. 266-285. ISBN 9783030992767

2020

Gontier, Arthur ORCID: https://orcid.org/0000-0002-9579-5584, Truchet, Charlotte and Prud'Homme, Charles (2020) Conflict Analysis in CP Solving: Explanation Generation from Constraint Decomposition. CP 2020: 26th International Conference on Principles and Practice of Constraint Programming (CP 2020) - Workshop: From Constraint Programming to Trustworthy AI, 7-11 Sept 2020.

Conference or Workshop Item

Gontier, Arthur ORCID: https://orcid.org/0000-0002-9579-5584, Truchet, Charlotte and Prud'Homme, Charles (2020) Conflict Analysis in CP Solving: Explanation Generation from Constraint Decomposition. CP 2020: 26th International Conference on Principles and Practice of Constraint Programming (CP 2020) - Workshop: From Constraint Programming to Trustworthy AI, 7-11 Sept 2020.

Conference Proceedings

Anders, M. et al. (2025) Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables. In: 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26), Singapore, 20-27 January 2026, (Accepted for Publication)

Delaune, Stéphanie, Derbez, Patrick, Gontier, Arthur ORCID: https://orcid.org/0000-0002-9579-5584 and Prud’homme, Charles (2022) New Algorithm for Exhausting Optimal Permutations for Generalized Feistel Networks. In: International Conference on Cryptology in India (INDOCRYPT 2022), Bose Institute, Kolkata, India, 11-14 December 2022, pp. 103-124. ISBN 9783031229114 (doi: 10.1007/978-3-031-22912-1_5)

Delaune, Stéphanie, Derbez, Patrick, Gontier, Arthur ORCID: https://orcid.org/0000-0002-9579-5584 and Prud’Homme, Charles (2021) A Simpler Model for Recovering Superpoly on Trivium. In: 28th International Conference on Selected Areas in Cryptography (SAC2021), 29 September - 1 October 2021, pp. 266-285. ISBN 9783030992767