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

Nicole Ondrusch

dblp:00/498 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2007
0009-0007-8824-6919ORCID · verified

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

Theory of computation · 2

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 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
decidability and complexity		 0.112007
Inverse monoids: Decidability and complexity of algebraic questions · Inf. Comput. 2007
YearPublicationVenuePosition
2007 Inverse monoids: Decidability and complexity of algebraic questions
Markus Lohrey, Nicole Ondrusch
 Inf. Comput.2
2005 Inverse Monoids: Decidability and Complexity of Algebraic Questions
Markus Lohrey, Nicole Ondrusch
 MFCS2