default search action
Olivier Dubois 0002
Person information
- affiliation: CNRS, University Pierre et Marie Curie, France
Other persons with the same name
- Olivier Dubois 0001 — McGill University, Canada
- Olivier Dubois 0003 — University of Reims Champagne-Ardenne, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [i4]Yacine Boufkhad, Olivier Dubois:
Second moment method for a family of boolean CSP. CoRR abs/1107.2737 (2011)
2000 – 2009
- 2006
- [j12]Gilles Dequen
, Olivier Dubois:
An Efficient Approach to Solving Random k-satProblems. J. Autom. Reason. 37(4): 261-276 (2006) - 2005
- [j11]Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman:
Regular Random k-SAT: Properties of Balanced Formulas. J. Autom. Reason. 35(1-3): 181-200 (2005) - 2004
- [j10]Olivier Dubois, Guy Louchard, Jacques Mandler:
Additive Decompositions, Random Allocations, and Threshold Phenomena. Comb. Probab. Comput. 13(4-5): 537-575 (2004) - 2003
- [j9]Nadia Creignou, Hervé Daudé, Olivier Dubois:
Approximating The Satisfiability Threshold For Random K-Xor-Formulas. Comb. Probab. Comput. 12(2): 113-126 (2003) - [j8]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) - [c6]Gilles Dequen
kcnfs: An Efficient Solver for Random k-SAT Formulae. SAT 2003: 486-501 - [i3]Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c5]Olivier Dubois, Jacques Mandler:
The 3-XORSAT Threshold. FOCS 2002: 769-778 - [i2]Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. CoRR cs.DM/0211036 (2002) - 2001
- [j7]Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina
Editorial. Theor. Comput. Sci. 265(1-2): 1 (2001) - [j6]Olivier Dubois:
Upper bounds on the satisfiability threshold. Theor. Comput. Sci. 265(1-2): 187-197 (2001) - [c4]Olivier Dubois, Gilles Dequen
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. CP 2001: 108-120 - [c3]Olivier Dubois, Gilles Dequen:
A backbone-search heuristic for efficient solving of hard 3-SAT formulae. IJCAI 2001: 248-253 - [i1]Nadia Creignou, Hervé Daudé, Olivier Dubois:
Approximating the satisfiability threshold for random k-XOR-formulas. CoRR cs.DM/0106001 (2001) - 2000
- [c2]Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. SODA 2000: 126-127
1990 – 1999
- 1999
- [j5]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) - 1993
- [c1]Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier:
SAT versus UNSAT. Cliques, Coloring, and Satisfiability 1993: 415-436 - 1991
- [j4]Olivier Dubois:
Counting the Number of Solutions for Instances of Satisfiability. Theor. Comput. Sci. 81(1): 49-64 (1991) - [j3]Olivier Dubois, Jacques Carlier:
Probabilistic approach to the Satisfiability Problem. Theor. Comput. Sci. 81(1): 65-75 (1991) - 1990
- [j2]Olivier Dubois:
On the r, s-SAT satisfiability problem and a conjecture of Tovey. Discret. Appl. Math. 26(1): 51-60 (1990)
1980 – 1989
- 1989
- [j1]J. C. Simon, Olivier Dubois:
Number of solutions of Satisfiability Instances - Applications to Knowledge Bases. Int. J. Pattern Recognit. Artif. Intell. 3(1): 53-66 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: