KANEKO Keiichi 金子敬一

… Alternative Names

Researcher Number	20194904
Other IDs
External Links
Affiliation (Current)	2021: 東京農工大学, 工学(系)研究科(研究院), 教授
Affiliation (based on the past Project Information) *help	2017 – 2020: 東京農工大学, 工学(系)研究科(研究院), 教授 2012 – 2015: 東京農工大学, 工学(系)研究科(研究院), 教授 2010 – 2012: 東京農工大学, 大学院・工学研究院, 教授 2007 – 2009: Tokyo University of Agriculture and Technology, 大学院・共生科学技術研究院, 准教授 2006: Tokyo University of Agriculture and Technology, Institute of Symbiotic Science and Technology, Associate Professor, 大学院共生科学技術研究院, 助教授 … More
Review Section/Research Field	Principal Investigator 計算機科学 / Software / Software / Computer system/Network / Basic Section 60040:Computer system-related Except Principal Investigator 計算機科学 / Media informatics/Database / 統計学 / Informatics / 計算機工学 / 電子デバイス・機器工学 / Basic Section 60040:Computer system-related
Keywords	Principal Investigator 関数プログラム / ディペンダブルコンピューティング / 完全遅延評価 / 部分計算 / アルゴリズム / 高信頼システム / 焦げたパンケーキグラフ / パンケーキグラフ / 計算機システム / ディペンダブル・コンピューティング … More Except Principal Investigator 関数プログラム / FPGA / 欠測値 / 最尤推定 / EMアルゴリズム / スコアリング法 / 収束の加速 / Aitken加速 / 最小多項式外挿法 / 遅延メモ化機構 / 完全遅延評価 / 部分評価系 / ヒューマンインタフェース / 自然言語 / 情報量 / 階層的クラスタリング / 木構造 / 階層構造変化 / 安定性 / ボロノイ図 / 可視化 / 疑似カラー / 大規模データ / 一様乱数 / M系列 / 整数計画法 / 集合被覆問題 / 並列実行 / Functional Program / Parallel Evaluation / プログラミング方法論 / 遅延評価機構 / 部分計算 / 自己進化機構 / Programming Methodology / Lazy Evaluation / Partial Evaluation / Program Transformation / Program Evolution / フォールトトレランス / VLSIチップ / アーキテクチャ / 欠陥 / 故障 / 再構成 / 誤り回復 / 2次キャッシュ / 欠陥回避 / 故障検査 / 2重バス / 多重系動作 / 階層構成 / コンカレント誤り検出 / Fault Tolerance / VLSI Chip / Architecture / Defect / Fault / Reconfiguration / Error Recovery / routing / fault tolerance / cluster / 計算機システム関連 / 相互結合網 / 経路選択問題 / システムディペンダビリティ / 信頼性 Less

幅広い次元のトーラスにおいて高性能を発揮する確率的耐リンク故障経路選択手法の探求Principal InvestigatorOngoing
- Principal Investigator
  
  金子敬一
- Project Period (FY)
  2020 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60040:Computer system-related
- Research Institution
  Tokyo University of Agriculture and Technology
Cluster-fault-tolerant routing methods in toriOngoing
- Principal Investigator
  
  ボサールアントワーヌ
- Project Period (FY)
  2019 – 2021
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60040:Computer system-related
- Research Institution
  Kanagawa University
A Stochastic Link-fault-tolerant Routing Method in Torus NetworksPrincipal Investigator
- Principal Investigator
  
  Kaneko Keiichi
- Project Period (FY)
  2017 – 2019
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Software
- Research Institution
  Tokyo University of Agriculture and Technology
Development of Stochastic Fault-tolerant Routing Methods in Cayley GraphsPrincipal Investigator
- Principal Investigator
  
  Kaneko Keiichi
- Project Period (FY)
  2013 – 2015
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Software
- Research Institution
  Tokyo University of Agriculture and Technology
Development of Cluster-Fault-Tolerant Routing Algorithms in Cayley GraphsPrincipal Investigator
- Principal Investigator
  
  KANEKO Keiichi
- Project Period (FY)
  2010 – 2012
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Computer system/Network
- Research Institution
  Tokyo University of Agriculture and Technology
Development of Cluster-Fault-Tolerant Routing Algorithms in Interconnection NetworksPrincipal Investigator
- Principal Investigator
  
  KANEKO Keiichi
- Project Period (FY)
  2007 – 2009
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Software
- Research Institution
  Tokyo University of Agriculture and Technology
離散構造データの幾何的配置変動に起因する複雑性の解明
- Principal Investigator
  
  斎藤隆文
- Project Period (FY)
  2005 – 2007
- Research Category
  
  Grant-in-Aid for Exploratory Research
- Research Field
  
  Media informatics/Database
- Research Institution
  Tokyo University of Agriculture and Technology
自然言語インタフェースのための文字遷移情報量に対する新しい視点と応用
- Principal Investigator
  
  中川正樹
- Project Period (FY)
  2004 – 2006
- Research Category
  
  Grant-in-Aid for Exploratory Research
- Research Field
  
  Media informatics/Database
- Research Institution
  Tokyo University of Agriculture and Technology
Development of Routing Algorithms for Interconnection Networks based on Cayley GraphsPrincipal Investigator
- Principal Investigator
  
  KANEKO Keiichi
- Project Period (FY)
  2004 – 2006
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Software
- Research Institution
  Tokyo University of Agriculture and Technology
Development of Routing Algorithms for Rotator GraphsPrincipal Investigator
- Principal Investigator
  
  KANEKO Keiichi
