VLDB 2026 Research / reviewers in the wild / expert
Robert H. Wyman
dblp:177/1260 · also Robert H. Wyman Jr.
· DBLP profile ↗
2ranked-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 · 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 · 75% Electronic design automation · 25% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design › digital circuit design › combinational logic
decoder architecture |
0.0 | 1 | 1973 | Loading of Decoder Drivers · IEEE Trans. Computers 1973 |
Integrated circuit design
digital circuit design |
0.0 | 1 | 1973 | Loading of Decoder Drivers · IEEE Trans. Computers 1973 |
Electronic design automation › logic synthesis
logic elements |
0.0 | 1 | 1965 | On Complete Sets of Logic Primitives · IEEE Trans. Electron. Comput. 1965 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1965 | On Complete Sets of Logic Primitives · IEEE Trans. Electron. Comput. 1965 |
Computational complexity
boolean function theory |
0.0 | 1 | 1965 | On Complete Sets of Logic Primitives · IEEE Trans. Electron. Comput. 1965 |
Methods — techniques the papers use, named apart from their topics
circuit analysis · 0.0least upper bound analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1973 | Loading of Decoder DriversabstractThe load on any input wire of a decoder is calculated and shown to be independent of the state of the other inputs. Robert H. Wyman |
IEEE Trans. Computers | 1 |
| 1965 | On Complete Sets of Logic PrimitivesabstractA complete set of logic primitives is a set of devices which can be connected to represent any Boolean function of binary variables. This paper deals with the number of devices required in a complete set of logic primitives. It is well known that a complete set of logic primitives may contain as few as one element, e.g., NOR. It is the purpose of this paper to establish a least upper bound on the number of nonredundant elements in a complete set. It is shown that every complete set contains a complete subset with at most four elements. Further, a complete set with four elements is presented which is incomplete if any element is deleted. Herschel H. Loomis Jr., Robert H. Wyman |
IEEE Trans. Electron. Comput. | 2 |