Arthur W. Chou

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

dblp:52/5343 · DBLP profile ↗

← Back

6ranked-venue papers

4as first author

0since 2021 · last 2006

—ORCID · none

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

Theory of computation · 6 · 4 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 geometry · 56% Computational complexity · 44%

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

Topic	Papers	Last	Evidence papers
Computational geometry geometric complexity	2	1995	Computational Complexity of Two-Dimensional Regions · SIAM J. Comput. 1995 Some complexity issues on the simply connected regions of the two-dimensional plane · STOC 1993
Computational complexity › complexity classes polynomial-time computability	1	1995	Computational Complexity of Two-Dimensional Regions · SIAM J. Comput. 1995
Computational geometry › computational topology winding number	1	1995	Computational Complexity of Two-Dimensional Regions · SIAM J. Comput. 1995

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

discrete computational model · 0.0

Year	Publication	Venue	Position
2006	On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain Fuxiang Yu, Arthur W. Chou, Ker-I Ko	J. Complex.	2
2005	On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain Fuxiang Yu, Arthur W. Chou, Ker-I Ko	CCA	2
2005	The computational complexity of distance functions of two-dimensional domains Arthur W. Chou, Ker-I Ko	Theor. Comput. Sci.	1
1995	Computational Complexity of Two-Dimensional Regions abstract The computational complexity of bounded sets of the two-dimensional plane is studied in the discrete computational model. We introduce four notions of polynomial-time computable sets in ${\bf R}^{2}$ and study their relationship. The computational complexity of the winding number problem, membership problem, distance problem, and area problem is characterized by the relations between discrete complexity classes of the NP theory. Arthur W. Chou, Ker-I Ko	SIAM J. Comput.	1
1993	Some complexity issues on the simply connected regions of the two-dimensional plane abstract Article Some complexity issues on the simply connected regions of the two-dimensional plane Share on Authors: Arthur W. Chou View Profile , Ker-I Ko View Profile Authors Info & Claims STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of ComputingJune 1993 Pages 1–10https://doi.org/10.1145/167088.167093Online:01 June 1993Publication History 2citation145DownloadsMetricsTotal Citations2Total Downloads145Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Arthur W. Chou, Ker-I Ko	STOC	1
1987	On the optimality of Krylov information Arthur W. Chou	J. Complex.	1