- Project Period (FY)
  2001 – 2003
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  Tokyo University Agriculture And Technology
Design for Fault Tolerant VLSI Chips
- Principal Investigator
  
  ITO Hideo
- Project Period (FY)
  1998 – 2000
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  電子デバイス・機器工学
- Research Institution
  Chiba University
単一参照プロセスの検出による関数プログラムの並列実行性能の改善Principal Investigator
- Principal Investigator
  
  金子敬一
- Project Period (FY)
  1997 – 1998
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Chiba University
完全遅延部分評価のための処理系の開発Principal Investigator
- Principal Investigator
  
  金子敬一
- Project Period (FY)
  1995
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  The University of Tokyo
Research on Self-evolution Mechanisms of Computer Programs
- Principal Investigator
  
  TAKEICHI Masato
- Project Period (FY)
  1995 – 1996
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  計算機科学
- Research Institution
  University of Tokyo
遅延メモ化機構によるプログラムの部分計算に関する研究
- Principal Investigator
  
  TAKEICHI Masato
- Project Period (FY)
  1994
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  計算機科学
- Research Institution
  The University of Tokyo
部分計算に適した関数プログラムの完全遅延評価環境の実現Principal Investigator
- Principal Investigator
  
  金子敬一
- Project Period (FY)
  1994
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  The University of Tokyo
完全遅延評価による関数プログラムの部分計算Principal Investigator
- Principal Investigator
  
  金子敬一
- Project Period (FY)
  1993
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  The University of Tokyo
欠測値を含む多変量デ-タの効率的解析法に関する研究
- Principal Investigator
  
  伏見正則
- Project Period (FY)
  1989
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  統計学
- Research Institution
  The University of Tokyo
Parallel Evaluation of Functional Programs
- Principal Investigator
  
  TAKEICHI Masato
- Project Period (FY)
  1989 – 1990
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  計算機工学
- Research Institution
  University of Tokyo
パーソナル・コンピュータ用高精度乱数発生法の研究
- Principal Investigator
  
  伏見正則
- Project Period (FY)
  1988
- Research Category
  
  Grant-in-Aid for General Scientific Research (C)
- Research Field
  
  Informatics
- Research Institution
  The University of Tokyo

[Journal Article] Node-Disjoint Paths Problems in Directed Bijective Connection Graphs2020
- Author(s)
  KANEKO Keiichi
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E103.D Issue: 1 Pages: 93-100
- DOI
  10.1587/transinf.2019edp7197
  10.1587/transinf.2019EDP7197
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph2018
- Author(s)
  Yo Nishiyama, Yuko Sasaki, Yuki Hirai, Hironori Nakajo, and Keiichi Kaneko
- Journal Title
  
  Journal of Information Science and Engineering
  
  Volume: 34
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] Torus Pairwise Disjoint-path Routing2018
- Author(s)
  Antoine Bossard and Keiichi Kaneko
- Journal Title
  
  Sensors
  
  Volume: 18
- DOI
  10.3390/s18113912
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] A Stochastic Link-fault-tolerant Routing Algorithm in Folded Hypercubes2018
- Author(s)
  Bui Thi Thuan, Lam Boi Ngoc, and Keiichi Kaneko
- Journal Title
  
  The Journal of Supercomputing
  
  Volume: 74 Pages: 5539-5557
- DOI
  10.1007/s11227-018-2456-9
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] A Set-to-Set Disjoint Paths Routing Algorithm in Tori2017
- Author(s)
  Keiichi Kaneko and Antoine Bossard
- Journal Title
  
  International Journal of Networking and Computing
  
  Volume: 7 Pages: 173-186
- NAID
  130006135386
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] Stochastic Fault-Tolerant Routing in Dual-Cubes2017
- Author(s)
  Junsuk Park, Nobuhiro Seki, and Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E100-D Issue: 8 Pages: 1920-1921
- DOI
  10.1587/transinf.2017edl8046
  10.1587/transinf.2017EDL8046
- NAID
  130005876128
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] Node-to-Node Disjoint Paths Problem in Möbius Cubes2017
- Author(s)
  David Kocik and Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E100-D Issue: 8 Pages: 1837-1843
- DOI
  10.1587/transinf.2016edp7475
  10.1587/transinf.2016EDP7475
- NAID
  130005875974
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Journal Article] Node-to-Set Disjoint Paths Problem in a Möbius Cube2016
- Author(s)
  David Kocik, Yuki Hirai, and Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems
  
  Volume: E99-D Issue: 3 Pages: 708-713
- DOI
  10.1587/transinf.2015edp7331
  10.1587/transinf.2015EDP7331
- NAID
  130005131821
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Hypercube Fault Tolerant Routing with Bit Constraint2015
- Author(s)
  Antoine Bossard and Keiichi Kaneko
- Journal Title
  
  International Journal of Networking and Computing
  
  Volume: 5 Pages: 272-289
- NAID
  130005091736
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Torus-Connected Cycles: A Simple and Scalable Topology for Interconnection Networks2015
- Author(s)
  Antoine Bossard and Keiichi Kaneko
- Journal Title
  
  International Journal of Applied Mathematics and Computer Science
  
  Volume: 25 Pages: 723-735
- DOI
  10.1515/amcs-2015-0052
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Node-to-Set Disjoint Paths Routing in a Metacube2015
- Author(s)
  Antoine Bossard, Keiichi Kaneko, and Shietung Peng
- Journal Title
  
  International Journal of High Performance Computing and Networking
  
  Volume: 8 Pages: 315-323
- DOI
  10.1504/ijhpcn.2015.072778
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint2015
- Author(s)
  Antoine Bossard and Keiichi Kaneko
