Number of solutions of Satisfiability Instances - Applications to Knowledge Bases. - J. C. Simon; Olivier Dubois 002 (Int. J. Pattern Recognit. Artif. Intell., 1989)

On the r, s-SAT satisfiability problem and a conjecture of Tovey. - Olivier Dubois 002 (Discret. Appl. Math., 1990)

Counting the Number of Solutions for Instances of Satisfiability. - Olivier Dubois 002 (Theor. Comput. Sci., 1991)

Probabilistic approach to the Satisfiability Problem. - Olivier Dubois 002; Jacques Carlier (Theor. Comput. Sci., 1991)

SAT versus UNSAT. - Olivier Dubois 002; Pascal André; Yacine Boufkhad; Jacques Carlier (Cliques, Coloring, and Satisfiability, 1993)

Length of Prime Implicants and Number of Solutions of Random CNF Formulae. - Yacine Boufkhad; Olivier Dubois 002 (Theor. Comput. Sci., 1999)

The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. - Olivier Dubois 002; Gilles Dequen (CP, 2001)

A backbone-search heuristic for efficient solving of hard 3-SAT formulae. - Olivier Dubois 002; Gilles Dequen (IJCAI, 2001)

Upper bounds on the satisfiability threshold. - Olivier Dubois 002 (Theor. Comput. Sci., 2001)

Editorial. - Olivier Dubois 002; Rémi Monasson; Bart Selman; Riccardo Zecchina (Theor. Comput. Sci., 2001)

The 3-XORSAT Threshold. - Olivier Dubois 002; Jacques Mandler (FOCS, 2002)

kcnfs: An Efficient Solver for Random k-SAT Formulae. - Gilles Dequen; Olivier Dubois 002 (SAT, 2003)

Approximating The Satisfiability Threshold For Random K-Xor-Formulas. - Nadia Creignou; Hervé Daudé; Olivier Dubois 002 (Comb. Probab. Comput., 2003)

Typical random 3-SAT formulae and the satisfiability threshold - Olivier Dubois 002; Yacine Boufkhad; Jacques Mandler (Electron. Colloquium Comput. Complex., 2003)

Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. - Yacine Boufkhad; Olivier Dubois 002; Maurice Nivat (Theor. Comput. Sci., 2003)

Additive Decompositions, Random Allocations, and Threshold Phenomena. - Olivier Dubois 002; Guy Louchard; Jacques Mandler (Comb. Probab. Comput., 2004)

Regular Random k-SAT: Properties of Balanced Formulas. - Yacine Boufkhad; Olivier Dubois 002; Yannet Interian; Bart Selman (J. Autom. Reason., 2005)

An Efficient Approach to Solving Random k-satProblems. - Gilles Dequen; Olivier Dubois 002 (J. Autom. Reason., 2006)

Second moment method for a family of boolean CSP - Yacine Boufkhad; Olivier Dubois 002 (CoRR, 2011)