Antoine Bossard

J. Softw., November, 2023

Torus-Connected Toroids: An Efficient Topology for Interconnection Networks.

[BibT_eX]

[DOI]

Comput., August, 2023

On the Crossing Number of a Torus Network.

[BibT_eX]

[DOI]

Frederick C. Harris Jr.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023

2022

The SOF Programming Paradigm: A Sequence of Pure Functions.

[BibT_eX]

[DOI]

Int. J. Softw. Innov., 2022

On the Automatised Generation of a Japanese Banduke Table.

[BibT_eX]

[DOI]

Balt. J. Mod. Comput., 2022

Set-to-Set Disjoint Path Routing in Bijective Connection Graphs.

[BibT_eX]

[DOI]

Frederick C. Harris Jr.

IEEE Access, 2022

Topological properties of a 2-dimensional torus-connected cycles network.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Computer and Communications Management, 2022

On the Automatisation of the Realisation of a Banduke Table.

[BibT_eX]

[DOI]

Proceedings of the Digital Business and Intelligent Systems, 2022

2021

On Solving the Decycling Problem in a Torus Network.

[BibT_eX]

[DOI]

Wirel. Commun. Mob. Comput., 2021

On Bridging the Gap Between Far Eastern Cultures and the User Interface.

[BibT_eX]

[DOI]

Proceedings of the Trends and Applications in Information Systems and Technologies, 2021

On the Erdős-Sós Conjecture for Stars, Paths and Some of Their Variants.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE/ACIS International Conference on Computer and Information Science, 2021

2020

Cluster-Fault Tolerant Routing in a Torus.

[BibT_eX]

[DOI]

Sensors, 2020

On the Decycling Problem in a Torus.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures, Algorithms and Programming, 2020

2019

A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual SIG Conference on Information Technology Education, 2019

UCEJ Database Refinement and Applicability Proof.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Multimedia, 2019

Refining the Unrestricted Character Encoding for Japanese.

[BibT_eX]

[DOI]

Proceedings of 34th International Conference on Computers and Their Applications, 2019

2018

Torus Pairwise Disjoint-Path Routing.

[BibT_eX]

[DOI]

Sensors, 2018

On the Torus Pairwise Disjoint-Path Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, 2018

Unrestricted Character Encoding for Japanese.

[BibT_eX]

[DOI]

Proceedings of the Databases and Information Systems X, 2018

Proposal of an Unrestricted Character Encoding for Japanese.

[BibT_eX]

[DOI]

Proceedings of the Databases and Information Systems, 2018

2017

A Set-to-Set Disjoint Paths Routing Algorithm in Tori.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2017

Automatic Segmentation of Chinese Characters as Wire-Frame Models.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2017

High-Performance Graphics in Racket with DirectX.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2017

2016

Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2016

Set-to-Set Disjoint Paths in Tori.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015

A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint.

[BibT_eX]

[DOI]

Int. J. Networked Distributed Comput., 2015

Hypercube Fault Tolerant Routing with Bit Constraint.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2015

Node-to-set disjoint paths routing in a metacube.

[BibT_eX]

[DOI]

Int. J. High Perform. Comput. Netw., 2015

Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks.

[BibT_eX]

[DOI]

Int. J. Appl. Math. Comput. Sci., 2015

On Solving the Container Problem in a Hypercube with Bit Constraint.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering, 2015

Premises of an algebra of Japanese characters.

[BibT_eX]

[DOI]

Proceedings of the Eighth International C* Conference on Computer Science & Software Engineering, 2015

2014

k-pairwise disjoint paths routing in perfect hierarchical hypercubes.

[BibT_eX]

[DOI]

J. Supercomput., 2014

The decycling problem in hierarchical cubic networks.

[BibT_eX]

[DOI]

J. Supercomput., 2014

Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2014

Reconstruction and Auto-correction of Artificial Capillary with Flow Directions from Ultrasound Volume Data.

[BibT_eX]

Int. J. Comput. Their Appl., 2014

Japanese Characters Cartography for Efficient Memorization.

[BibT_eX]

Int. J. Comput. Their Appl., 2014

A Set-to-set Disjoint Paths Routing Algorithm in Hyper-star Graphs.

[BibT_eX]

Int. J. Comput. Their Appl., 2014

Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks.

[BibT_eX]

[DOI]

Comput. J., 2014

Analysis of the Poisson Distribution Applicability to the Japanese Seismic Activity.

[BibT_eX]

[DOI]

Proceedings of the IIAI 3rd International Conference on Advanced Applied Informatics, 2014

The Container Problem in a Torus-connected Cycles Network.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2014

On Hypercube Routing and Fault Tolerance with Bit Constraint.

[BibT_eX]

[DOI]

Proceedings of the Second International Symposium on Computing and Networking, 2014

2013

On the Decycling Problem in Hierarchical Hypercubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2013

Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2013

Reconstruction and error detection of blood vessel network from ultrasound volume data.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Symposium on Computer-Based Medical Systems, 2013

2012

Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks.

[BibT_eX]

[DOI]

Comput. J., 2012

The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 2012

Supporting reconstruction of the blood vessel network using graph theory: An abstraction method.

[BibT_eX]

[DOI]

Toshikazu Kato

Kohji Masuda

Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

2011

Node-to-set disjoint-path routing in perfect hierarchical hypercubes.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2011

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 2011

A Multilingual Chat System with Image Presentation for Detecting Mistranslation.

[BibT_eX]

[DOI]

J. Comput. Inf. Technol., 2011

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs.

[BibT_eX]

Nagateru Iwasawa

Proceedings of the ISCA 26th International Conference on Computers and Their Applications, 2011

Set-to-set disjoint-path routing in perfect hierarchical hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Fourth International C* Conference on Computer Science & Software Engineering, 2011

2010

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

2009

Node-to-Set Disjoint-path Routing in Metacube.

[BibT_eX]

[DOI]

Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

A Node-to-Set Disjoint-Path Routing Algorithm in Metacube.

[BibT_eX]

[DOI]