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

Timo Lepistö

dblp:10/4193 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1981
—ORCID · none

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

Theory of computation · 3 · 3 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
Coding theory · 86% Automata and formal languages · 14%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
lee codes		 0.011981
A Modification of the Elias-Bound and Nontexistence Theorems for Perfect Codes in the Lee-Metric · Inf. Control. 1981
Coding theory › error-correcting codes
perfect codes		 0.011981
A Modification of the Elias-Bound and Nontexistence Theorems for Perfect Codes in the Lee-Metric · Inf. Control. 1981
Automata and formal languages › formal grammars
context-free grammar		 0.011973
On Ordered Context-Free Grammars · Inf. Control. 1973
YearPublicationVenuePosition
1981 A note on perfect Lee-codes over small alphabets
Timo Lepistö
 Discret. Appl. Math.1
1981 A Modification of the Elias-Bound and Nontexistence Theorems for Perfect Codes in the Lee-Metric
Timo Lepistö
 Inf. Control.1
1973 On Ordered Context-Free Grammars
Timo Lepistö
 Inf. Control.1