Demo Data from VLDB 2026 / reviewers in the wild / expert
Alexandre Boudet
dblp:63/3758
· DBLP profile ↗
11ranked-venue papers
11as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 9 · 9 first-authorArtificial intelligence and machine learning · 5 · 5 first-authorSoftware engineering, systems software and programming languages · 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
2 papers |
Logic in computer science · 36% Algorithms and data structures · 26% Automated reasoning and model checking · 22% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% |
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
theorem proving |
0.0 | 2 | 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990 Unification in Free Extensions of Boolean Rings and Abelian Groups · LICS 1988 |
Logic in computer science
unification |
0.0 | 2 | 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990 Unification in Free Extensions of Boolean Rings and Abelian Groups · LICS 1988 |
Algorithms and data structures
diophantine equations |
0.0 | 1 | 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990 |
Mathematical optimization
discrete optimization |
0.0 | 1 | 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990 |
Algorithms and data structures › number-theoretic algorithms
linear diophantine equations |
0.0 | 1 | 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990 |
Logic in computer science
algebraic logic |
0.0 | 1 | 1988 | Unification in Free Extensions of Boolean Rings and Abelian Groups · LICS 1988 |
Logic in computer science › algebraic logic › equational logic
equational theory |
0.0 | 1 | 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990 |
Electronic design automation › hardware verification and test
hardware verification |
0.0 | 1 | 1988 | Unification in Free Extensions of Boolean Rings and Abelian Groups · LICS 1988 |
Combinatorics and discrete mathematics › group theory
abelian groups |
0.0 | 1 | 1988 | Unification in Free Extensions of Boolean Rings and Abelian Groups · LICS 1988 |
Methods — techniques the papers use, named apart from their topics
infinite trees · 0.0combination of equational theories · 0.0termination proof · 0.0combination technique · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Combining Pattern E-Unification Algorithms
Alexandre Boudet, Evelyne Contejean |
RTA | 1 |
| 1998 | About the Confluence of Equational Pattern Rewrite Systems
Alexandre Boudet, Evelyne Contejean |
CADE | 1 |
| 1997 | AC-Unification of Higher-Order Patterns
Alexandre Boudet, Evelyne Contejean |
CP | 1 |
| 1996 | AC-Complete Unification and its Application to Theorem Proving
Alexandre Boudet, Evelyne Contejean, Claude Marché |
RTA | 1 |
| 1993 | Competing for the AC-Unification Race
Alexandre Boudet |
J. Autom. Reason. | 1 |
| 1993 | Combining Unification Algorithms
Alexandre Boudet |
J. Symb. Comput. | 1 |
| 1992 | Unification in Order-Sorted Algebras with Overloading
Alexandre Boudet |
CADE | 1 |
| 1990 | Unification in a Combination of Equational Theories: an Efficient Algorithm
Alexandre Boudet |
CADE | 1 |
| 1990 | A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine EquationsabstractA novel AC-unification algorithm is presented. A combination technique for regular collapse-free theories is provided along the line developed by A. Boudet et al. (1989). The number of calls to the diophantine equations solver is bounded by the number of AC symbols times the number of shared variables. The rest of the algorithm being linear, this gives a much better idea of how the complexity of AC unification is related to the complexity of solving linear diophantine equations. The termination proof is surprisingly easy. Finally, systems of constraint linear diophantine equations can be solved, rather than one equation at a time, using an algorithm which extends Fortenbacher's algorithm to an arbitrary dimension. This allows a much more efficient use of the constraints than in the standard case.> Alexandre Boudet, Evelyne Contejean, Hervé Devie |
LICS | 1 |
| 1989 | Unification in Boolean Rings and Abelian Groups
Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß |
J. Symb. Comput. | 1 |
| 1988 | Unification in Free Extensions of Boolean Rings and Abelian GroupsabstractA complete unification algorithm is presented for the combination of two arbitrary equational theories E in T(F,X) and E/sup 1/ in T(F',X), where F and F' denote two disjoint sets of function symbols. The method adapts to unification of infinite trees. It is applied to two well-known open problems, when E is the theory of Boolean rings or the theory of Abelian groups, and E is the free theory. The interest to Boolean rings originates in VSLI verification.> Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß |
LICS | 1 |