Approximate Resolution of Hard Numbering Problems. - Olivier Bailleux; Jean-Jacques Chabrier (AAAI/IAAI, Vol. 1, 1996)

Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems. - Olivier Bailleux; Jean-Jacques Chabrier (Intell. Data Anal., 1997)

Local Search for Statistical Counting. - Olivier Bailleux (AAAI/IAAI, 1998)

DISTANCE-SAT: Complexity and Algorithms. - Olivier Bailleux; Pierre Marquis (AAAI/IAAI, 1999)

Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat. - Alain Sidaner; Olivier Bailleux; Jean-Jacques Chabrier (Artificial Evolution, 2001)

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms. - Emmanuel Sapin; Olivier Bailleux; Jean-Jacques Chabrier (Artificial Evolution, 2003)

Efficient CNF Encoding of Boolean Cardinality Constraints. - Olivier Bailleux; Yacine Boufkhad (CP, 2003)

Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms. - Emmanuel Sapin; Olivier Bailleux; Jean-Jacques Chabrier (EuroGP, 2003)

A New Universal Cellular Automaton Discovered by Evolutionary Algorithms. - Emmanuel Sapin; Olivier Bailleux; Jean-Jacques Chabrier; Pierre Collet (GECCO (1), 2004)

Full CNF Encoding: The Counting Constraints Case. - Olivier Bailleux; Yacine Boufkhad (SAT, 2004)

Some Computational Aspects of distance-sat. - Olivier Bailleux; Pierre Marquis (J. Autom. Reason., 2006)

A Translation of Pseudo Boolean Constraints to SAT. - Olivier Bailleux; Yacine Boufkhad; Olivier Roussel (J. Satisf. Boolean Model. Comput., 2006)

Research of Complexity in Cellular Automata through Evolutionary Algorithms. - Emmanuel Sapin; Olivier Bailleux; Jacqueline Chabrier (Complex Syst., 2007)

Demonstration of the Universality of a New Cellular Automaton. - Emmanuel Sapin; Olivier Bailleux; Jean-Jacques Chabrier; Pierre Collet (Int. J. Unconv. Comput., 2007)

New Encodings of Pseudo-Boolean Constraints into CNF. - Olivier Bailleux; Yacine Boufkhad; Olivier Roussel (SAT, 2009)

Reified unit resolution and the failed literal rule - Olivier Bailleux (CoRR, 2010)

Evolving difficult SAT instances thanks to local search - Olivier Bailleux (CoRR, 2010)

On the CNF encoding of cardinality constraints and beyond - Olivier Bailleux (CoRR, 2010)

BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae - Olivier Bailleux (CoRR, 2011)

On the expressive power of unit resolution - Olivier Bailleux (CoRR, 2011)

Unit contradiction versus unit propagation - Olivier Bailleux (CoRR, 2012)

SAT as a game. - Olivier Bailleux (CoRR, 2015)

Subsumption-driven clause learning with DPLL+restarts. - Olivier Bailleux (CoRR, 2019)

Constraint Reductions. - Olivier Bailleux; Yacine Boufkhad (CoRR, 2020)