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

Brian F. Redmond

dblp:72/3004 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-8298-794XORCID · corroborated

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

Theory of computation · 2 · 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
Logic in computer science · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Logic in computer science › formal systems
combinatory logic
0.212016
Bounded Combinatory Logic and lower complexity · Inf. Comput. 2016
YearPublicationVenuePosition
2016 Bounded Combinatory Logic and lower complexity
Brian F. Redmond
Inf. Comput.1
2014 Safe recursion revisited I: Categorical semantics for lower complexity
Mike Burrell, J. Robin B. Cockett, Brian F. Redmond
Theor. Comput. Sci.3