Demo Data from EDBT 2026 / reviewers in the wild / expert
Keiji Okada
dblp:99/6763
· DBLP profile ↗
3ranked-venue papers
2as 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 · 2 · 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
2 papers |
Interconnection networks and networks-on-chip · 41% Parallel and multicore computing · 41% Embedded and real-time systems · 18% | |
| Computer networks
1 paper |
Routing and switching · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel graph algorithms
graph connectivity |
0.0 | 1 | 1985 | Connectivity of Regular Directed Graphs with Small Diameters · IEEE Trans. Computers 1985 |
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1985 | Connectivity of Regular Directed Graphs with Small Diameters · IEEE Trans. Computers 1985 |
Routing and switching
switching |
0.0 | 1 | 1979 | Microprocessor Application to Telephone Terminal Switching System Architecture · IEEE Trans. Commun. 1979 |
Graph algorithms and graph theory › graph connectivity
directed graph connectivity |
0.0 | 1 | 1985 | Connectivity of Regular Directed Graphs with Small Diameters · IEEE Trans. Computers 1985 |
Methods — techniques the papers use, named apart from their topics
combinatorial analysis · 0.0distributed control · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Connectivity of Regular Directed Graphs with Small DiametersabstractThis paper clarifies the relation between the diameter k and the edge or node connectivity Ce or c,, of digraphs. The following two inequalities are derived: where n is the number of nodes, d is the maximum degree, and d is the minimum degree. Makoto Imase, Terunao Soneoka, Keiji Okada |
IEEE Trans. Computers | 3 |
| 1979 | Microprocessor Application to Telephone Terminal Switching System ArchitectureabstractMicroprocessor application to a switching system, especially to telephone terminals, is expected to change switching system architecture. From this viewpoint, Basic Experimental Switching System (BESS) is designed as a functionally distributed control switching system accommodating intelligent terminals. This paper describes BESS hardware and software structures. BESS has the following characteristics. 1) Microprocessor controlled terminals can store and forward dialed digits, and can exchange data between them. Almost all services can be realized merely by a program stored in each terminal itself. 2) Functionally distributed controller of only three untailored microprocessors can treat 100 basic calls. 3) Program flexibility is especially realized by distinct exchange program separation into algorithm, data management and network control parts. Keiji Okada, Haruhisa Ichikawa, Toru Miyake, Norio Sato |
IEEE Trans. Commun. | 1 |
| 1977 | Functionally distributed telephone exchange control system using microprocessors
Keiji Okada, Masaichi Kajiwara |
Euromicro Newsletter | 1 |