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

Andy N. C. Kang

dblp:47/5930 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1977
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 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 · 48% Graph algorithms and graph theory · 38% Algorithms and data structures · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel graph algorithms
minimum spanning tree		 0.011977
Storage Reduction Through Minimal Spanning Trees and Spanning Forests · IEEE Trans. Computers 1977
Computational complexity › computability theory
machine-independent complexity		 0.011975
On the Efficiency of Universal Machines · IEEE Trans. Computers 1975
Graph algorithms and graph theory
graph algorithms		 0.011977
Storage Reduction Through Minimal Spanning Trees and Spanning Forests · IEEE Trans. Computers 1977
Graph algorithms and graph theory
spanning tree		 0.011977
Storage Reduction Through Minimal Spanning Trees and Spanning Forests · IEEE Trans. Computers 1977

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

spanning forest · 0.0minimal spanning tree · 0.0recursion theorem · 0.0
YearPublicationVenuePosition
1977 Storage Reduction Through Minimal Spanning Trees and Spanning Forests
abstract
It is often possible to save storage space in a computer by storing only the differences among data items rather than the entire items. For example, suppose we have two records A and B. We should store all of A, then for B store a pointer to A and the differences between A and B. If A and B are similar, there will be few differences and storage space can be saved.
Andy N. C. Kang, Richard C. T. Lee, Chin-Liang Chang, Shi-Kuo Chang
 IEEE Trans. Computers1
1975 Some Properties of a Centroid of a Free Tree
Andy N. C. Kang, David A. Ault
 Inf. Process. Lett.1
1975 On the Efficiency of Universal Machines
abstract
The complexity of the universal programs is compared with the complexity of the programs being simulated. The results suggest that the efficiency of the universal machines depends heavily on the programs being simulated. All the results are machine-independent and they are derived based on the recursion theorem.
Andy N. C. Kang
 IEEE Trans. Computers1
1972 Effective Operators with No Strong Gaps
Andy N. C. Kang
 J. Comput. Syst. Sci.1