Demo Data from SIGIR 2026 / reviewers in the wild / expert
Meyer Tannenbaum
dblp:08/2454
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1968
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
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 · 61% Electronic design automation · 32% Processor architecture and microarchitecture · 7% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design
digital circuit design |
0.0 | 1 | 1968 | Assumptions in the Threshold Synthesis of Symmetric Switching Functions · IEEE Trans. Computers 1968 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1968 | Assumptions in the Threshold Synthesis of Symmetric Switching Functions · IEEE Trans. Computers 1968 |
Integrated circuit design › digital circuit design › switching circuits
symmetric switching function synthesis |
0.0 | 1 | 1968 | Assumptions in the Threshold Synthesis of Symmetric Switching Functions · IEEE Trans. Computers 1968 |
Integrated circuit design › digital circuit design
threshold logic |
0.0 | 1 | 1968 | Assumptions in the Threshold Synthesis of Symmetric Switching Functions · IEEE Trans. Computers 1968 |
Electronic design automation › logic synthesis
threshold logic synthesis |
0.0 | 1 | 1968 | Assumptions in the Threshold Synthesis of Symmetric Switching Functions · IEEE Trans. Computers 1968 |
Processor architecture and microarchitecture
computer arithmetic |
0.0 | 1 | 1962 | Division and Overflow Detection in Residue Number Systems · IRE Trans. Electron. Comput. 1962 |
Integrated circuit design › digital arithmetic circuits
overflow detection |
0.0 | 1 | 1962 | Division and Overflow Detection in Residue Number Systems · IRE Trans. Electron. Comput. 1962 |
Integrated circuit design
residue number system arithmetic |
0.0 | 1 | 1962 | Division and Overflow Detection in Residue Number Systems · IRE Trans. Electron. Comput. 1962 |
Methods — techniques the papers use, named apart from their topics
network analysis · 0.0lower bound proof · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1968 | Assumptions in the Threshold Synthesis of Symmetric Switching FunctionsabstractAbstract—This note establishes the fact that an optimal synthesis technique (even for a small number of variables) must abandon the basic assumption of assigning only +1 weights to the primary inputs. Examples are presented where both negative primary weights and/or nonunitary primary weights are required to achieve minimality. A method of network analysis is presented which leads to optimal synthesis in a significant number of new cases. The previously accepted lower bound on the number of devices needed to realize a symmetric function is questioned, and a proof is given to establish its validity. A previously published assertion about a least upper bound on the number of devices is shown to be incorrect. Martin A. Fischler, Meyer Tannenbaum |
IEEE Trans. Computers | 2 |
| 1962 | Division and Overflow Detection in Residue Number Systems
Yates A. Keir, Philip W. Cheney, Meyer Tannenbaum |
IRE Trans. Electron. Comput. | 3 |