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

Jeanne Devolder

dblp:19/85 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1993
—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
Coding theory · 50% Automata and formal languages · 50%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › infinite words
bi-infinite words
0.011993
Precircular Codes and Periodic Biinfinite Words · Inf. Comput. 1993
YearPublicationVenuePosition
1993 Precircular Codes and Periodic Biinfinite Words
Jeanne Devolder
Inf. Comput.1
1991 Finitely Generated bi-omega-Languages
Jeanne Devolder, Igor Litovsky
Theor. Comput. Sci.1