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 EDBT 2026 / reviewers in the wild / expert

Evelyne Barbin-Le Rest

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

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

Theory of computation · 2 · 2 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
1 paper
Automata and formal languages · 77% Computational complexity · 23%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal language classes
finite word languages		 0.011983
On the Group Complexity of a Finite Language · ICALP 1983
Computational complexity › complexity classes
formal language complexity		 0.011983
On the Group Complexity of a Finite Language · ICALP 1983

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

group theory · 0.0
YearPublicationVenuePosition
1985 Sur la Combinatoire des Codes à Deux Mots
Evelyne Barbin-Le Rest, Michel Le Rest
 Theor. Comput. Sci.1
1983 On the Group Complexity of a Finite Language
Evelyne Barbin-Le Rest, Stuart W. Margolis
 ICALP1