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

Thiet-Dung Huynh

dblp:44/3528 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1982
—ORCID · none

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
2 papers
Computational complexity · 83% Automata and formal languages · 17%

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

TopicWeightPapersLastEvidence papers
Computational complexity › complexity classes
polynomial hierarchy		 0.011982
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete · FOCS 1982
Computational complexity › complexity classes › polynomial hierarchy
sigma-2-p completeness		 0.011982
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete · FOCS 1982
Computational complexity › complexity classes
formal language complexity		 0.011980
The Complexity of Semilinear Sets · ICALP 1980
Automata and formal languages
semilinear sets		 0.011980
The Complexity of Semilinear Sets · ICALP 1980

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

log-space reduction · 0.0
YearPublicationVenuePosition
1982 Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete
abstract
This paper deals with the complexity of context-free grammars with 1-1etter terminal alphabet. We study the complexity of the membership problem and the inequivalence problem. We show that the first problem is NP-complete and the second one is Σ2p- complete with respect to log-space reduction. The second result also implies that the inequivalence problem is in PSPACE, solving an open problem stated in [3] by Hunt III, Rosenkrantz and Szymanski.
Thiet-Dung Huynh
 FOCS1
1982 Remarks on the Complexity of an Invariant of Context-Free Grammars
Thiet-Dung Huynh
 Acta Informatica1
1980 The Complexity of Semilinear Sets
Thiet-Dung Huynh
 ICALP1