Olivier Dubois

According to our database, Olivier Dubois authored at least 19 papers between 1989 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Second moment method for a family of boolean CSP

Yacine Boufkhad, Olivier Dubois

CoRR, 2011

2006

An Efficient Approach to Solving Random <i>k</i>-satProblems.

Gilles Dequen, Olivier Dubois

J. Autom. Reason., 2006

2005

Regular Random <i>k</i>-SAT: Properties of Balanced Formulas.

Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman

J. Autom. Reason., 2005

2004

Additive Decompositions, Random Allocations, and Threshold Phenomena.

Olivier Dubois, Guy Louchard, Jacques Mandler

Comb. Probab. Comput., 2004

2003

Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.

Yacine Boufkhad, Olivier Dubois, Maurice Nivat

Theor. Comput. Sci., 2003

Typical random 3-SAT formulae and the satisfiability threshold

Olivier Dubois, Yacine Boufkhad, Jacques Mandler

Electron. Colloquium Comput. Complex., 2003

Approximating The Satisfiability Threshold For Random K-Xor-Formulas.

Nadia Creignou, Hervé Daudé, Olivier Dubois

Comb. Probab. Comput., 2003

kcnfs: An Efficient Solver for Random k-SAT Formulae.

Gilles Dequen, Olivier Dubois

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

The 3-XORSAT Threshold.

Olivier Dubois, Jacques Mandler

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Editorial.

Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina

Theor. Comput. Sci., 2001

Upper bounds on the satisfiability threshold.

Olivier Dubois

Theor. Comput. Sci., 2001

A backbone-search heuristic for efficient solving of hard 3-SAT formulae.

Olivier Dubois, Gilles Dequen

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10.

Olivier Dubois, Gilles Dequen

Proceedings of the Principles and Practice of Constraint Programming, 2001

1999

Length of Prime Implicants and Number of Solutions of Random CNF Formulae.

Yacine Boufkhad, Olivier Dubois

Theor. Comput. Sci., 1999

1993

SAT versus UNSAT.

Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier

Proceedings of the Cliques, 1993

1991

Probabilistic approach to the Satisfiability Problem.

Olivier Dubois, Jacques Carlier

Theor. Comput. Sci., 1991

Counting the Number of Solutions for Instances of Satisfiability.

Olivier Dubois

Theor. Comput. Sci., 1991

1990

On the r, s-SAT satisfiability problem and a conjecture of Tovey.

Olivier Dubois

Discret. Appl. Math., 1990

1989

Number of solutions of Satisfiability Instances - Applications to Knowledge Bases.

J. C. Simon, Olivier Dubois

Int. J. Pattern Recognit. Artif. Intell., 1989