Demo Data from EDBT 2026 / reviewers in the wild / expert
Juhani Nieminen
dblp:55/2343
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorComputer networks · 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% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
hardware verification and test |
0.0 | 1 | 1975 | A New Method of Formulating a Minimum Edge Set · IEEE Trans. Computers 1975 |
Electronic design automation › hardware verification and test › design for testability
test point selection |
0.0 | 1 | 1975 | A New Method of Formulating a Minimum Edge Set · IEEE Trans. Computers 1975 |
Electronic design automation › hardware verification and test
fault detection |
0.0 | 1 | 1975 | A New Method of Formulating a Minimum Edge Set · IEEE Trans. Computers 1975 |
Methods — techniques the papers use, named apart from their topics
matrix covering formulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | The subtree center of a treeabstractA method to determine the least central subtree of a tree is given. The structure of the trees having a single point as a least central subtree is described, and the relation of a least central subtree of a tree to the centroid as well as to the center of that tree is given. © 1999 John Wiley & Sons, Inc. Networks 34: 272–278, 1999 Juhani Nieminen, Matti Peltola |
Networks | 1 |
| 1975 | On Homomorphic Images of Transition Graphs
Juhani Nieminen |
Inf. Process. Lett. | 1 |
| 1975 | Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph
Juhani Nieminen |
Inf. Process. Lett. | 1 |
| 1975 | A New Method of Formulating a Minimum Edge SetabstractMayeda and Ramamoorthy have reduced the problem of finding a minimum number of test points which detect an improperly operating functional element of a single entry-single exit (SEC) system graph, to the problem of finding a minimum number of edges under which this system graph is 1 distinguishable. This correspondence shows that the determilnation of the minimum edge set is equivalent to the determination of a minimum covering of a certain matrix M (S) of zeros and ones. A way of finding the matrix M (S) is proposed. Juhani Nieminen |
IEEE Trans. Computers | 1 |