Pao-Lien Lai

According to our database1, Pao-Lien Lai authored at least 27 papers between 2004 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes.
Parallel Process. Lett., 2022

2017
How to Systematically Embed Cycles in Balanced Hypercubes.
Int. J. Softw. Innov., 2017

2016
Systematic approaches to embed cycles in balanced hypercubes.
Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016

2015
Paths and cycles identifying vertices in twisted cubes.
Appl. Math. Comput., 2015

2013
Three Round Adaptive Diagnosis in Hierarchical Multiprocessor Systems.
IEEE Trans. Reliab., 2013

Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model.
Inf. Sci., 2013

A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube.
Appl. Math. Comput., 2013

Cycles Embedding of Twisted Cubes.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012
A Systematic Algorithm for Identifying Faults on Hypercube-Like Networks Under the Comparison Model.
IEEE Trans. Reliab., 2012

Adaptive diagnosis for torus systems under the comparison model.
Int. J. Comput. Math., 2012

Adaptive Diagnosis for Grids under the Comparison Model.
Proceedings of the 26th International Conference on Advanced Information Networking and Applications Workshops, 2012

2011
Geodesic pancyclicity of twisted cubes.
Inf. Sci., 2011

Uniform Disjoint Cycle Covers on a Hierarchical Multicomputer System.
Proceedings of the Security-Enriched Urban Computing and Smart Grid, 2011

A Systematic Algorithm for Embedding Hamiltonian Cycle in Hierarchical Crossed Cubes.
Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2010
Embedding of tori and grids into twisted cubes.
Theor. Comput. Sci., 2010

A class of hierarchical graphs as topologies for interconnection networks.
Theor. Comput. Sci., 2010

Hamiltonian Cycle Embedding in Hierarchical Crossed Cubes.
Proceedings of the 2010 International Conference on Parallel and Distributed Computing, 2010

The Existence of Two Mutually Independent Hamiltonian Cycles in Hypercube-Like Graphs.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2010

2009
Constructing the nearly shortest path in crossed cubes.
Inf. Sci., 2009

Embed Geodesic Cycles into Mobius Cubes.
Proceedings of the 2009 Pacific-Asia Conference on Circuits, Communications and Systems, 2009

Efficient Algorithms for Embedding Cycles in Augmented Cubes.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008
The two-equal-disjoint path cover problem of Matching Composition Network.
Inf. Process. Lett., 2008

2007
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes.
Inf. Process. Lett., 2007

2006
On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes.
Proceedings of the 2006 Joint Conference on Information Sciences, 2006

2005
Conditional Diagnosability Measures for Large Multiprocessor Systems.
IEEE Trans. Computers, 2005

2004
The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2004

Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2004


  Loading...