Sang Cho

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

EDBT 2026 Demo / reviewers in the wild / expert

dblp:75/1842 · DBLP profile ↗

← Back

4ranked-venue papers

4as first author

0since 2021 · last 1992

—ORCID · none

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

Theory of computation · 4 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 2 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% Automata and formal languages · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Automata and formal languages finite automata	0.0	1	1992	The Parallel Complexity of Finite-State Automata Problems · Inf. Comput. 1992
Computational complexity parallel complexity	0.0	1	1992	The Parallel Complexity of Finite-State Automata Problems · Inf. Comput. 1992

Year	Publication	Venue	Position
1992	The Parallel Complexity of Finite-State Automata Problems Sang Cho, Dung T. Huynh	Inf. Comput.	1
1992	The Parallel Complexity of Coarsest Set Partition Problems Sang Cho, Dung T. Huynh	Inf. Process. Lett.	1
1991	Finite-Automaton Aperiodicity is PSPACE-Complete Sang Cho, Dung T. Huynh	Theor. Comput. Sci.	1
1988	On a Complexity Hierarchy Between L and NL Sang Cho, Dung T. Huynh	Inf. Process. Lett.	1