- Journal Title
  
  International Journal of Networked and Distributed Computing
  
  Volume: 3 Pages: 202-213
- DOI
  10.2991/ijndc.2015.3.4.1
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Torus-Connected Cycles: A Simple and Scalable Topology for Interconnection Networks2015
- Author(s)
  Antoine Bossard, Keiichi Kaneko
- Journal Title
  
  International Journal of Applied Mathematics and Computer Science
  
  Volume: 25
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Node-to-Set Disjoint Paths Routing in a Metacube2015
- Author(s)
  Antoine Bossard, Keiichi Kaneko, Shietung Peng
- Journal Title
  
  International Journal of High Performance Computing and Networking
  
  Volume: 8
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] k-pairwise Disjoint Paths Routing in Perfect Hierarchical Hypercubes2014
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Journal Title
  
  Journal of Supercomputing
  
  Volume: 67 Pages: 485-495
- DOI
  10.1007/s11227-013-1013-9
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes2014
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Journal Title
  
  Journal of Information Science and Engineering
  
  Volume: 30
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks2014
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Journal Title
  
  The Computer Journal
  
  Volume: 57
- DOI
  10.1093/comjnl/bxs171
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] Fault-tolerant Routing based on Approximate Directed Routable Probabilities for Hypercubes2014
- Author(s)
  Dinh, Thuy Duong, and Keiichi Kaneko
- Journal Title
  
  Future Generation Computer Systems
  
  Volume: -
- DOI
  10.1016/j.future.2013.12.003
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330079
[Journal Article] TheSet-to-set Disjoint-path Problem in Perfect Hierarchical Hypercubes2012
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Journal Title
  
  The Computer Journal
  
  Volume: Vol.55, No.6 Pages: 769-775
- DOI
  10.1093/comjnl/bxr135
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500041
[Journal Article] Node-to-set Disjoint-path Routing in Hierarchical Cubic Networks2012
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Journal Title
  
  The Computer Journal
  
  Volume: Vol.55, No.12 Pages: 1440-1446
- DOI
  10.1093/comjnl/bxr137
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500041
[Journal Article] 部分列反転グラフにおける内素な経路2012
- Author(s)
  金子敬一
- Journal Title
  
  電子情報通信学会論文誌
  
  Volume: Vol.J95-D,No.1 Pages: 47-53
- NAID
  110008897585
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500041
[Journal Article] A New Node-to-set Disjoint-path Algorithm in Perfect Hierarchical Hypercubes2011
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, and Shie-tung Peng
- Journal Title
  
  The Computer Journal
  
  Volume: Vol.54, No.8 Pages: 1372-1381
- DOI
  10.1093/comjnl/bxr047
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500041
[Journal Article] Fault-tolerant Routing in Burnt Pancake Graphs2010
- Author(s)
  Iwasaki, Tatsuya, and Keiichi Kaneko
- Journal Title
  
  Information Processing Letters
  
  Volume: Vol.110, No.14-15 Pages: 535-538
- DOI
  10.1016/j.ipl.2010.04.023
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500041
[Journal Article] Fault-tolerant Routing in Burnt Pancake Graphs2010
- Author(s)
  T.Iwasaki, K.Kaneko
- Journal Title
  
  Information Processing Letters
  
  Volume: 110 Pages: 535-538
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500041
[Journal Article] (n, k)-パンケーキグラフとその特性2008
- Author(s)
  澤田直樹, 金子敬一
- Journal Title
  
  電子情報通信学会論文誌 Vol.J91-D,No.1
  
  Pages: 1-11
- NAID
  110007380896
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500022
[Journal Article] The Container Problem in Bubble-Sort Graphs2008
- Author(s)
  Suzuki, Yasuto, Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information andSystems E91-D(4)
  
  Pages: 1003-1009
- NAID
  10026802642
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500022
[Journal Article] (n,k)-パンケーキグラフとその特性2008
- Author(s)
  澤田直樹, 金子敬一
- Journal Title
  
  電子情報通信学会論文誌 J91-D
  
  Pages: 1-11
- NAID
  110007380896
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500022
[Journal Article] The Container Problem in Bubble-Sort Graphs2008
- Author(s)
  Suzuki, Yasuto, Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems Vol.E91-D,No.4
  
  Pages: 1003-1009
- NAID
  10026802642
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500022
[Journal Article] An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs2007
- Author(s)
  Keiichi Kaneko, Naoki Sawada
- Journal Title
  
  IEICE Transactions on Information and Systems E90-D, 1
  
  Pages: 306-313
- NAID
  110007519470
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs2007
- Author(s)
  Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems E90-D
  
  Pages: 716-721
- NAID
  110007519532
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500022
[Journal Article] An Algorithmfor Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs2007
- Author(s)
  Keiichi Kaneko, Naoki Sawada
- Journal Title
  
  IEICE Transactions on Information and Systems E90-D・1
  
  Pages: 306-313
- NAID
  110007519470
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs2007
- Author(s)
  Kaneko, Keiichi
- Journal Title
  
  IEICE Transactions on Information and Systems E90-D, 4
  
  Pages: 716-721
- NAID
  110007519532
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs2007
- Author(s)
  Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems E90-D・4
  
  Pages: 716-721
- NAID
  110007519532
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs2007
- Author(s)
  Keiichi Kaneko, Naoki Sawada
- Journal Title
  
  IEICE Transactions on Information and Systems E90-D・1
  
  Pages: 306-313
- NAID
  110007519470
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs2006
- Author(s)
  Kaneko, Keiichi
- Journal Title
  
  IEICE Transactions on Information and Systems E89-D・2
  
  Pages: 647-653
