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

Bjón Dahlberg

dblp:177/1252 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1973
—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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
boolean function decomposition		 0.011973
On Symmetric Functions with Redundant Variables-Weighted Functions · IEEE Trans. Computers 1973
Electronic design automation
logic synthesis		 0.011973
On Symmetric Functions with Redundant Variables-Weighted Functions · IEEE Trans. Computers 1973
Electronic design automation › logic synthesis › boolean function realization
symmetric function synthesis		 0.011973
On Symmetric Functions with Redundant Variables-Weighted Functions · IEEE Trans. Computers 1973

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

lookup table · 0.0
YearPublicationVenuePosition
1973 On Symmetric Functions with Redundant Variables-Weighted Functions
abstract
Any switching function may be transformed into a completely symmetric switching function with some of its variables repetitive. In this paper we shall discuss certain properties, easily detectable in decomposition charts, that may be applied to reduce the number of repeated variables when such a transformation is performed. An algorithm utilizing lookup tables based on these properties has been devised enabling us with relative ease to transform an arbitrary switching function of four variables into a completely symmetric switching function with the least number of variables. The algorithm may be generalized to n-variable switching functions provided that the corresponding lookup tables are made available.
Bjón Dahlberg
 IEEE Trans. Computers1