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

Richard Lindaman

dblp:182/0070 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1961
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
2 papers
Integrated circuit design · 68% Electronic design automation · 32%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › digital circuit design
logic design		 0.021961
Axiomatic Majority-Decision Logic · IRE Trans. Electron. Comput. 1961
A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra · IRE Trans. Electron. Comput. 1960
Integrated circuit design › digital circuit design › threshold logic
majority logic circuits		 0.021961
Axiomatic Majority-Decision Logic · IRE Trans. Electron. Comput. 1961
A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra · IRE Trans. Electron. Comput. 1960
Electronic design automation
logic synthesis		 0.011960
A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra · IRE Trans. Electron. Comput. 1960
Electronic design automation › logic synthesis › threshold logic synthesis
majority-logic synthesis		 0.011960
A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra · IRE Trans. Electron. Comput. 1960
Logic in computer science
algebraic logic		 0.011961
Axiomatic Majority-Decision Logic · IRE Trans. Electron. Comput. 1961

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

axiomatic development · 0.0augmented boolean algebra · 0.0
YearPublicationVenuePosition
1961 Axiomatic Majority-Decision Logic
abstract
An algebra suited to logical design with majority-decision elements (parametrons, Esaki diodes, etc.) is developed axiomatically. The utility of the new algebra is demonstrated by resolving sample problems.
Marius Cohn, Richard Lindaman
 IRE Trans. Electron. Comput.2
1960 A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean Algebra
abstract
Recent developments in computer technology have produced devices (parametrons, Esaki diodes) that act logically as binary majority-decision elements. Conventional design techniques fail to utilize fully the logical properties of these devices. The resulting designs are extravagant with respect to the number of components used and the operating time required. This paper reviews the conventional technique briefly and proposes an alternative method that produces more nearly minimal designs.
Richard Lindaman
 IRE Trans. Electron. Comput.1