- NAID
  110004719332
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] PC クラスタを用いた16 パンケーキグラフの直径計算2006
- Author(s)
  浅井章吾, 鴻池祐輔, 品野勇治, 金子敬一
- Journal Title
  
  情報処理学会論文誌 : 数理モデル化と応用 47・SIG14 (TOM15)
  
  Pages: 71-79
- NAID
  110004856979
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs2006
- Author(s)
  Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems E89-D・2
  
  Pages: 647-653
- NAID
  110004719332
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Node-Disjoint Paths in a Transposition Graph2006
- Author(s)
  Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
- Journal Title
  
  IEICE Transactions on Information and Systems E89-D, 10
  
  Pages: 2600-2605
- NAID
  110002914252
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Node-Disjoint Paths in a Transposition Graph2006
- Author(s)
  Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
- Journal Title
  
  IEICE Transactions on Information and Systems E89-D・10
  
  Pages: 2600-2605
- NAID
  110002914252
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] PC クラスタを用いた16パンケーキグラフの直径計算2006
- Author(s)
  浅井章吾, 鴻池祐輔, 品野勇治, 金子敬一
- Journal Title
  
  清報処理学会論文誌 : 数理モデル化と応用 47・SIG14(TOM15)
  
  Pages: 71-79
- NAID
  110004856979
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Computing the Diameters of 16-pancake Graph Using a PC Cluster2006
- Author(s)
  Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko
- Journal Title
  
  IPSJ Transactions on Mathematical Modeling and its Applications 47, SIG14(TOM15)
  
  Pages: 71-79
- NAID
  110004856979
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs2006
- Author(s)
  Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems E89-D, 2
  
  Pages: 647-653
- NAID
  110004719332
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Internally-Disjoint Paths Problem in Bi-Rotator Graphs2005
- Author(s)
  Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems E88-D・7
  
  Pages: 1678-1684
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] パンケーキグラフの直径計算2005
- Author(s)
  鴻池祐輔, 金子敬一, 品野勇治
- Journal Title
  
  情報処理学会論文誌:数理モデルと応用 46(印刷中)
- NAID
  110002768712
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] バブルソートグラフにおける耐故障経路選択アルゴリズム2005
- Author(s)
  鈴木康斗, 金子敬一
- Journal Title
  
  電子情報通信学会論文誌 J88-D-I・4
  
  Pages: 751-756
- NAID
  110003173709
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Container Problem in Burnt Pancake Graphs2005
- Author(s)
  Sawada, Naoki, Yasuto Suzuki, Keiichi Kaneko
- Journal Title
  
  Parallel and Distributed Processing and Applications LNCS 3758
  
  Pages: 479-490
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] バブルソートグラフにおける素な経路選択アルゴリズム2005
- Author(s)
  鈴木康斗, 金子敬一
- Journal Title
  
  電子情報通信学会論文誌 J88-D-I・4
  
  Pages: 751-756
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Internally-Disjoint Paths Problem in Bi-Rotator Graphs2005
- Author(s)
  Kaneko, Keiichi
- Journal Title
  
  IEICE Transactions on Information and Systems E88-D・7
  
  Pages: 1678-1684
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] パンケーキグラフの直径計算2005
- Author(s)
  鴻池祐輔, 金子敬一, 品野勇治
- Journal Title
  
  情報処理学会論文誌:数理モデル化と応用 46・SIG10(TOM12)
  
  Pages: 48-56
- NAID
  110002768712
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Hamiltonian Cycles and Paths in Burnt Pancake Graphs2005
- Author(s)
  Suzuki, Yasuto, Naoki Sawada, Keiichi Kaneko
- Journal Title
  
  Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems
  
  Pages: 85-90
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Internally-Disjoint Paths Problem in Bi-Rotator Graphs2005
- Author(s)
  Keiichi Kaneko
- Journal Title
  
  IEICE Transactions on Information and Systems E88-D, 7
  
  Pages: 1678-1684
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs2004
- Author(s)
  K.Kaneko
- Journal Title
  
  Parallel and Distributed Processing and Applications LNCS3358
  
  Pages: 556-567
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Container Problem in Bi-Rotator Graphs2004
- Author(s)
  K.Kaneko, Y.Suzuki, Y.Hasegawa
- Journal Title
  
  Parallel and Distributed Computing : Applications and Technologies LNCS3320
  
  Pages: 149-154
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Node-Disjoint Paths in a Transposition Graph2004
- Author(s)
  Y.Suzuki, K.Kaneko, M.Nakamori
- Journal Title
  
  Proc.2004 International Conference on Parallel and Distributed Processing Techniques and Applications
  
  Pages: 298-304
- NAID
  110002914252
- Data Source
  KAKENHI-PROJECT-16500015
[Journal Article] Container Problem in Substring Reversal Graphs2004
- Author(s)
  Y.Suzuki, K.Kaneko, M.Nakamori
- Journal Title
  
  Proc.International Symposium on Parallel Architectures, Algorithms and Networks
  
  Pages: 563-568
- Data Source
  KAKENHI-PROJECT-16500015
[Presentation] Fault-tolerant Routing based on Fault Information of Cross-edges in Dual-cubes2019
- Author(s)
  Nobuhiro Seki, Kousuke Mouri, and Keiichi Kaneko
- Organizer
  2019 International Conference on Parallel and Distributed Processing Techniques and Applications
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] On the Torus Pairwise Disjoint-path Routing Problem2018
- Author(s)
  Antoine Bossard and Keiichi Kaneko
