Jacques Mandler

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:21/1204 · DBLP profile ↗

← Back

3ranked-venue papers

0as first author

0since 2021 · last 2002

—ORCID · none

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

Theory of computation · 3

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 · 41% Computational complexity · 33% Mathematical optimization · 18%

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	2	2002	The 3-XORSAT Threshold · FOCS 2002 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
Approximation and online algorithms approximation algorithms	0.0	1	2000	Towards a 4/3 approximation for the asymmetric traveling salesman problem · SODA 2000
Mathematical optimization › combinatorial optimization › vehicle routing › traveling salesman problem asymmetric TSP	0.0	1	2000	Towards a 4/3 approximation for the asymmetric traveling salesman problem · SODA 2000
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
Mathematical optimization › combinatorial optimization › vehicle routing traveling salesman problem	0.0	1	2000	Towards a 4/3 approximation for the asymmetric traveling salesman problem · SODA 2000

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

transcendental equation · 0.0

Year	Publication	Venue	Position
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	2
2000	Towards a 4/3 approximation for the asymmetric traveling salesman problem Robert D. Carr, Santosh S. Vempala, Jacques Mandler	SODA	3
2000	Typical random 3-SAT formulae and the satisfiability threshold Olivier Dubois 0002, Yacine Boufkhad, Jacques Mandler	SODA	3