![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Toshinori Yamada
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j9]Hidenori Ohta, Toshinori Yamada, Kunihiro Fujiyoshi:
On the Number of Rooms in a Rectangular Solid Dissection. J. Inf. Process. 18: 138-146 (2010) - [c20]Kei Itoh, Toshinori Yamada:
Faster adaptive parallel diagnosis in the presence of intermittent faults (extended abstract). ISCAS 2010: 1336-1339
2000 – 2009
- 2009
- [c19]Shinnosuke Hozumi, Toshinori Yamada:
On Sequential Diagnosability of 2-Dimensional Meshes and Tori. ISCAS 2009: 2926-2929 - 2008
- [j8]Hidenori Ohta, Toshinori Yamada, Chikaaki Kodama
, Kunihiro Fujiyoshi:
The O-Sequence: Representation of 3D-Dissection. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(8): 2111-2119 (2008) - [c18]Toshinori Yamada:
Minimum energy broadcasting in wireless networks (extended abstract). ISCAS 2008: 201-204 - 2007
- [c17]Toshinori Yamada, Hiroyuki Ishii:
Algorithm for Finding a Nash Equilibrium of a Two-Player Game in the Strategic Form Using Convex Hull. FCS 2007: 337-343 - [c16]Tsukasa Sone, Toshinori Yamada:
Minimum-Cost Load Balancing Document Distribution in Distributed Web Server Systems. ISCAS 2007: 1025-1028 - 2006
- [c15]Toshinori Yamada, Kazuhiro Karasawa:
On Finding a Solution in the Core of a Multicommodity Flow Game on a Spider. APCCAS 2006: 1011-1014 - [c14]Toshinori Yamada, Akiichi Koh:
Optimal adaptive diagnosis with spares. ISCAS 2006 - 2005
- [j7]Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno:
On sequential diagnosis of multiprocessor systems. Discret. Appl. Math. 146(3): 311-342 (2005) - [j6]Toshinori Yamada:
Fault-Tolerant Meshes with Constant Degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 935-940 (2005) - [j5]Koji Goda, Toshinori Yamada, Shuichi Ueno:
A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 1090-1092 (2005) - [j4]Kohsuke Ogata, Toshinori Yamada, Shuichi Ueno:
A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(12): 3661-3662 (2005) - [c13]Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno:
On VLSI decompositions for d-ary de Bruijn graphs (extended abstract). ISCAS (2) 2005: 1358-1361 - 2004
- [j3]Toshinori Yamada, Kumiko Nomura, Shuichi Ueno:
Sparse networks tolerating random faults. Discret. Appl. Math. 137(2): 223-235 (2004) - [c12]Toshinori Yamada:
Fault-Tolerant Meshes with Constant Degree. COCOON 2004: 402-411 - 2003
- [c11]Toshinori Yamada, Kumiko Nomura, Shuichi Ueno:
Optimal adaptive parallel diagnosis for arrays. ISCAS (3) 2003: 854-857 - [c10]Toshinori Yamada, Shuichi Ueno:
Optimal fault-tolerant linear arrays. SPAA 2003: 60-64 - 2002
- [j2]Suguru Amitani, Toshinori Yamada, Shuichi Ueno:
Optimal Layouts of Virtual Paths in Complete Binary Tree Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(4): 914-917 (2002) - [c9]Toshinori Yamada, Nobuaki Fujii, Shuichi Ueno:
On three-dimensional layout of pyramid networks. APCCAS (1) 2002: 159-164 - 2001
- [c8]Kumiko Nomura, Toshinori Yamada, Shuichi Ueno:
On Adaptive Fault Diagnosis for Multiprocessor Systems. ISAAC 2001: 86-98 - [c7]Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno:
On-Line Multicasting in All-Optical Networks. ISAAC 2001: 99-106
1990 – 1999
- 1999
- [c6]Toshinori Yamada, Satoshi Imai, Shuichi Ueno:
On VLSI decompositions for deBruijn graphs. ISCAS (6) 1999: 165-169 - [c5]Toshinori Yamada, Shuichi Ueno:
Sparse Networks Tolerating Random Faults. ISPAN 1999: 114-118 - 1998
- [j1]Toshinori Yamada, Shuichi Ueno:
Fault-tolerant graphs for tori. Networks 32(3): 181-188 (1998) - 1997
- [c4]Toshinori Yamada, Shuichi Ueno:
Fault-Tolerant Hypercubes with Small Degree. ISPAN 1997: 179-185 - [c3]Toshinori Yamada, Shuichi Ueno:
Fault-Tolerant Meshes with Efficient Layouts. PDPTA 1997: 1623-1632 - 1996
- [c2]Toshinori Yamada, Shuichi Ueno:
Fault-Tolerant Graphs for Tori. ISPAN 1996: 408-414 - 1995
- [c1]Toshinori Yamada, Koji Yamamoto, Shuichi Ueno:
Fault-tolerant graphs for hypercubes and tori. HICSS (2) 1995: 499-505
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint