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

Don-Min Tsou

dblp:49/1868 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · none

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

Theory of computation · 2

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.

Databases, data mining, and information retrieval
1 paper
Database theory · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Database theory
dependency theory		 0.011983
Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard · SIAM J. Comput. 1983
Database theory › dependency theory
multivalued dependencies		 0.011983
Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard · SIAM J. Comput. 1983

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

NP-hardness proof · 0.0
YearPublicationVenuePosition
1983 Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard
abstract
The problem of determining, given a set of multivalued dependencies, whether or not they logically imply a given join dependency is shown to be computationally intractable.
Patrick C. Fischer, Don-Min Tsou
 SIAM J. Comput.2
1983 Succinctness in Dependency Systems
Patrick C. Fischer, Jiann H. Jou, Don-Min Tsou
 Theor. Comput. Sci.3