Hideo Nakano

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hiroyuki Ebara

> Home > Persons > Hideo Nakano

Publications

1998
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgaa/BaiMEN98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/BaiMEN98
Leqiang Bai, Hajime Maeda, Hiroyuki Ebara, Hideo Nakano:
A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs. J. Graph Algorithms Appl. 2(2): 1-17 (1998)
1997
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/icpads/BaiENM97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpads/BaiENM97
Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda:
An Efficient Adaptive Routing Algorithm for the Faulty Star Graph. ICPADS 1997: 82-87
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/BaiENM97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/BaiENM97
Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda:
An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph. ISAAC 1997: 62-71
1995
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/YamakawaEN95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/YamakawaEN95
Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano:
A New Approach for Routing in Arrangement Graphs and its Performance Evaluation. LATIN 1995: 509-524

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.