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

Mário J. J. Branco

dblp:28/1979 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2018
0000-0002-2209-1316ORCID · 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
Automata and formal languages · 67% Logic in computer science · 33%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
algebraic logic
0.112009
Equations Defining the Polynomial Closure of a Lattice of Regular Languages · ICALP (2) 2009
Automata and formal languages › regular languages
polynomial closure
0.112009
Equations Defining the Polynomial Closure of a Lattice of Regular Languages · ICALP (2) 2009
Automata and formal languages
regular languages
0.112009
Equations Defining the Polynomial Closure of a Lattice of Regular Languages · ICALP (2) 2009
YearPublicationVenuePosition
2018 Inequalities for One-Step Products
Mário J. J. Branco, Jean-Éric Pin
DLT1
2009 Equations Defining the Polynomial Closure of a Lattice of Regular Languages
Mário J. J. Branco, Jean-Éric Pin
ICALP (2)1
2006 Two algebraic approaches to variants of the concatenation product
Mário J. J. Branco
Theor. Comput. Sci.1