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

F. R. Frola

dblp:180/6489 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1965
—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%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.011965
A Note on the Problem of Classifying Vertices of the n Cube into m Categories · IEEE Trans. Electron. Comput. 1965
Electronic design automation › logic synthesis › threshold logic synthesis
majority-logic synthesis
0.011965
A Note on the Problem of Classifying Vertices of the n Cube into m Categories · IEEE Trans. Electron. Comput. 1965
Logic in computer science › algebraic logic
functional completeness
0.011965
A Note on the Problem of Classifying Vertices of the n Cube into m Categories · IEEE Trans. Electron. Comput. 1965

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

majority decomposition · 0.0
YearPublicationVenuePosition
1965 A Note on the Problem of Classifying Vertices of the n Cube into m Categories
abstract
Some methods of synthesis of networks composed of ternary majority elements such as the three-stable-state parametron or twin are studied. It is shown that three-place majority operation and diametrical negation (negation in the strong sense) with constants are functionally complete in three-valued logic. Classes of functions of two variables are studied for which networks realizing them contain no more than three cascades. This provides a possibility of realizing these functions in one full time unit in the case of three-cycle excitation. Methods of synthesis are developed for the networks which realize functions of an arbitrary number of variables. These methods are based on the excluding of one or several variables simultaneously. Considerations are proposed on the order of the excluding variables. Methods of majority decomposition of functions of three-valued logic are developed.
F. R. Frola
IEEE Trans. Electron. Comput.1