- Organizer
  The 18th IEEE International Conference on Computer and Information Technology
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] Fault-tolerant Routing Methods in Crossed Cubes2018
- Author(s)
  Koji Otake, Kousuke Mouri, and Keiichi Kaneko
- Organizer
  The 10th International Conference on Advances in Information Technology
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] Node-to-node Disjoint Paths in Twisted Crossed Cubes2018
- Author(s)
  Hiroki Nagashima, Mouri Kousuke, and Keiichi Kaneko
- Organizer
  The 10th International Conference on Advances in Information Technology
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] A Fully Adaptive Minimal Routing Algorithm in a Crossed Cube2018
- Author(s)
  Kaito Satoh, Kousuke Mouri, and Keiichi Kaneko
- Organizer
  The 2018 International Conference on Parallel and Distributed Processing Techniques and Applications
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] On the Crossing Number of Tori2018
- Author(s)
  Antoine Bossard, Keiichi Kaneko and Frederick C. Harris Jr.
- Organizer
  The Fourth International Conference on Electronics and Software Science
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] Stochastic Link-fault-tolerant Routing in a Torus2018
- Author(s)
  Seiya Kuramochi, Yu-on Chatchakan, Kousuke Mouri, and Keiichi Kaneko
- Organizer
  The 15th International Joint Conference on Computer Science and Software Engineering
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] Link-fault-tolerant Routing in Folded Hypercube using Directed Routing Probability2017
- Author(s)
  Ngoc Boi Lam and Keiichi Kaneko
- Organizer
  The 2017 Sixth ICT International Student Project Conference
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] Shortest-path Routing in Spined Cubes2017
- Author(s)
  Kaito Satoh, Keiichi Kaneko, Thi Hong Hanh Phan, and Thi Thanh Binh Huynh
- Organizer
  The 2017 Sixth ICT International Student Project Conference
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] Stochastic Fault-tolerant Routing in Locally Twisted Cubes2017
- Author(s)
  Yudai Takano and Keiichi Kaneko
- Organizer
  The 2017 Sixth ICT International Student Project Conference
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] An Algorithm for Set-to-Set Disjoint Paths Problem in a Mobius Cube2017
- Author(s)
  Keiichi Kaneko
- Organizer
  2017 International Conference on Parallel and Distributed Processing Techniques and Applications
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00093
[Presentation] On Solving the Container Problem in a Hypercube with Bit Constraint2015
- Author(s)
  Antoine Bossard and Keiichi Kaneko
- Organizer
  The 16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
- Place of Presentation
  サンポートホール高松会議場（香川県高松市）
- Year and Date
  2015-06-01
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Fault-tolerant Routing in Dual-cubes based on Routing Probabilities2015
- Author(s)
  Junsuk Park, Yuki Hirai, and Keiichi Kaneko
- Organizer
  The 7th International Conference on Advances in Information Technology
- Place of Presentation
  Bangkok, Thailand
- Year and Date
  2015-11-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] An Algorithm for Node-to-Set Disjoint Paths Problem in a Mobius Cube2015
- Author(s)
  David Kocik, Yuki Hirai and Keiichi Kaneko
- Organizer
  The 2015 4th International Student Project Conference
- Place of Presentation
  東京農工大学（東京都小金井市）
- Year and Date
  2015-05-23
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] An Algorithm for Node-to-Node Disjoint Paths Problem in a Mobius Cube2015
- Author(s)
  David Kocik, Yuki Hirai and Keiichi Kaneko
- Organizer
  The 2015 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, USA
- Year and Date
  2015-07-27
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] A Fault-tolerant Routing Algorithm based on Safety Levels in a Burnt Pancake Graph2015
- Author(s)
  Keita Wakayama, Yuki Hirai and Keiichi Kaneko
- Organizer
  The 2015 4th International Student Project Conference
- Place of Presentation
  東京農工大学（東京都小金井市）
- Year and Date
  2015-05-23
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] The Container Problem in a Torus-connected Cycles Network2014
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Organizer
  International Conference on Computational Science
- Place of Presentation
  Cairns, Australia
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Torus-connected Cycles: An Implementation-friendly Topology for Interconnection Networks of Massively Parallel Systems2013
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Organizer
  13th International Conference on Algorithms and Architectures for Parallel Processing
- Place of Presentation
  Vietri sul Mare, Italy
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Set-to-set Disjoint Paths Routing in Hyper-star Graphs2013
- Author(s)
  Bossard, Antoine, and Keiichi Kaneko
- Organizer
  ISCA 3rd International Conference on Advanced Computing and Communications
- Place of Presentation
  Los Angeles, California, USA
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] A Stochastic Fault-tolerant Routing Algorithm in Hyper-Star Graphs2013
- Author(s)
  Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
- Organizer
  2013 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Fault-tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph2012
- Author(s)
  Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
- Organizer
  Proceedings of the International Conference on Advanced Computer Science, Applications and Technologies
- Place of Presentation
  Kuala Lumpur, Malaysia
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Routing Based on Safety Levels in a Hyper-star Graph2012
- Author(s)
  Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko
- Organizer
  Proceedings of the IADIS International Conference on Applied Computing 2012
- Place of Presentation
  Madrid, Spain
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] A Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Net-works2012
- Author(s)
  Myojin, Manabu, and Keiichi Kaneko
- Organizer
  Proceedings of the 2012 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks2011
- Author(s)
  Dinh Thuy Duong and Keiichi Kaneko
- Organizer
  Proceedings of the 2011 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] An Algorithm for Node-to-set Disjoint Paths Problem in a Substring Reversal Graph2011
- Author(s)
  Jung, Sinyu, and Keiichi Kaneko
- Organizer
  Proceedings of the 8th Joint Conference on Computer Science and Software Engineering
