Demo Data from EDBT 2026 / reviewers in the wild / expert
K. Chakrabarti
dblp:77/2772
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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 |
Electronic design automation · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › logic synthesis
boolean function realization |
0.0 | 1 | 1974 | Fan-In Constrained Tree Networks of Flexibe Cells · IEEE Trans. Computers 1974 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1974 | Fan-In Constrained Tree Networks of Flexibe Cells · IEEE Trans. Computers 1974 |
Methods — techniques the papers use, named apart from their topics
irredundant tree construction algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | Fan-In Constrained Tree Networks of Flexibe CellsabstractThis 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. Computers | 1 |