default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCheng-Nan Lai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Cheng-Nan Lai:
Optimal node-disjoint paths in folded hypercubes. J. Parallel Distributed Comput. 147: 100-107 (2021)
2010 – 2019
- 2017
- [j12]Cheng-Nan Lai:
Optimal construction of node-disjoint shortest paths in folded hypercubes. J. Parallel Distributed Comput. 102: 37-41 (2017) - 2016
- [j11]Cheng-Nan Lai:
On the construction of all shortest node-disjoint paths in star networks. Inf. Process. Lett. 116(4): 299-303 (2016) - 2015
- [j10]Cheng-Nan Lai:
Constructing all shortest node-disjoint paths in torus networks. J. Parallel Distributed Comput. 75: 123-132 (2015) - [j9]Cheng-Nan Lai:
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups. Theor. Comput. Sci. 571: 10-20 (2015) - 2014
- [j8]Cheng-Nan Lai:
An efficient construction of one-to-many node-disjoint paths in folded hypercubes. J. Parallel Distributed Comput. 74(4): 2310-2316 (2014) - [c2]Cheng-Nan Lai:
On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups. ICS 2014: 92-103 - 2013
- [j7]Dyi-Rong Duh, Yao-Chung Lin, Cheng-Nan Lai, Yue-Li Wang:
Two spanning disjoint paths with required length in generalized hypercubes. Theor. Comput. Sci. 506: 55-78 (2013) - 2012
- [j6]Cheng-Nan Lai:
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes. Theor. Comput. Sci. 418: 82-91 (2012) - [j5]Cheng-Nan Lai:
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications. IEEE Trans. Parallel Distributed Syst. 23(6): 1129-1134 (2012) - 2010
- [j4]Geng-Cyuan Jheng, Dyi-Rong Duh, Cheng-Nan Lai:
Real-time reconfigurable cache for low-power embedded systems. Int. J. Embed. Syst. 4(3/4): 235-247 (2010)
2000 – 2009
- 2008
- [j3]Cheng-Nan Lai, Gen-Huey Chen:
w-Rabin numbers and strong w-Rabin numbers of folded hypercubes. Networks 51(3): 171-177 (2008) - 2005
- [j2]Cheng-Nan Lai, Gen-Huey Chen:
Strong Rabin numbers of folded hypercubes. Theor. Comput. Sci. 341(1-3): 196-215 (2005) - 2002
- [j1]Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh:
Constructing One-to-Many Disjoint Paths in Folded Hypercubes. IEEE Trans. Computers 51(1): 33-45 (2002) - 2000
- [c1]Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh:
Optimal One-to-Many Disjoint Paths in Folded Hypercubes. ISPAN 2000: 148-155
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
