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

Otto Kolp

dblp:34/2934 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 4 · 3 first-authorTheory of computation · 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.

Theoretical computer science
2 papers
Combinatorics and discrete mathematics · 67% Automata and formal languages · 21% Logic in computer science · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › group theory
group functions
0.021976
A Theory of Cascade Decomposition of Group Functions · Inf. Control. 1976
The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions · IEEE Trans. Computers 1972
Automata and formal languages › algebraic automata theory › automata decomposition
cascade decomposition
0.011976
A Theory of Cascade Decomposition of Group Functions · Inf. Control. 1976
Combinatorics and discrete mathematics
group theory
0.011976
A Theory of Cascade Decomposition of Group Functions · Inf. Control. 1976
Electronic design automation › logic synthesis
boolean function realization
0.011974
Fan-In Constrained Tree Networks of Flexibe Cells · IEEE Trans. Computers 1974
Electronic design automation
logic synthesis
0.011974
Fan-In Constrained Tree Networks of Flexibe Cells · IEEE Trans. Computers 1974
Combinatorics and discrete mathematics
decomposability
0.011972
The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions · IEEE Trans. Computers 1972
Logic in computer science
many-valued logic
0.011972
The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions · IEEE Trans. Computers 1972

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

irredundant tree construction algorithm · 0.0elspas-stone theory · 0.0
YearPublicationVenuePosition
1994 Performance Estimation for a Parallel System with a Hierarchical Switch Network
Otto Kolp
Parallel Comput.1
1988 Performance estimations for SUPRENUM systems
Otto Kolp, Hermann Mierendorff
Parallel Comput.1
1976 A Theory of Cascade Decomposition of Group Functions
Otto Kolp
Inf. Control.1
1974 Fan-In Constrained Tree Networks of Flexibe Cells
abstract
This paper is concerned with the synthesis of irredundant tree networks with two-input single-output flexible cells. An algorithm is developed which tests whether a given Boolean function is tree realizable; if it is tree realizable, a best tree is generated which realizes the function. It is shown that for each realizable function there exists a nontrivial unique partition from which a best tree can be constructed. Finally, the number of functions realizable by irredundant trees is determined.
K. Chakrabarti, Otto Kolp
IEEE Trans. Computers2
1972 The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions
abstract
This note is largely a generalization of the Elspas-Stone theory about the realization of group functions from Xm into H. In the paper of Elspas-Stone only the case X = {0,1} was treated, whereas we consider an arbitrary finite set X. We have shown that the most important results of [1] hold for this general case.
Otto Kolp
IEEE Trans. Computers1