Публикации 1998-2007

• 2007
  • N. Creignou, H. Daudé, O. Dubois : “Expected number of locally maximal solutions for random Boolean CSPs”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), DMTCS Proceedings, Juan les Pins, France, pp. 109-122, (Discrete Mathematics and Theoretical Computer Science) (2007)
• 2006
  • G. Dequen, O. Dubois : “An efficient approach to solving random k-SAT problems”, Journal of Automated Reasoning, vol. 37 (4), pp. 261-276, (Springer Verlag) (2006)
• 2005
  • O. Dubois, G. Dequen : “KCNFS solver”, SAT 2005 - 8^th International Conference on Theory and Applications of Satisfiability Testing, St. Andrews, Scotland, United Kingdom, pp. 486-501 (2005)
  • Y. Boufkhad, O. Dubois, Y. Interian, B. Selman : “Regular Random k-SAT: Properties of Balanced Formulas”, Journal of Automated Reasoning, vol. 35 (1-3), pp. 181-200, (Springer Verlag) (2005)
• 2004
  • O. Dubois, G. Louchard, J. Mandler : “Additive decompositions, random allocations and threshold phenomena”, Combinatorics, Probability and Computing, vol. 13 (4-5), pp. 537-575, (Cambridge University Press (CUP)) (2004)
• 2003
  • O. Dubois : “Problèmes de Satisfaisabilité : phénomènes de seuil, résolution algorithme, applications”, хабилитация, Защита диссертаций 10.09.2003 (2003)
  • N. Creignou, H. Daudé, O. Dubois : “Approximating the satisfaibility threshold for random k-XOR formulas”, Combinatorics, Probability and Computing, vol. 12 (2), pp. 113-126, (Cambridge University Press (CUP)) (2003)
  • Y. Boufkhad, O. Dubois, M. Nivat : “Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections”, Theoretical Computer Science, vol. 290 (3), pp. 1647-1664, (Elsevier) (2003)
  • S. Cocco, O. Dubois, J. Mandler, R. Monasson : “Rigorous decimation-based construction of ground pure states for spin-glass models on random lattices”, Physical Review Letters, vol. 90 (4), pp. 047205, (American Physical Society) (2003)
  • G. Dequen, O. Dubois : “kcnfs: An Efficient Solver for Random k-SAT Formulae”, SAT 2003 - 6^th International Conference on Theory and Applications of Satisfiability Testing, vol. 2919, Lecture Notes in Computer Science, Santa Margherita Ligure, Italy, pp. 486-501, (Springer) (2003)
• 2002
  • O. Dubois, J. Mandler : “The 3-XORSAT Threshold”, Comptes Rendus. Mathématique, vol. 335 (11), pp. 963-966, (Académie des sciences (Paris)) (2002)
  • O. Dubois, J. Mandler : “The 3-XORSAT threshold”, FOCS 2002 - 43^th Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, pp. 769-778, (IEEE) (2002)
  • O. Dubois, G. Dequen : “Renormalisation as a function of clause lengths for solving random k-SAT”, SAT 2002 - Fifth International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, Ohio, United States, pp. 120-132 (2002)
• 2001
  • O. Dubois, G. Dequen : “The non-existence of (3,1,2)-conjugate orthogonal idemôtent latin square of order 10”, CP 2001 - 7^th International Conference on Principles and Practice of Constraint Programming, vol. 2239, Lecture Notes in Computer Science, Paphos, Cyprus, pp. 108-120, (Springer) (2001)
  • O. Dubois, G. Dequen : “A backbone search Heuristic for efficient solving of hard 3-SAT formulae”, IJCAI'01 - 17^th International Joint Conference on Artificial Intelligence, Seattle, United States, pp. 248-253, (Morgan Kaufmann Publishers) (2001)
  • O. Dubois, R. Monasson, B. Selman, R. Zecchina : “Editorial - Phase Transition in Combinatorial Problems”, Theoretical Computer Science, vol. 265 (1-2), pp. 1, (Elsevier) (2001)
  • O. Dubois : “Upper bounds on the satisfiability threshold”, Theoretical Computer Science, vol. 265 (1-2), pp. 187-197, (Elsevier) (2001)
• 2000
  • O. Dubois, Y. Boufkhad, J. Mandler : “Typical random 3-SAT formulae and the satisfiability threshold”, 11^th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, United States, pp. 124-126 (2000)
• 1999
  • O. Dubois, Y. Boufkhad, J. Mandler : “A new approach to better estimate the satisfiability threshold”, Conference on NP-Hardness and Phase Transitions, Trieste, Italy (1999)
  • Y. Boufkhad, O. Dubois, M. Nivat : “Reconstructing binary images”, International Worshop on Discrete Tomography and Related Problems, Thionville, France (1999)
  • Y. Boufkhad, O. Dubois : “Length of Prime Implicants and number of solutions de random CNF formulae”, Theoretical Computer Science, vol. 215 (1-2), pp. 1-30, (Elsevier) (1999)
• 1998
  • O. Dubois : “Strategy to estimate from the above the satisfiability threshold”, Worshop on the Interfaces between Statistical Physics and Computer Science, Turin, Italy (1998)