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

Sophocles Ephremidis

dblp:50/1061 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1988
—ORCID · none

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

Theory of computation · 1 · 1 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 · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal grammars
attribute grammars		 0.011988
Complexity Characterizations of Attribute Grammar Languages · Inf. Comput. 1988
Computational complexity › structural complexity
complexity class characterization		 0.011988
Complexity Characterizations of Attribute Grammar Languages · Inf. Comput. 1988
YearPublicationVenuePosition
1988 Complexity Characterizations of Attribute Grammar Languages
Sophocles Ephremidis, Christos H. Papadimitriou, Martha Sideri
 Inf. Comput.1