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

Veikko Keränen

dblp:29/3208 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2009
—ORCID · none

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

Theory of computation · 5 · 5 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
Combinatorics and discrete mathematics · 78% Automata and formal languages · 22%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
combinatorics on words		 0.021992
Abelian Squares are Avoidable on 4 Letters · ICALP 1992
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet · ICALP 1985
Automata and formal languages › formal language operations
morphisms		 0.011985
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet · ICALP 1985
YearPublicationVenuePosition
2009 A powerful abelian square-free substitution over 4 letters
Veikko Keränen
 Theor. Comput. Sci.1
1992 Abelian Squares are Avoidable on 4 Letters
Veikko Keränen
 ICALP1
1987 On the k-Freeness of Morphisms on Free Monoids
Veikko Keränen
 STACS1
1985 On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet
Veikko Keränen
 ICALP1
1984 On k-repetition freeness of length uniform morphisms over a binary alphabet
Veikko Keränen
 Discret. Appl. Math.1