|
Search the dblp DataBase
Keiichi Kaneko:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Yasuto Suzuki, Naoki Sawada, Keiichi Kaneko
Hamiltonian Cycles and Paths in Burnt Pancake Graphs. [Citation Graph (0, 0)][DBLP] ISCA PDCS, 2005, pp:85-90 [Conf]
- Keiichi Kaneko, Yasuto Suzuki
Node-to-Set Disjoint Paths Problem in Rotator Graphs. [Citation Graph (0, 0)][DBLP] ASIAN, 2000, pp:119-132 [Conf]
- Yosuke Takigiku, Yasuaki Oota, Keiichi Kaneko
Design and Implementation of a Dependable Interpreter for Functional Programs. [Citation Graph (0, 0)][DBLP] Computers and Their Applications, 2006, pp:7-12 [Conf]
- Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko
Computing the Diameter of 17-Pancake Graph Using a PC Cluster. [Citation Graph (0, 0)][DBLP] Euro-Par, 2006, pp:1114-1124 [Conf]
- Keiichi Kaneko, Hideo Ito
Fault-Tolerant Routing Algorithms for Hypercube Networks. [Citation Graph (0, 0)][DBLP] IPPS/SPDP, 1999, pp:218-224 [Conf]
- Keiichi Kaneko
Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. [Citation Graph (0, 0)][DBLP] ISPA, 2004, pp:556-567 [Conf]
- Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko
Container Problem in Burnt Pancake Graphs. [Citation Graph (0, 0)][DBLP] ISPA, 2005, pp:479-490 [Conf]
- Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
Container Problem in Substring Reversal Graphs. [Citation Graph (0, 0)][DBLP] ISPAN, 2004, pp:563-568 [Conf]
- Toshinori Takabatake, Keiichi Kaneko, Hideo Ito
Generalized Hierarchical Completely-Connected Networks. [Citation Graph (0, 0)][DBLP] ISPAN, 1999, pp:68-73 [Conf]
- Keiichi Kaneko, Yasuto Suzuki, Yukihiro Hasegawa
Container Problem in Bi-rotator Graphs. [Citation Graph (0, 0)][DBLP] PDCAT, 2004, pp:149-154 [Conf]
- Keiichi Kaneko, Shietung Peng
Disjoint Paths Routing in Pancake Graphs. [Citation Graph (0, 0)][DBLP] PDCAT, 2006, pp:254-259 [Conf]
- Keiichi Kaneko
Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs. [Citation Graph (0, 0)][DBLP] PDPTA, 2006, pp:253-259 [Conf]
- Keiichi Kaneko
Routing Problems in Incomplete Rotator Graphs. [Citation Graph (0, 0)][DBLP] PDPTA, 2006, pp:778-784 [Conf]
- Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
Node-disjoint Paths in a Transposition Graph. [Citation Graph (0, 0)][DBLP] PDPTA, 2004, pp:298-304 [Conf]
- Keiichi Kaneko, Yasuto Suzuki
Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. [Citation Graph (0, 0)][DBLP] PRDC, 2004, pp:173-182 [Conf]
- Keiichi Kaneko
Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. [Citation Graph (0, 0)][DBLP] SNPD, 2003, pp:285-292 [Conf]
- Keiichi Kaneko
Routing Problems in Incomplete Pancake Graphs. [Citation Graph (0, 0)][DBLP] SNPD, 2006, pp:151-156 [Conf]
- Yasuto Suzuki, Keiichi Kaneko
An algorithm for disjoint paths in bubble-sort graphs. [Citation Graph (0, 0)][DBLP] Systems and Computers in Japan, 2006, v:37, n:12, pp:27-32 [Journal]
- Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. [Citation Graph (0, 0)][DBLP] ISCA PDCS, 2007, pp:200-205 [Conf]
- Satoko Amemiya, Kazunori Hasegawa, Keiichi Kaneko, Haruko Miyakoda, Wataru Tsukahara
Long-term Memory of Foreign-word Learning by Short Movies for iPods. [Citation Graph (0, 0)][DBLP] ICALT, 2007, pp:561-563 [Conf]
- Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa
A Web-based Visual Simulator with Communication Support and its Application to Computer Architecture Education. [Citation Graph (0, 0)][DBLP] ICALT, 2007, pp:147-151 [Conf]
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. [Citation Graph (, )][DBLP]
Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs. [Citation Graph (, )][DBLP]
Design and Management of Material Sharing System for Ubiquitous Vocabulary Learning. [Citation Graph (, )][DBLP]
Node-to-Set Disjoint Paths Routing in Dual-Cube. [Citation Graph (, )][DBLP]
Computing the Diameters of 14- and 15-Pancake Graphs. [Citation Graph (, )][DBLP]
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. [Citation Graph (, )][DBLP]
Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation. [Citation Graph (, )][DBLP]
Pairwise Disjoint Paths in Pancake Graphs. [Citation Graph (, )][DBLP]
Set-to-Set Disjoint Paths Routing in Dual-Cubes. [Citation Graph (, )][DBLP]
Node-to-Set Disjoint-path Routing in Metacube. [Citation Graph (, )][DBLP]
An (n, k)-Pancake Graph and its Properties. [Citation Graph (, )][DBLP]
A New Configuration of an Incomplete Star Graph and its Routing Algorithm. [Citation Graph (, )][DBLP]
A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs. [Citation Graph (, )][DBLP]
LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments. [Citation Graph (, )][DBLP]
New Approaches for Software Watermarking by Register Allocation. [Citation Graph (, )][DBLP]
Design of a web-based visual simulator and its evaluation based on real computer education. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.303secs
|