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.

Robert A. Ankerlin

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

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

Systems, architecture and hardware · 1

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
1 paper
Logic in computer science · 87% Algorithms and data structures · 13%

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

TopicWeightPapersLastEvidence papers
Logic in computer science › algebraic logic › boolean algebra
boolean function classification
0.011967
A Rapid Method for the Identification of the Type of a Four-Variable Boolean Functin · IEEE Trans. Electron. Comput. 1967

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

hyperoctahedral group · 0.0golomb-ninomiya invariants · 0.0
YearPublicationVenuePosition
1967 A Rapid Method for the Identification of the Type of a Four-Variable Boolean Functin
abstract
The hyperoctahedral group on the set of N-variable Boolean functions is defined. The problem of determining, given an arbitrary function, its equivalence class membership (type) is posed and, for the special case of four-variable functions, solved by a method that in use proved to be four times as rapid as computation of the conventional Golomb-Ninomiya[1],[2]invariants.
Charles L. Jackson, Robert A. Ankerlin
IEEE Trans. Electron. Comput.2