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 SIGIR 2026 / reviewers in the wild / expert

Stefan Römer

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

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

Theory of computation · 3Software engineering, systems software and programming languages · 1

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
Automated reasoning and model checking · 67% Automata and formal languages · 33%

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
net unfoldings		 0.011997
Deadlock Checking Using Net Unfoldings · CAV 1997
Automata and formal languages
petri nets		 0.011997
Deadlock Checking Using Net Unfoldings · CAV 1997
YearPublicationVenuePosition
2002 An Improvement of McMillan's Unfolding Algorithm
Javier Esparza, Stefan Römer, Walter Vogler
 Formal Methods Syst. Des.2
1999 An Unfolding Algorithm for Synchronous Products of Transition Systems
Javier Esparza, Stefan Römer
 CONCUR2
1997 Deadlock Checking Using Net Unfoldings
Stephan Melzer, Stefan Römer
 CAV2