Marjo Lipponen

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

dblp:l/MarjoLipponen · DBLP profile ↗

← Back

5ranked-venue papers

3as first author

0since 2021 · last 1999

—ORCID · none

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

Theory of computation · 5 · 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

1 paper

Computational complexity · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Computational complexity › decidability post correspondence problem	0.0	1	1995	Post Correspondence Problem: Words Possible as Primitive Solutions · ICALP 1995

Year	Publication	Venue	Position
1999	Distinguishability, Simulation and Universality of Moore Tree Automata abstract We extend the notions of distinguishability of states, simulation and universality of string automata to tree automata of Moore type. In particular, we prove that for each finite class of tree automata satisfying certain conditions, there is a unique Eija Jurvanen, Marjo Lipponen	Fundam. Informaticae	2
1996	Flatwords and Post Correspondence Problem Tero Harju, Marjo Lipponen, Alexandru Mateescu	Theor. Comput. Sci.	2
1995	On F-Prime Solutions of the Post Correspondence Problem Marjo Lipponen	Developments in Language Theory	1
1995	Post Correspondence Problem: Words Possible as Primitive Solutions Marjo Lipponen	ICALP	1
1995	Strongly Prime PCP Words Marjo Lipponen, Gheorghe Paun	Discret. Appl. Math.	1