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

Hervé Devie

dblp:06/5252 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 2

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
Algorithms and data structures · 62% Logic in computer science · 15% Automated reasoning and model checking · 11%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › number-theoretic algorithms
linear diophantine equations		 0.021994
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations · Inf. Comput. 1994
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990
Algorithms and data structures › dynamic algorithms
incremental algorithms		 0.011994
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations · Inf. Comput. 1994
Algorithms and data structures
diophantine equations		 0.011990
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990
Mathematical optimization
discrete optimization		 0.011990
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990
Automated reasoning and model checking
theorem proving		 0.011990
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990
Logic in computer science
unification		 0.011990
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990
Logic in computer science › algebraic logic › equational logic
equational theory		 0.011990
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations · LICS 1990

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

termination proof · 0.0combination technique · 0.0
YearPublicationVenuePosition
1994 An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations
Evelyne Contejean, Hervé Devie
 Inf. Comput.2
1990 A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations
abstract
A 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
 LICS3