Broadcasting in generalized de Bruijn digraphs, OSAWA SHINGO / SHIBATA YUKIO / Yosuke Kikuchi, Aug. 2002, Proceedings of 8th annual international conference, COCOON 2002, Singapore, August 2002. Lecture note in computer science 2387. Springer-Verlag, 2387, Scientific journal
Broadcasting multiple messages by cycle-rooted tree, Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, Shingo Osawa, Yukio Shibata, May 2007, IPSJ SIG Technical Report, 2007-AL, 112, 33-40
Counting closed walks in generalized de Bruijn graphs, SHIBATA YUKIO / OSAWA SHINGO / Miyuki Shirahata, 1994, Information Processing Letters
プロセッサネットワーク上の情報散布方式と自己同型写像, 大澤 新吾 / 五十嵐 善英, 1992
バタフライのde Bruijn族のネットワークへの埋め込み, 大澤 新吾 / 柴田 幸夫 / 服部 靖之, 1998, 98/137,7-14
Embedding butterflies into the de Bruijn family networks., OSAWA SHINGO / SHIBATA YUKIO / Yasuyuki Hattori, 1998, Technical report of IEICE. COMP98-15
Automorphisms of broadcasting schemes with respect to starts rounds, OSAWA SHINGO / IGARASHI YOSHIHIDE, 1994, Information Processing Letters
Some language families generated by one-letter languages, OSAWA SHINGO / IGARASHI YOSHIHIDE / SHIBATA YUKIO, 1992, Information Science
Language families generated by one-letter languages and inclusion relations, OSAWA SHINGO / IGARASHI YOSHIHIDE / SHIBATA YUKIO, 1990, Transactions of IEICE
Optimal schemes for disseminating information in a processor network and their fault tolerance, OSAWA SHINGO / IGARASHI YOSHIHIDE / Kinya Miura / Kumiko Kanai, 1992, IEICE Transaction Information and Systems
Exact evaluation for broadcasting time on a network with faulty processors, OSAWA SHINGO / IGARASHI YOSHIHIDE / Mei Ao Han / Kumiko Kanai, 1991, IPSJ Technical Report, Algorithm
Information disseminating schemes in processor networks and their automorphisms, OSAWA SHINGO / IGARASHI YOSHIHIDE, 1992
たかだか1個の故障を含むプロセッサ網における効率的な情報散布方式, 大澤 新吾 / 五十嵐 善英 / 三浦 欽也, Dec. 1991, J74-D-I/12
Broadcasting multiple messages using cycle-rooted trees, Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, shingo Osawa, Yukio Shibata, Dec. 2009, Parallel and Distributed Computing, Applications and Technologies, 2009. PDCAT 2009.
Degree sequences related to degree set (extended abstract), Shingo Osawa, Yukio Shibata, Aug. 2011, 第24回 回路とシステムワークショップ論文集
Degree sequences related to degree set (extended abstract), Shingo Osawa, Yukio Shibata, Feb. 2011, 「計算機科学とアルゴリズムの数理的基礎とその応用」
Embedding butterflies into the de Bruijn family networks., OSAWA SHINGO / SHIBATA YUKIO / Yasuyuki Hattori, 1998, Technical report of IEICE. COMP98-15
Degree sequences related to degree set : extended abstract (Mathematical Foundations and Applications of Computer Science and Algorithms), Osawa Shingo;Shibata Yukio, Jun. 2011, RIMS Kokyuroku, 1744, 151, 158
Broadcasting multiple messages by cycle-rooted tree, IRINO Hiroaki;TANAKA Yuuki;KAWAI Hiroyuki;OSAWA Shingo;SHIBATA Yukio, May 2007, IPSJ SIG Notes, 112, 33, 40
Embedding butterflies into the de Bruijn family networks, HATTORI Yasuyuki;KAWAI Hiroyuki;OSAWA Shingo;SHIBATA Yukio, Jun. 1998, IEICE technical report. Theoretical foundations of Computing, 98, 137, 7, 14
Optimal Schemes for Disseminating Information and Their Fault Tolerance, IGARASHI Yoshihide;KANAI Kumiko;MIURA Kinya;OSAWA Shingo, Jan. 1992, IEICE Trans. Inf. & Syst., 75, 1, 22, 29
Special Section on Discrete Mathematics and Its Applications, CHAO Jinhui;EDAHIRO Masato;FUJITO Toshihiro;HAGIHARA Kenichi;HANDA Keiichi;HIRAISHI Kunihiko;ITO Hiro;MAMBO Masahiro;MATSUI Tomomi;MIYANO Eiji;OKAMOTO Eiji;OSAWA Shingo;OKABE Yasuo;IMAI Keiko, May 2001, IEICE transactions on fundamentals of electronics, communications and computer sciences, 84, 5
cycle-rooted tree を用いた複数情報の散布について, 入野 裕章,田中 勇樹,河合 博之,大澤 新吾,柴田 幸夫, 2007, 2007-AL, 112, 33, 40
Broadcasting in generalized de Bruijn digraphs, OSAWA SHINGO,SHIBATA YUKIO,Yosuke Kikuchi, 2002, LNCS 2387, pp.200--209
たかだか1個の故障を含むプロセッサ網における効率的な情報散布方式, 大澤 新吾,五十嵐 善英,三浦 欽也, 1991, J74-D-I/12
Counting closed walks in generalized de Bruijn graphs, SHIBATA YUKIO,OSAWA SHINGO,Miyuki Shirahata, 1994, 49/3,135-138
バタフライのde Bruijn族のネットワークへの埋め込み, 大澤 新吾,柴田 幸夫,服部 靖之, 1998, 98/137,7-14
Embedding butterflies into the de Bruijn family networks., OSAWA SHINGO,SHIBATA YUKIO,Yasuyuki Hattori, 1998, 98/137,7-14
Automorphisms of broadcasting schemes with respect to starts rounds, OSAWA SHINGO,IGARASHI YOSHIHIDE, 1994, 51/,35-41
Some language families generated by one-letter languages, OSAWA SHINGO,IGARASHI YOSHIHIDE,SHIBATA YUKIO, 1992, 62/3
Language families generated by one-letter languages and inclusion relations, OSAWA SHINGO,IGARASHI YOSHIHIDE,SHIBATA YUKIO, 1990, E73/5
Optimal schemes for disseminating information in a processor network and their fault tolerance, OSAWA SHINGO,IGARASHI YOSHIHIDE,Kinya Miura,Kumiko Kanai, 1992, E 75-D/1
Exact evaluation for broadcasting time on a network with faulty processors, OSAWA SHINGO,IGARASHI YOSHIHIDE,Mei Ao Han,Kumiko Kanai, 1991, 91/69
Information disseminating schemes in processor networks and their automorphisms, OSAWA SHINGO,IGARASHI YOSHIHIDE, 1992
Degree sequences related to degree set (extended abstract), Shingo Osawa,Yukio Shibata, 2011, 1744
プロセッサネットワーク上の情報散布方式と自己同型写像, 大澤 新吾,五十嵐 善英, 1992
Broadcasting multiple messages using cycle-rooted trees, Hiroaki Irino,Yuuki Tanaka,Hiroyuki Kawai,shingo Osawa,Yukio Shibata, 2009, 524--529
Degree sequences related to degree set (extended abstract), Shingo Osawa,Yukio Shibata, 2011, 1744, 21-1--8
Embedding butterflies into the de Bruijn family networks., OSAWA SHINGO,SHIBATA YUKIO,Yasuyuki Hattori, 1998, 98/137,7-14
Broadcasting in generalized de Bruijn digraphs, OSAWA SHINGO,SHIBATA YUKIO,Yosuke Kikuchi, 2002, Proceedings of 8th annual international conference, COCOON 2002, Singapore, August 2002. Lecture note in computer science 2387. Springer-Verlag, LNCS 2387, pp.200--209
Counting closed walks in generalized de Bruijn graphs, SHIBATA YUKIO,OSAWA SHINGO,Miyuki Shirahata, 1994, Information Processing Letters, 49/3,135-138
Embedding butterflies into the de Bruijn family networks., OSAWA SHINGO,SHIBATA YUKIO,Yasuyuki Hattori, 1998, Technical report of IEICE. COMP98-15, 98/137,7-14
Automorphisms of broadcasting schemes with respect to starts rounds, OSAWA SHINGO,IGARASHI YOSHIHIDE, 1994, Information Processing Letters, 51/,35-41
Some language families generated by one-letter languages, OSAWA SHINGO,IGARASHI YOSHIHIDE,SHIBATA YUKIO, 1992, Information Science, 62/3
Language families generated by one-letter languages and inclusion relations, OSAWA SHINGO,IGARASHI YOSHIHIDE,SHIBATA YUKIO, 1990, Transactions of IEICE, E73/5
Optimal schemes for disseminating information in a processor network and their fault tolerance, OSAWA SHINGO,IGARASHI YOSHIHIDE,Kinya Miura,Kumiko Kanai, 1992, IEICE Transaction Information and Systems, E 75-D/1
Exact evaluation for broadcasting time on a network with faulty processors, OSAWA SHINGO,IGARASHI YOSHIHIDE,Mei Ao Han,Kumiko Kanai, 1991, IPSJ Technical Report, Algorithm, 91/69
Information disseminating schemes in processor networks and their automorphisms, OSAWA SHINGO,IGARASHI YOSHIHIDE, 1992
Degree sequences related to degree set (extended abstract), Shingo Osawa,Yukio Shibata, 2011, 第24回 回路とシステムワークショップ論文集, 1744
Broadcasting multiple messages using cycle-rooted trees, Hiroaki Irino,Yuuki Tanaka,Hiroyuki Kawai,shingo Osawa,Yukio Shibata, 2009, Parallel and Distributed Computing, Applications and Technologies, 2009. PDCAT 2009., 524--529
Degree sequences related to degree set (extended abstract), Shingo Osawa,Yukio Shibata, 2011, 「計算機科学とアルゴリズムの数理的基礎とその応用」, 1744, 21-1--8
Embedding butterflies into the de Bruijn family networks., OSAWA SHINGO,SHIBATA YUKIO,Yasuyuki Hattori, 1998, Technical report of IEICE. COMP98-15, 98/137,7-14