Olivier Dubois

22 papers A* 3A 2Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2011 J jnl
Second moment method for a family of boolean CSP
CoRR
Yacine Boufkhad, Olivier Dubois
2006 J jnl
An Efficient Approach to Solving Random
J. Autom. Reason.
Gilles Dequen, Olivier Dubois
2005 J jnl
Regular Random
J. Autom. Reason.
Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
2004 J jnl
Additive Decompositions, Random Allocations, and Threshold Phenomena.
Comb. Probab. Comput.
Olivier Dubois, Guy Louchard, Jacques Mandler
2003 J jnl
Approximating The Satisfiability Threshold For Random K-Xor-Formulas.
Comb. Probab. Comput.
Nadia Creignou, Hervé Daudé, Olivier Dubois
2003 J jnl
Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
Theor. Comput. Sci.
Yacine Boufkhad, Olivier Dubois, Maurice Nivat
2003 J jnl
Typical random 3-SAT formulae and the satisfiability threshold
Electron. Colloquium Comput. Complex.
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
2003 A conf
kcnfs: An Efficient Solver for Random k-SAT Formulae.
SAT
Gilles Dequen, Olivier Dubois
2002 A* conf
The 3-XORSAT Threshold.
FOCS
Olivier Dubois, Jacques Mandler
2002 J jnl
Typical random 3-SAT formulae and the satisfiability threshold
CoRR
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
2001 A* conf
A backbone-search heuristic for efficient solving of hard 3-SAT formulae.
IJCAI
Olivier Dubois, Gilles Dequen
2001 J jnl
Approximating the satisfiability threshold for random k-XOR-formulas
CoRR
Nadia Creignou, Hervé Daudé, Olivier Dubois
2001 J jnl
Editorial.
Theor. Comput. Sci.
Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina
2001 A conf
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10.
CP
Olivier Dubois, Gilles Dequen
2001 J jnl
Upper bounds on the satisfiability threshold.
Theor. Comput. Sci.
Olivier Dubois
2000 A* conf
Typical random 3-SAT formulae and the satisfiability threshold.
SODA
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
1999 J jnl
Length of Prime Implicants and Number of Solutions of Random CNF Formulae.
Theor. Comput. Sci.
Yacine Boufkhad, Olivier Dubois
1993 — conf
SAT versus UNSAT.
Cliques, Coloring, and Satisfiability
Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier
1991 J jnl
Counting the Number of Solutions for Instances of Satisfiability.
Theor. Comput. Sci.
Olivier Dubois
1991 J jnl
Probabilistic approach to the Satisfiability Problem.
Theor. Comput. Sci.
Olivier Dubois, Jacques Carlier
1990 J jnl
On the r, s-SAT satisfiability problem and a conjecture of Tovey.
Discret. Appl. Math.
Olivier Dubois
1989 J jnl
Number of solutions of Satisfiability Instances - Applications to Knowledge Bases.
Int. J. Pattern Recognit. Artif. Intell.
J. C. Simon, Olivier Dubois