EDBT 2026 Demo / reviewers in the wild / expert
Thomas A. Slivinski
dblp:178/6106
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1970
—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 |
Integrated circuit design · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design › digital circuit design
logic design |
0.0 | 1 | 1970 | An Extension of Threshold Logic · IEEE Trans. Computers 1970 |
Integrated circuit design › digital circuit design
threshold logic |
0.0 | 1 | 1970 | An Extension of Threshold Logic · IEEE Trans. Computers 1970 |
Computational complexity
boolean function theory |
0.0 | 1 | 1970 | An Extension of Threshold Logic · IEEE Trans. Computers 1970 |
Methods — techniques the papers use, named apart from their topics
pseudoseparation · 0.0marginal separation · 0.0linear separation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1970 | An Extension of Threshold LogicabstractThis paper presents an extension of the concept of linear separation to generate a wider class of Boolean functions. This generalization is affected by modifying the requirements for separation to allow both true and false assignments to reside on the same hyperplane (pseudoseparation) or within the same neighborhood of a hyperplane (marginal separation). Boolean functions which can be separated in either of these ways are called partially separable functions. This paper is divided into two parts. The first deals with pseudoseparable functions and the second deals with marginally separable functions. Some of the theoretical algebraic properties of partially separable functions are investigated, and the relationship between these and the corresponding properties for separable functions is explored. Necessary and sufflcient conditions for each type of separation are also discussed, A parameter which shows whether a given Boolean function is separable, pseudoseparable, or marginally separable is introduced. Thomas A. Slivinski |
IEEE Trans. Computers | 1 |