Efficient Consequence Finding. - Laurent Simon 001; Alvaro del Val (IJCAI, 2001)

The Essentials of the SAT 2003 Competition. - Daniel Le Berre; Laurent Simon 001 (SAT, 2003)

Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. - Daniel Le Berre; Laurent Simon 001; Armando Tacchella (SAT, 2003)

The Second QBF Solvers Comparative Evaluation. - Daniel Le Berre; Massimo Narizzano; Laurent Simon 001; Armando Tacchella (SAT (Selected Papers, 2004)

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. - Daniel Le Berre; Laurent Simon 001 (SAT (Selected Papers, 2004)

A parsimony tree for the SAT2002 competition. - Paul W. Purdom; Daniel Le Berre; Laurent Simon 001 (Ann. Math. Artif. Intell., 2005)

The SAT2002 competition. - Laurent Simon 001; Daniel Le Berre; Edward A. Hirsch (Ann. Math. Artif. Intell., 2005)

Preface to the Special Volume on the SAT 2005 Competitions and Evaluations. - Daniel Le Berre; Laurent Simon 001 (J. Satisf. Boolean Model. Comput., 2006)

GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability. - Gilles Audemard; Laurent Simon 001 (IJCAI, 2007)

Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms. - Gilles Audemard; Laurent Simon 001 (CP, 2008)

Predicting Learnt Clauses Quality in Modern SAT Solvers. - Gilles Audemard; Laurent Simon 001 (IJCAI, 2009)

A Restriction of Extended Resolution for Clause Learning SAT Solvers. - Gilles Audemard; George Katsirelos; Laurent Simon 001 (AAAI, 2010)

Minimum Satisfiability and Its Applications. - Chu Min Li 001; Zhu Zhu; Felip Manyà; Laurent Simon 001 (IJCAI, 2011)

Refining Restarts Strategies for SAT and UNSAT. - Gilles Audemard; Laurent Simon 001 (CP, 2012)

Eigenvector Centrality in Industrial SAT Instances. - George Katsirelos; Laurent Simon 001 (CP, 2012)

Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation). - George Katsirelos; Laurent Simon 001 (SAT, 2012)

Optimizing with minimum satisfiability. - Chu Min Li 001; Zhu Zhu; Felip Manyà; Laurent Simon 001 (Artif. Intell., 2012)

The International SAT Solver Competitions. - Matti Järvisalo; Daniel Le Berre; Olivier Roussel; Laurent Simon 001 (AI Mag., 2012)

Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers. - George Katsirelos; Ashish Sabharwal; Horst Samulowitz; Laurent Simon 001 (AAAI, 2013)

Just-In-Time Compilation of Knowledge Bases. - Gilles Audemard; Jean-Marie Lagniez; Laurent Simon 001 (IJCAI, 2013)

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. - Gilles Audemard; Jean-Marie Lagniez; Laurent Simon 001 (SAT, 2013)

SAT-Based Metabolics Pathways Analysis without Compilation. - Sabine Pérès; Martin Morterol; Laurent Simon 001 (CMSB, 2014)

Lazy Clause Exchange Policy for Parallel SAT Solvers. - Gilles Audemard; Laurent Simon 001 (SAT, 2014)

Impact of Community Structure on SAT Solver Performance. - Zack Newsham; Vijay Ganesh 001; Sebastian Fischmeister; Gilles Audemard; Laurent Simon 001 (SAT, 2014)

Améliorer SAT dans le cadre incrémental. - Gilles Audemard; Armin Biere; Jean-Marie Lagniez; Laurent Simon 001 (Rev. d'Intelligence Artif., 2014)

Using Community Structure to Detect Relevant Learnt Clauses. - Carlos Ansótegui; Jesús Giráldez-Cru; Jordi Levy; Laurent Simon 001 (SAT, 2015)

Extreme Cases in SAT Problems. - Gilles Audemard; Laurent Simon 001 (SAT, 2016)

On Selecting Constraints for Replication in Model Checking. - Guillaume Baud-Berthier; Laurent Simon 001 (ICTAI, 2017)

On the Community Structure of Bounded Model Checking SAT Problems. - Guillaume Baud-Berthier; Jesús Giráldez-Cru; Laurent Simon 001 (SAT, 2017)

On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers. - Rohan Fossé; Laurent Simon 001 (CP, 2018)

Zigzagging Strategies for Temporal Induction. - Guillaume Baud-Berthier; Laurent Simon 001 (ICTAI, 2018)

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. - Jan Elffers; Jesús Giráldez-Cru; Stephan Gocht; Jakob Nordström; Laurent Simon 001 (IJCAI, 2018)

On the Glucose SAT Solver. - Gilles Audemard; Laurent Simon 001 (Int. J. Artif. Intell. Tools, 2018)

Community Structure in Industrial SAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jesús Giráldez-Cru; Jordi Levy; Laurent Simon 001 (J. Artif. Intell. Res., 2019)

FuzzFactory: domain-specific fuzzing with waypoints. - Rohan Padhye; Caroline Lemieux; Koushik Sen; Laurent Simon 001; Hayawardh Vijayakumar (Proc. ACM Program. Lang., 2019)

SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. - Gilles Audemard; Loïc Paulevé; Laurent Simon 001 (SAT, 2020)

The Dungeon Variations Problem Using Constraint Programming. - Gaël Glorian; Adrien Debesson; Sylvain Yvon-Paliot; Laurent Simon 001 (CP, 2021)

Statistical Comparison of Algorithm Performance Through Instance Selection. - Théo Matricon; Marie Anastacio; Nathanaël Fijalkow; Laurent Simon 001; Holger H. Hoos (CP, 2021)

FuzzBench: an open fuzzer benchmarking platform and service. - Jonathan Metzman; László Szekeres; Laurent Simon 001; Read Sprabery; Abhishek Arya (ESEC/SIGSOFT FSE, 2021)

Partially Supervised Classification for Early Concept Drift Detection. - Maxime Fuccellaro; Laurent Simon 001; Akka Zemmari (ICTAI, 2022)

A Robust Drift Detection Algorithm with High Accuracy and Low False Positives Rate. - Maxime Fuccellaro; Laurent Simon 001; Akka Zemmari (SafeAI@AAAI, 2023)

Image Drift: Introducing Gaussian Split Detector. - Maxime Fuccellaro; Laurent Simon 001; Akka Zemmari (IPTA, 2024)

Drift Detection: Introducing Gaussian Split Detector. - Maxime Fuccellaro; Laurent Simon 001; Akka Zemmari (CoRR, 2024)

An Explainable Diagnostic Framework for Neurodegenerative Dementias via Reinforcement-Optimized LLM Reasoning. - Andrew Zamai; Nathanaël Fijalkow; Boris Mansencal; Laurent Simon 001; Eloi Navet; Pierrick Coupé (CoRR, 2025)