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

Stuart W. Margolis

dblp:m/SWMargolis · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

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

Theory of computation · 7 · 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
3 papers
Combinatorics and discrete mathematics · 57% Computational complexity · 30% Automata and formal languages · 13%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › group theory
free groups		 0.011994
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups · ICALP 1994
Combinatorics and discrete mathematics
group theory		 0.011994
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups · ICALP 1994
Computational complexity › complexity classes › PSPACE
PSPACE-completeness		 0.011994
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups · ICALP 1994
Automata and formal languages
semigroup theory		 0.011984
Languages and Inverse Semigroups · ICALP 1984
Automata and formal languages › formal language classes
finite word languages		 0.011983
On the Group Complexity of a Finite Language · ICALP 1983
Computational complexity › complexity classes
formal language complexity		 0.011983
On the Group Complexity of a Finite Language · ICALP 1983

Methods — techniques the papers use, named apart from their topics

subgroup algorithms · 0.0group theory · 0.0
YearPublicationVenuePosition
2000 PSPACE-complete problems for subgroups of free groups and inverse finite automata
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
 Theor. Comput. Sci.2
1994 PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
 ICALP2
1994 The Word Problem for Inverse Monoids Presented by One Idempotent Relator
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin
 Theor. Comput. Sci.2
1985 Products of group languages
Stuart W. Margolis, Jean-Éric Pin
 FCT1
1984 Languages and Inverse Semigroups
Stuart W. Margolis, Jean-Éric Pin
 ICALP1
1983 On the Group Complexity of a Finite Language
Evelyne Barbin-Le Rest, Stuart W. Margolis
 ICALP2
1982 On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code
Stuart W. Margolis
 Theor. Comput. Sci.1