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

Huei Ling

dblp:41/3137 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1966
—ORCID · none

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

Systems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Theoretical computer science
1 paper
Automata and formal languages · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital arithmetic circuits		 0.011966
High Speed Binary Parallel Adder · IEEE Trans. Electron. Comput. 1966
Integrated circuit design › digital arithmetic circuits
parallel adder		 0.011966
High Speed Binary Parallel Adder · IEEE Trans. Electron. Comput. 1966
Computational complexity › decidability
busy beaver problem		 0.011966
High Speed Binary Parallel Adder · IEEE Trans. Electron. Comput. 1966
Automata and formal languages
turing machines		 0.011966
High Speed Binary Parallel Adder · IEEE Trans. Electron. Comput. 1966
YearPublicationVenuePosition
1966 High Speed Binary Parallel Adder
abstract
A study of the output of a heuristic computer program reveals two four-state binary Turing machines which yield the highest known score for four states in Rado's co-called "Busy Beaver" logical game. There is evidence which supports the conjecture that this score of 13 is the particular value of Σ(4), where Σis a noncomputable integer function associated with this game. It is also conjectured that S(4) = 106, where S is another noncomputable function, the maximum shift number, of interest in Rado's study. Complete solution of the problem for four states has been reduced to a relatively small set of machines.
Huei Ling
 IEEE Trans. Electron. Comput.1