| 2006 |
| 19 | EE | Gilles Dequen,
Olivier Dubois:
An Efficient Approach to Solving Random k-satProblems.
J. Autom. Reasoning 37(4): 261-276 (2006) |
| 2005 |
| 18 | EE | Yacine Boufkhad,
Olivier Dubois,
Yannet Interian,
Bart Selman:
Regular Random k-SAT: Properties of Balanced Formulas.
J. Autom. Reasoning 35(1-3): 181-200 (2005) |
| 2004 |
| 17 | EE | Olivier Dubois,
Guy Louchard,
Jacques Mandler:
Additive Decompositions, Random Allocations, and Threshold Phenomena.
Combinatorics, Probability & Computing 13(4-5): 537-575 (2004) |
| 2003 |
| 16 | EE | Gilles Dequen,
Olivier Dubois:
kcnfs: An Efficient Solver for Random k-SAT Formulae.
SAT 2003: 486-501 |
| 15 | | Nadia Creignou,
Hervé Daudé,
Olivier Dubois:
Approximating The Satisfiability Threshold For Random K-Xor-Formulas.
Combinatorics, Probability & Computing 12(2): (2003) |
| 14 | EE | Olivier Dubois,
Yacine Boufkhad,
Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold
Electronic Colloquium on Computational Complexity (ECCC) 10(007): (2003) |
| 13 | | Yacine Boufkhad,
Olivier Dubois,
Maurice Nivat:
Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
Theor. Comput. Sci. 290(3): 1647-1664 (2003) |
| 2002 |
| 12 | EE | Olivier Dubois,
Jacques Mandler:
The 3-XORSAT Threshold.
FOCS 2002: 769-778 |
| 11 | EE | Olivier Dubois,
Yacine Boufkhad,
Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold
CoRR cs.DM/0211036: (2002) |
| 2001 |
| 10 | EE | Olivier Dubois,
Gilles Dequen:
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10.
CP 2001: 108-120 |
| 9 | | Olivier Dubois,
Gilles Dequen:
A backbone-search heuristic for efficient solving of hard 3-SAT formulae.
IJCAI 2001: 248-253 |
| 8 | EE | Nadia Creignou,
Hervé Daudé,
Olivier Dubois:
Approximating the satisfiability threshold for random k-XOR-formulas
CoRR cs.DM/0106001: (2001) |
| 7 | EE | Olivier Dubois,
Rémi Monasson,
Bart Selman,
Riccardo Zecchina:
Editorial.
Theor. Comput. Sci. 265(1-2): 1 (2001) |
| 6 | EE | Olivier Dubois:
Upper bounds on the satisfiability threshold.
Theor. Comput. Sci. 265(1-2): 187-197 (2001) |
| 2000 |
| 5 | EE | Olivier Dubois,
Yacine Boufkhad,
Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold.
SODA 2000: 126-127 |
| 1999 |
| 4 | EE | Antoine Fache,
Olivier Dubois,
Alain Billat:
On the invertibility of the RBF model in a predictive control strategy.
ESANN 1999: 381-386 |
| 3 | EE | Yacine Boufkhad,
Olivier Dubois:
Length of Prime Implicants and Number of Solutions of Random CNF Formulae.
Theor. Comput. Sci. 215(1-2): 1-30 (1999) |
| 1991 |
| 2 | | Olivier Dubois:
Counting the Number of Solutions for Instances of Satisfiability.
Theor. Comput. Sci. 81(1): 49-64 (1991) |
| 1 | | Olivier Dubois,
Jacques Carlier:
Probabilistic approach to the Satisfiability Problem.
Theor. Comput. Sci. 81(1): 65-75 (1991) |