Demo Data from EDBT 2026 / reviewers in the wild / expert
Norman Balabanian
dblp:26/2878
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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 |
Interconnection networks and networks-on-chip · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › switching network
multistage interconnection network |
0.0 | 1 | 1985 | Reconfiguration Alfoithms for Interconnection Networks · IEEE Trans. Computers 1985 |
Interconnection networks and networks-on-chip
network reconfiguration |
0.0 | 1 | 1985 | Reconfiguration Alfoithms for Interconnection Networks · IEEE Trans. Computers 1985 |
Graph algorithms and graph theory
graph isomorphism |
0.0 | 1 | 1985 | Reconfiguration Alfoithms for Interconnection Networks · IEEE Trans. Computers 1985 |
Methods — techniques the papers use, named apart from their topics
equivalence testing · 0.0conjugation map · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Reconfiguration Alfoithms for Interconnection NetworksabstractThe correspondence examines the functional relations within a class of multistage interconnection networks. It is known that these networks are not rearrangeable. This fact has led to some research on interconnection network relations. The correspondence deals with one aspect of this research, namely, that of constructing an equivalence map between two interconnection networks. Procedures are given to test whether two such networks are equivalent. Whenever they are, these procedures also produce a map to conjugate one network onto the other. A. Yavuz Oruç, M. Yaman Oruç, Norman Balabanian |
IEEE Trans. Computers | 3 |