- Place of Presentation
  Nakhon Pathom, Thailand
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks2011
- Author(s)
  Dinh Thuy Duong, Keiichi Kaneko
- Organizer
  2011 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, USA
- Year and Date
  2011-07-18
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] A Routing Algorithm of Pairwise Disjoint Paths in a Burnt Pancake Graph2011
- Author(s)
  Iwasaki, Tatsuya, Keiichi Kaneko
- Organizer
  nd International Symposium on Information and Communication Technology
- Place of Presentation
  Hanoi, Vietnam
- Year and Date
  2011-10-13
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Set-to-set Disjoint Path Routing Algorithm in Burnt Pancake Graphs2011
- Author(s)
  Iwasawa, Nagateru, Antoine Bossard, and Keiichi Kaneko
- Organizer
  Proceedings of the ISCA 26th International Conference on Computers and their Applications
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Set-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes2011
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, Shietung Peng
- Organizer
  Fourth International C* Conference on Computer Science & Software Engineering
- Place of Presentation
  Montreal, Canada
- Year and Date
  2011-05-16
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Node-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes2011
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, Shietung Peng
- Organizer
  International Conference on Computational Science
- Place of Presentation
  Singapore
- Year and Date
  2011-06-01
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] ARouting Algorithm of Pairwise Disjoint Paths in a Burnt Pancake Graph2011
- Author(s)
  Iwasaki, Tatsuya, and Keiichi Kaneko
- Organizer
  Proceedings of the2nd International Symposium on Information and Communication Technology
- Place of Presentation
  Hanoi, Vietnam
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Set-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes2011
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
- Organizer
  Proceedings of the Fourth International C* Conference on Computer Science & Software Engineering
- Place of Presentation
  Montreal, Quebec, Canada
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Node-to-set Disjoint-path Routing in Perfect Hierarchical Hypercubes2011
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
- Organizer
  Proceedings of the International Conference on Computational Science
- Place of Presentation
  Singapore
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Routing Algorithms based on Approximate Directed Routable Probabilities for Hypercubes2011
- Author(s)
  Dinh Thuy Duong and Keiichi Kaneko
- Organizer
  Proceedings of the 11th International Conference on Algorithms and Architectures for Parallel Processing
- Place of Presentation
  Melbourne, Australia
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] An Algorithm for Node-to-Set Disjoint Paths Problem in a Substring Reversal Graph2011
- Author(s)
  Jung, Sinyu, Keiichi Kaneko
- Organizer
  8th Joint Conference on Computer Science and Software Engineering
- Place of Presentation
  Nakhon Pathom, Thailand
- Year and Date
  2011-05-11
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Routing Algorithms based on Approximate Directed Routable Probabilities for Hypercubes2011
- Author(s)
  Dinh Thuy Duong, Keiichi Kaneko
- Organizer
  11th International Conference on Algorithms and Architectures for Parallel Processing
- Place of Presentation
  Melbourne, Australia
- Year and Date
  2011-10-24
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Node-to-set Disjoint Paths Routing in Metacube2010
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, andShietung Peng
- Organizer
  Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
- Place of Presentation
  Marina del Rey, California, USA
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Set-to-set Disjoint-path Routing in Metacube2010
- Author(s)
  Peng, Shietung, and Keiichi Kaneko
- Organizer
  Proceedings of the Eleventh International Conference on Parallel and Distributed Computing, Applications and Technologies
- Place of Presentation
  Wuhan, China
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Cluster-fault-tolerant Routing in Burnt Pancake Graphs2010
- Author(s)
  Iwasawa, Nagateru, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko
- Organizer
  Proceedings of the 2010 International Symposium on Frontiers of Parallel and Distributed Computing
- Place of Presentation
  Busan, Korea
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] A Node-to-set Disjoint-path Routing Algorithm in Perfect Hierarchical Hypercubes2010
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
- Organizer
  Proceedings of the First International Conference on Advanced Computing and Communications
- Place of Presentation
  Orlando, Florida, USA
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Cluster-fault-tolerant Routing in Burnt Pancake Graphs2010
- Author(s)
  N.Iwasawa, T.Watanabe, T.Iwasaki, K.Kaneko
- Organizer
  2010 Int'l Symp.Frontiers of Parallel and Distributed Computing
- Place of Presentation
  Busan, Korea
- Year and Date
  2010-05-21
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes2010
- Author(s)
  A.Bossard, K.Kaneko, S.Peng
- Organizer
  10th Int'l Conf.Algorithms and Architectures for Parallel Processing
- Place of Presentation
  Busan, Korea
- Year and Date
  2010-05-21
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes2010
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, and Shietung Peng
- Organizer
  Proceedings of the 10th International Conference on Algorithms and Architectures for Parallel Processing
- Place of Presentation
  Busan, Korea
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Clusterfault- tolerant Routing in Burnt Pancake Graphs2010
- Author(s)
  wasawa, Nagateru, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko
- Organizer
  Proceedings of the 2010 International Symposium on Frontiers of Parallel and Distributed Computing
- Place of Presentation
  Busan, Korea
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A Feedback Vertex Set on Pancake Graphs2010
- Author(s)
  S.Jung, K.Kaneko
- Organizer
  2010 Int'l Conf.Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, USA
- Year and Date
  2010-07-12
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] A FeedbackVertex Set on Pancake Graphs2010
- Author(s)
  Jung, Sinyu, and Keiichi Kaneko
- Organizer
  Proceedings of the 2010 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] "Fault-tolerant Node-to-set Disjoint-path Routing in Hypercubes2010
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, Shietung Peng
- Organizer
  Proceedings of the 10th International Conference on Algorithms and Architectures for Parallel Processing
