Demo Data from VLDB 2026 / reviewers in the wild / expert
Tetsuo Ichimori
dblp:33/5214
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Computer networks · 1 · 1 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Interconnection networks and networks-on-chip · 46% Hardware reliability and fault tolerance · 30% Distributed systems · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › network topology › loop networks
double-loop network |
0.0 | 1 | 1989 | Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989 |
Distributed systems
fault tolerance |
0.0 | 1 | 1989 | Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989 |
Hardware reliability and fault tolerance › network fault tolerance
multinode failure tolerance |
0.0 | 1 | 1989 | Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989 |
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1989 | Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989 |
Hardware reliability and fault tolerance
reliability analysis |
0.0 | 1 | 1989 | Tolerance of Double-Loop Computer Networks to Multinode Failures · IEEE Trans. Computers 1989 |
Methods — techniques the papers use, named apart from their topics
fault tolerance analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | A two-commodity sharing problem on networksabstractAbstract This paper considers a sharing problem of distributing a given quantity of resources to a set of demand nodes in a network as equally as possible. We study the case in which the resources are of two distinct kinds and propose a polynomial time algorithm for it by reducing the problem to the one‐commodity sharing problem. Tetsuo Ichimori, Naoki Katoh |
Networks | 1 |
| 1989 | Tolerance of Double-Loop Computer Networks to Multinode FailuresabstractThe reliability of double-loop networks is examined along with their fault tolerance in cases when more than two nodes break down. It is demonstrated that double-loop structured networks are very desirable with respect to the measure of fault tolerance introduced.> Hiroshi Masuyama, Tetsuo Ichimori |
IEEE Trans. Computers | 2 |
| 1983 | Two routing problems with the limitation of fuel
Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida |
Discret. Appl. Math. | 1 |