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

R. W. Gibbard

dblp:85/3627 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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

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%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital circuit design		 0.011975
Synthesis and Comparison of Two's Complement Parallel Multipliers · IEEE Trans. Computers 1975
Integrated circuit design › digital circuit design › arithmetic circuit design
parallel multiplier		 0.011975
Synthesis and Comparison of Two's Complement Parallel Multipliers · IEEE Trans. Computers 1975
YearPublicationVenuePosition
1975 Synthesis and Comparison of Two's Complement Parallel Multipliers
abstract
A machine word mathematical formulation is applied to analysis and synthesis of circuits for signed binary number multiplication. The circuits are related to each other and to contemporary circuit algorithms in the course of the syntheses and in a comparative discussion. Circuits with complemented multiplier/multiplicand (M̄) or complemented partial product word (P̄) corrections offer advantages in circuit symmetry and algorithmic structure.
John A. Gibson, R. W. Gibbard
 IEEE Trans. Computers2