- Place of Presentation
  Busan, Korea
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Node-to-Set Disjoint Paths Problem in Perfect Hierarchical Hypercubes2010
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, Shietung Peng
- Organizer
  Proceedings of the Ninth IASTED International Conference on Parallel and Distributed Computing and Networks
- Place of Presentation
  Innsbruck, Austria
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A Node-to-Set Disjoint-path Routing Algorithm in Perfect Hierarchical Hypercubes2010
- Author(s)
  A.Bossard, K.Kaneko, S.Peng
- Organizer
  1st Int'l Conf.Advanced Computing and Communications
- Place of Presentation
  Orlando, USA
- Year and Date
  2010-09-15
- Data Source
  KAKENHI-PROJECT-22500041
[Presentation] Node-to-Set Disjoint Paths Problem in Perfect Hierarchical Hypercubes2009
- Author(s)
  A.Bossard, K.Kaneko, S.Peng
- Organizer
  9th IASTED Int'l Conf.Parallel and Distributed Computing and Networks
- Place of Presentation
  Innsbruck, Austria
- Year and Date
  2009-02-16
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A Node-to-set Disjoint-path Routing Algorithm in Metacube2009
- Author(s)
  A.Bossard, K.Kaneko, S.Peng
- Organizer
  10th Int'l Symp.Pervasive Systems, Algorithms and Networks
- Place of Presentation
  Kaohsiung, Taiwan, ROC
- Year and Date
  2009-12-14
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Fault-tolerant Routing Algorithm of Burnt Pancake Graphs2009
- Author(s)
  T.Iwasaki, K.Kaneko
- Organizer
  2009 Int'l Conf.Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Year and Date
  2009-07-13
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] パンケーキグラフにおける節点対間の互いに素な耐クラスタ故障経路選択アルゴリズム2009
- Author(s)
  渡部達朗, 金子敬一, 彭旭東
- Organizer
  情報処理学会第71回全国大会論文集
- Place of Presentation
  立命館大学
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A Node-to-set Disjoint-path Routing Algorithm in Metacube2009
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, Shietung Peng
- Organizer
  Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms and Networks
- Place of Presentation
  Kao-Hsiung, Taiwan, ROC
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Node-to-set Disjoint-path Routing in Metacube2009
- Author(s)
  A.Bossard, K.Kaneko, S.Peng
- Organizer
  10th Int'l Conf.Parallel and Distributed Computing, Applications and Technologies
- Place of Presentation
  Hiroshima, Japan
- Year and Date
  2009-12-08
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Node-to-set Disjoint-path Routing in Metacube2009
- Author(s)
  Bossard, Antoine, Keiichi Kaneko, Shietung Peng
- Organizer
  Proceedings of the Tenth International Conference on Parallel and Distributed Computing, Applications and Technologies
- Place of Presentation
  Hiroshima, Japan
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs2009
- Author(s)
  Iwasaki, Tatsuya, Keiichi Kaneko
- Organizer
  Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] 焦げたパンケーキグラフにおける耐故障経路選択アルゴリズム2009
- Author(s)
  岩崎達矢, 金子敬一
- Organizer
  情報処理学会第71回全国大会論文集
- Place of Presentation
  立命館大学
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Set-to-set Disjoint Paths Routing in Dualcubes2008
- Author(s)
  Peng, Shietung, Keiichi Kaneko
- Organizer
  Proceedings of the Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
- Place of Presentation
  Dunedin, New Zealand
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Set-to-set Disjoint Paths Rout ing in Dual-cubes2008
- Author(s)
  Peng, Shietung, Keiich i Kaneko
- Organizer
  9th Int'l Conf. Parallel&Distributed Computing, Applications&Technologies
- Place of Presentation
  Dunedin, New Zealand
- Year and Date
  2008-12-01
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A New Configuration of an Incomplete Star Graph and its Routing Algorithm2008
- Author(s)
  Iwasaki, Tatsuya, Keiichi Kaneko
- Organizer
  Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Nodeto- set Disjoint Paths Routing in Dual-cube2008
- Author(s)
  Kaneko, Keiichi, Shietung Peng
- Organizer
  Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks
- Place of Presentation
  Sydney, Australia
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] 焦げたパンケーキグラフの改善2008
- Author(s)
  澤田直樹, 金子敬一
- Organizer
  電子情報通信学会総合大会論文集
- Place of Presentation
  九州学術研究都市
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Node-to-set Disjoint Paths Rout ing in Dual-cube2008
- Author(s)
  Kaneko, Keiichi, Shie tung Peng
- Organizer
  Internat ional Sympos i um on Parallel Architectures, Algorithms and Networks
- Place of Presentation
  Sydney, Australia
- Year and Date
  2008-05-07
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A New Conf igurat ion of an Incomplete Star Graph and itsRout i ng Algorithm2008
- Author(s)
  Iwasaki, Tatsuya, Keiichi Kaneko
- Organizer
  Int'l Conf. Parallel and Distributed Processing Techniques and Applicat ions
- Place of Presentation
  Las Vegas, Nevada, USA
- Year and Date
  2008-07-14
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] An(n,k)-Pancake Graph and its Properties2007
- Author(s)
  Naoki Sawada and Keiichi Kaneko
- Organizer
  2007 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  ラスベガス(米国)
- Year and Date
  2007-06-25
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] An (n, k)-Pancake Graph and its Properties2007
- Author(s)
  Sawada, Naoki, Keiichi Kaneko
