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

F. Handoko

dblp:54/3134 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1975
—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
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis		 0.011975
A Discussion on Two Algorithms for Determining Maximum Compatibles · IEEE Trans. Computers 1975
Electronic design automation › logic synthesis › finite state machine synthesis
incompletely specified sequential machine		 0.011975
A Discussion on Two Algorithms for Determining Maximum Compatibles · IEEE Trans. Computers 1975

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

maximum compatible determination algorithms · 0.0
YearPublicationVenuePosition
1975 A Discussion on Two Algorithms for Determining Maximum Compatibles
abstract
The algorithm for determining the set of maximum compatibles of Sinha Roy and Sheng is compared with the more recent algorithm of Stoffers. A refinement of the former algorithm is given and a minor mistake in the latter is pointed out.
F. Handoko
 IEEE Trans. Computers1