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

Tara Brough

dblp:90/9508 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0002-3576-0670ORCID · corroborated

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
1 paper
Computational complexity · 50% Combinatorics and discrete mathematics · 50%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
binary relation
0.412020
A language hierarchy of binary relations · Inf. Comput. 2020
Computational complexity › complexity classes
language hierarchy
0.412020
A language hierarchy of binary relations · Inf. Comput. 2020
YearPublicationVenuePosition
2020 A language hierarchy of binary relations
Tara Brough, Alan J. Cain
Inf. Comput.1
2019 Context-Free Word Problem Semigroups
Tara Brough, Alan J. Cain, Markus Pfeiffer
DLT1
2017 Automaton semigroups: New constructions results and examples of non-automaton semigroups
Tara Brough, Alan J. Cain
Theor. Comput. Sci.1