( en | de | ru )

 

Disambiguation of "Kaneko, Keiichi"

Author of the publication

copydeleteadd this publication to your clipboard
LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments.

, , and . PRDC, page 23-. IEEE Computer Society, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Keiichi Kato

Tanja Kaneko

Gaël Kaneko

Kiosuke Kaneko

Keiichi Omoto

 

Other publications of authors with the same name

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs., , and . CATA, page 21-26. ISCA, (2011)A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs., and . PDPTA, page 307-313. CSREA Press, (2009)On Solving the Container Problem in a Hypercube with Bit Constraint., and . SNPD (revised selected papers), volume 612 of Studies in Computational Intelligence, page 77-92. Springer, (2015)A support system for probability learning based on scaffolding approach., , and . ITI, page 205-210. IEEE, (2013)Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes., , and . ICA3PP (1), volume 6081 of Lecture Notes in Computer Science, page 511-519. Springer, (2010)Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs., , , and . ICA3PP (2), volume 6082 of Lecture Notes in Computer Science, page 264-274. Springer, (2010)Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems., and . ICA3PP (2), volume 8286 of Lecture Notes in Computer Science, page 11-21. Springer, (2013)Torus Pairwise Disjoint-Path Routing., and . Sensors, 18 (11): 3912 (2018)An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs.. IEICE Trans. Inf. Syst., 89-D (2): 647-653 (2006)A routing algorithm of pairwise disjoint paths in a burnt pancake graph., and . SoICT, page 62-66. ACM, (2011)