Cheng-Nan Lai

14 papers A 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2021 J jnl
Optimal node-disjoint paths in folded hypercubes.
J. Parallel Distributed Comput.
Cheng-Nan Lai
2017 J jnl
Optimal construction of node-disjoint shortest paths in folded hypercubes.
J. Parallel Distributed Comput.
Cheng-Nan Lai
2016 J jnl
On the construction of all shortest node-disjoint paths in star networks.
Inf. Process. Lett.
Cheng-Nan Lai
2015 J jnl
Constructing all shortest node-disjoint paths in torus networks.
J. Parallel Distributed Comput.
Cheng-Nan Lai
2015 J jnl
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups.
Theor. Comput. Sci.
Cheng-Nan Lai
2014 J jnl
An efficient construction of one-to-many node-disjoint paths in folded hypercubes.
J. Parallel Distributed Comput.
Cheng-Nan Lai
2014 A conf
On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups.
ICS
Cheng-Nan Lai
2013 J jnl
Two spanning disjoint paths with required length in generalized hypercubes.
Theor. Comput. Sci.
Dyi-Rong Duh, Yao-Chung Lin, Cheng-Nan Lai, Yue-Li Wang
2012 J jnl
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications.
IEEE Trans. Parallel Distributed Syst.
Cheng-Nan Lai
2012 J jnl
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes.
Theor. Comput. Sci.
Cheng-Nan Lai
2010 J jnl
Real-time reconfigurable cache for low-power embedded systems.
Int. J. Embed. Syst.
Geng-Cyuan Jheng, Dyi-Rong Duh, Cheng-Nan Lai
2005 J jnl
Strong Rabin numbers of folded hypercubes.
Theor. Comput. Sci.
Cheng-Nan Lai, Gen-Huey Chen
2002 J jnl
Constructing One-to-Many Disjoint Paths in Folded Hypercubes.
IEEE Trans. Computers
Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh
2000 — conf
Optimal One-to-Many Disjoint Paths in Folded Hypercubes.
ISPAN
Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh