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