Olivier Dubois 0002

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:09/4733-2 · DBLP profile ↗

← Back

15ranked-venue papers

9as first author

0since 2021 · last 2006

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 7 first-authorArtificial intelligence and machine learning · 6 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 3 papers		Automated reasoning and model checking · 65% Computational complexity · 35%
Artificial intelligence 1 paper		Planning, search and constraint satisfaction · 50% Efficient and distributed learning · 50%

Topics — the 9 heaviest of 9, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Automated reasoning and model checking satisfiability	0.1	3	2002	The 3-XORSAT Threshold · FOCS 2002 A backbone-search heuristic for efficient solving of hard 3-SAT formulae · IJCAI 2001 Typical random 3-SAT formulae and the satisfiability threshold · SODA 2000
Computational complexity phase transition	0.0	2	2002	Typical random 3-SAT formulae and the satisfiability threshold · SODA 2000 The 3-XORSAT Threshold · FOCS 2002
Computational complexity › constraint satisfaction random constraint satisfaction	0.0	1	2002	The 3-XORSAT Threshold · FOCS 2002
Automated reasoning and model checking › satisfiability XORSAT	0.0	1	2002	The 3-XORSAT Threshold · FOCS 2002
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search backbone architecture search	0.0	1	2001	A backbone-search heuristic for efficient solving of hard 3-SAT formulae · IJCAI 2001
Knowledge, reasoning and agents › Planning, search and constraint satisfaction heuristic search	0.0	1	2001	A backbone-search heuristic for efficient solving of hard 3-SAT formulae · IJCAI 2001
Automated reasoning and model checking › satisfiability › k-SAT 3-SAT	0.0	1	2001	A backbone-search heuristic for efficient solving of hard 3-SAT formulae · IJCAI 2001
Automated reasoning and model checking › satisfiability › random k-SAT random 3-SAT	0.0	1	2000	Typical random 3-SAT formulae and the satisfiability threshold · SODA 2000
Computational complexity › phase transition satisfiability threshold	0.0	1	2000	Typical random 3-SAT formulae and the satisfiability threshold · SODA 2000

Methods — techniques the papers use, named apart from their topics

local search · 0.1transcendental equation · 0.0

Year	Publication	Venue	Position
2006	An Efficient Approach to Solving Random k-satProblems Gilles Dequen, Olivier Dubois 0002	J. Autom. Reason.	2
2005	Regular Random k-SAT: Properties of Balanced Formulas Yacine Boufkhad, Olivier Dubois 0002, Yannet Interian, Bart Selman	J. Autom. Reason.	2
2003	kcnfs: An Efficient Solver for Random k-SAT Formulae Gilles Dequen, Olivier Dubois 0002	SAT	2
2003	Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections Yacine Boufkhad, Olivier Dubois 0002, Maurice Nivat	Theor. Comput. Sci.	2
2002	The 3-XORSAT Threshold abstract We prove the existence of the 3-XORSAT threshold, establishing its value as a function of the root of a transcendental equation. Olivier Dubois 0002, Jacques Mandler	FOCS	1
2001	The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10 Olivier Dubois 0002, Gilles Dequen	CP	1
2001	A backbone-search heuristic for efficient solving of hard 3-SAT formulae Olivier Dubois 0002, Gilles Dequen	IJCAI	1
2001	Upper bounds on the satisfiability threshold Olivier Dubois 0002	Theor. Comput. Sci.	1
2001	Editorial Olivier Dubois 0002, Rémi Monasson, Bart Selman, Riccardo Zecchina	Theor. Comput. Sci.	1
2000	Typical random 3-SAT formulae and the satisfiability threshold Olivier Dubois 0002, Yacine Boufkhad, Jacques Mandler	SODA	1
1999	Length of Prime Implicants and Number of Solutions of Random CNF Formulae Yacine Boufkhad, Olivier Dubois 0002	Theor. Comput. Sci.	2
1991	Counting the Number of Solutions for Instances of Satisfiability Olivier Dubois 0002	Theor. Comput. Sci.	1
1991	Probabilistic approach to the Satisfiability Problem Olivier Dubois 0002, Jacques Carlier	Theor. Comput. Sci.	1
1990	On the r, s-SAT satisfiability problem and a conjecture of Tovey Olivier Dubois 0002	Discret. Appl. Math.	1
1989	Number of solutions of Satisfiability Instances - Applications to Knowledge Bases abstract In propositional logic (zero order) a system of logical rules may be put under the form of a conjunction of disjunction, i.e. a “satisfiability” or SAT-problem. SAT is central to NP-complete problems. Any result obtained on SAT would have consequences for a lot of problems important in artificial intelligence. We deal with the question of the number N of solutions of SAT. Firstly, any system of SAT clauses may be transformed in a system of independent clauses by an exponential process; N may be computed exactly. Secondly, by a statistical approach, results are obtained showing that for a given SAT-instance, it should be possible to find an estimate of N with a margin of confidence in polynomial time. Thirdly, we demonstrate the usefulness of these ideas on large knowledge bases. J. C. Simon, Olivier Dubois 0002	Int. J. Pattern Recognit. Artif. Intell.	2