Jimmy Jiann-Mean Tan
According to our database1,
Jimmy Jiann-Mean Tan
authored at least 110 papers
between 1989 and 2016.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2016
IEEE Trans. Parallel Distributed Syst., 2016
2015
Conditional Matching Preclusion For The Star Graphs.
Ars Comb., 2015
2014
IEEE Trans. Parallel Distributed Syst., 2014
Inf. Sci., 2014
Inf. Sci., 2014
Conditional Fault Hamiltonicity of the Star Graph.
Ars Comb., 2014
2013
Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model.
IEEE Trans. Reliab., 2013
An Algorithmic Approach to Conditional-Fault Local Diagnosis of Regular Multiprocessor Interconnected Systems under the PMC Model.
IEEE Trans. Computers, 2013
4-ordered-Hamiltonian problems of the generalized Petersen graph <i>GP</i>(<i>n</i>, 4).
Math. Comput. Model., 2013
Discret. Appl. Math., 2013
Appl. Math. Comput., 2013
2012
The paths embedding of the arrangement graphs with prescribed vertices in given position.
J. Comb. Optim., 2012
Mutually Independent Hamiltonian Cycles in Some Graphs.
Ars Comb., 2012
Super Spanning Connectivity of Augmented Cubes.
Ars Comb., 2012
Appl. Math. Comput., 2012
Identifying Restricted-Faults in Multiprocessor Meshes under the PMC Diagnostic Model.
Proceedings of the Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2012
2011
Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model.
IEEE Trans. Parallel Distributed Syst., 2011
Int. J. Comput. Math., 2011
Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011
2010
J. Supercomput., 2010
J. Interconnect. Networks, 2010
J. Interconnect. Networks, 2010
J. Interconnect. Networks, 2010
Int. J. Comput. Math., 2010
Appl. Math. Lett., 2010
Two Spanning Disjoint Paths with Required Length in Arrangement Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010
The Diagnosability of g-good-neighbor Conditional-Faulty Hypercube under PMC Model.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010
On the faulty sensor identification algorithm of wireless sensor networks under the PMC diagnosis model.
Proceedings of the International Conference on Networked Computing and Advanced Information Management, 2010
2009
The super spanning connectivity and super spanning laceability of the enhanced hypercubes.
J. Supercomput., 2009
Using Node Diagnosability to Determine t-Diagnosability under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2009
Parallel Comput., 2009
J. Syst. Archit., 2009
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transposition Trees.
J. Interconnect. Networks, 2009
Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks.
J. Interconnect. Networks, 2009
J. Interconnect. Networks, 2009
J. Interconnect. Networks, 2009
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges.
J. Comb. Optim., 2009
Inf. Process. Lett., 2009
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks.
Int. J. Comput. Math., 2009
Discret. Math., 2009
Comput. Math. Appl., 2009
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position.
Comput. Math. Appl., 2009
Proceedings of the Sixth International Conference on Information Technology: New Generations, 2009
Proceedings of the 10th International Symposium on Pervasive Systems, 2009
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009
2008
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.
J. Interconnect. Networks, 2008
Strong Menger connectivity with conditional faults on the class of hypercube-like networks.
Inf. Process. Lett., 2008
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position.
Inf. Process. Lett., 2008
Appl. Math. Comput., 2008
Appl. Math. Comput., 2008
Comparison-Based Diagnosis on Incomplete Star Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008
Proceedings of the 9th International Symposium on Parallel Architectures, 2008
Proceedings of the 9th International Symposium on Parallel Architectures, 2008
2007
IEEE Trans. Parallel Distributed Syst., 2007
Theor. Comput. Sci., 2007
J. Parallel Distributed Comput., 2007
Inf. Sci., 2007
Appl. Math. Comput., 2007
2006
Appl. Math. Comput., 2006
2005
IEEE Trans. Computers, 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Cycles in Highly Faulty Hypercubes.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005
2004
The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2004
IEEE Trans. Computers, 2004
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2004
Inf. Process. Lett., 2004
Proceedings of the 7th International Symposium on Parallel Architectures, 2004
2003
Networks, 2003
Inf. Process. Lett., 2003
Appl. Math. Comput., 2003
2002
J. Interconnect. Networks, 2002
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002
2001
2000
1995
1991
A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching.
J. Algorithms, 1991
1990
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990
1989
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989