- Organizer
  Proceedings of the 2007 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, USA
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] A Node-to-Set Cluster-Fault- Tolerant Disjoint Routing Algorithm in Pancake Graphs2007
- Author(s)
  Watanabe, Tatsuro, Keiichi Kaneko, Shietung Peng
- Organizer
  Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems
- Place of Presentation
  Las Vegas, USA
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Cluster Fault-Tolerant Routing in Pancake Graphs2007
- Author(s)
  Kaneko, Keiichi, Naoki Sawada, Shietung
- Organizer
  Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
- Place of Presentation
  Cambridge, Massachusetts, USA
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] パンケーキグラフにおける半素な耐クラスタ故障経路選択2007
- Author(s)
  渡部達朗, 金子敬一, 彭旭東
- Organizer
  電子情報通信学会技術研究報告
- Place of Presentation
  旭川国際会議場, 北海道
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] "Pairwise Disjoint Paths in Pancake Graphs, " Proceedings of the Eighth International Conference on Parallel and Distributed Computing2007
- Author(s)
  Sawada, Naoki, Keiichi Kaneko, Shietung Peng
- Organizer
  Applications and Technologies
- Place of Presentation
  Adelaide, Australia
- Data Source
  KAKENHI-PROJECT-19500022
[Presentation] Stochastic Link-Fault-Tolerant Routing in Hypercubes
- Author(s)
  Lam Boi Ngoc, Bui Thi Thuan, Yuki Hirai, Keiichi Kaneko
- Organizer
  2015 7th International Conference on Computer Research and Development
- Place of Presentation
  Ho Chi Minh City, Vietnam
- Year and Date
  2015-02-06 – 2015-02-07
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Stochastic Link-fault-tolerant Routing in a Hyper-star Graph
- Author(s)
  Bui Thi Thuan, Yuki Hirai, Huynh Thi Thanh Binh, Keiichi Kaneko
- Organizer
  IADIS International Conference on Applied Computing 2014
- Place of Presentation
  Porto, Portugal
- Year and Date
  2014-10-25 – 2014-10-27
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] A Fault-tolerant Routing Algorithm based on Safety Levels in a Hyper-Star Graph
- Author(s)
  Yuko Sasaki, Yuki Hirai, Hironori Nakajo, Keiichi Kaneko
- Organizer
  2014 International Conference on Parallel and Distributed Processing Techniques and Applications
- Place of Presentation
  Las Vegas, Nevada, USA
- Year and Date
  2014-07-21 – 2014-07-24
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Fault-tolerant Routing in (n, k)-Star Graphs
- Author(s)
  Takara Ito, Manabu Myojin, Yuki Hirai, Keiichi Kaneko
- Organizer
  15th International Conference on Parallel and Distributed Computing, Applications and Technologies
- Place of Presentation
  Hong Kong, China
- Year and Date
  2014-12-09 – 2014-12-11
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] Fault-Tolerant Routing based on Improved Safety Levels in Pancake Graphs
- Author(s)
  Yo Nishiyama, Yuki Hirai, Keiichi Kaneko
- Organizer
  15th International Conference on Parallel and Distributed Computing, Applications and Technologies
- Place of Presentation
  Hong Kong, China
- Year and Date
  2014-12-09 – 2014-12-11
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] A Fault-tolerant Routing Algorithm based on Safety Levels in a Pancake Graph
- Author(s)
  Keiichi Kaneko
- Organizer
  Twenty-Seventh International Conference on Computer Applications in Industry and Engineering
- Place of Presentation
  New Orleans, Louisiana, USA
- Year and Date
  2014-10-13 – 2014-10-15
- Data Source
  KAKENHI-PROJECT-25330079
[Presentation] On Hypercube Routing and Fault Tolerance with Bit Constraint
- Author(s)
  Antoine Bossard, Keiichi Kaneko
- Organizer
  Second International Symposium on Computing and Networking
- Place of Presentation
  Shizuoka Convention & Arts Center "GRANSHIP", Shizuoka, Japan
- Year and Date
  2014-12-10 – 2014-12-12
- Data Source
  KAKENHI-PROJECT-25330079

1. TAKEICHI Masato (10011165)

# of Collaborated Projects: 3 results

# of Collaborated Products: 0 results
2. 伏見正則 (70008639)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
3. IWASAKI Hideya (90203372)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
4. 中川正樹 (10126295)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. 斎藤隆文 (60293007)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
6. 品野勇治 (00297623)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
7. 宮村浩子 (20376859)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. TANAKA Tetsuro (60251360)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. ITO Hideo (90042647)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
10. KITAKAMI Masato (20282832)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. OHMAMEUDA Toshiaki (60272340)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. ボサールアントワーヌ (20645882)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

KANEKO Keiichi 金子 敬一

Kaneko Keiichi 金子 敬一

Research Projects

Research Products

Co-Researchers

幅広い次元のトーラスにおいて高性能を発揮する確率的耐リンク故障経路選択手法の探求Principal InvestigatorOngoing

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Cluster-fault-tolerant routing methods in toriOngoing

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

A Stochastic Link-fault-tolerant Routing Method in Torus NetworksPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of Stochastic Fault-tolerant Routing Methods in Cayley GraphsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of Cluster-Fault-Tolerant Routing Algorithms in Cayley GraphsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of Cluster-Fault-Tolerant Routing Algorithms in Interconnection NetworksPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of Routing Algorithms for Interconnection Networks based on Cayley GraphsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of Routing Algorithms for Rotator GraphsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

単一参照プロセスの検出による関数プログラムの並列実行性能の改善Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

完全遅延部分評価のための処理系の開発Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

KANEKO Keiichi 金子敬一

Kaneko Keiichi 金子敬一