Cheng-Nan Lai

According to our database1, Cheng-Nan Lai authored at least 15 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Optimal node-disjoint paths in folded hypercubes.
J. Parallel Distributed Comput., 2021

2017
Optimal construction of node-disjoint shortest paths in folded hypercubes.
J. Parallel Distributed Comput., 2017

2016
On the construction of all shortest node-disjoint paths in star networks.
Inf. Process. Lett., 2016

2015
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups.
Theor. Comput. Sci., 2015

Constructing all shortest node-disjoint paths in torus networks.
J. Parallel Distributed Comput., 2015

2014
An efficient construction of one-to-many node-disjoint paths in folded hypercubes.
J. Parallel Distributed Comput., 2014

On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups.
Proceedings of the Intelligent Systems and Applications, 2014

2013
Two spanning disjoint paths with required length in generalized hypercubes.
Theor. Comput. Sci., 2013

2012
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications.
IEEE Trans. Parallel Distributed Syst., 2012

Two conditions for reducing the maximal length of node-disjoint paths in hypercubes.
Theor. Comput. Sci., 2012

2010
Real-time reconfigurable cache for low-power embedded systems.
Int. J. Embed. Syst., 2010

2008
<i>w</i>-Rabin numbers and strong <i>w</i>-Rabin numbers of folded hypercubes.
Networks, 2008

2005
Strong Rabin numbers of folded hypercubes.
Theor. Comput. Sci., 2005

2002
Constructing One-to-Many Disjoint Paths in Folded Hypercubes.
IEEE Trans. Computers, 2002

2000
Optimal One-to-Many Disjoint Paths in Folded Hypercubes.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000


  Loading...