Zhizhang Shen

Theor. Comput. Sci., 2022

A general approach to deriving diagnosability results of interconnection networks.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2022

A Note on Linearly Many Faults of Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2022

2020

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2020

Preface.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2020

Diagnosability of interconnection networks: past, present and future.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2020

Preface.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2020

The g-extra diagnosability of the generalized exchanged hypercube.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2020

2019

A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Structural Properties and Fault Resiliency of Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019

2017

On the restricted connectivity of the arrangement graph.

[BibT_eX]

[DOI]

J. Supercomput., 2017

On Diagnosability of Interconnection Networks.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2017

Diagnosability problems of the exchanged hypercube and its generalization.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2017

A strong connectivity property of the generalized exchanged hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

A Study of the Decycling Problem for the Generalized Exchanged Hypercube.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

2016

On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2016

Length two path centered surface areas of the (n, k)-star graph.

[BibT_eX]

[DOI]

Inf. Sci., 2016

2015

Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2015

2014

Deriving length two path centered surface area for the arrangement graph: a generating function approach.

[BibT_eX]

[DOI]

J. Supercomput., 2014

On the conditional diagnosability of matching composition networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

The edge-centered surface area of the arrangement graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Length two path-centred surface areas for the arrangement graph.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

The number of shortest paths in the (n, k)-star graph.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2014

On the Surface Areas of the Alternating Group Graph and the Split-Star Graph.

[BibT_eX]

Ars Comb., 2014

Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013

The number of shortest paths in the arrangement graph.

[BibT_eX]

[DOI]

Inf. Sci., 2013

A Faster Algorithm for Finding Disjoint Ordering of Sets.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2013

Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees.

[BibT_eX]

[DOI]

Graphs Comb., 2013

A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs.

[BibT_eX]

[DOI]

Comput. J., 2013

2012

On the surface area of the augmented cubes.

[BibT_eX]

[DOI]

J. Supercomput., 2012

A note on the alternating group network.

[BibT_eX]

[DOI]

J. Supercomput., 2012

A Unified Approach to the Conditional Diagnosability of Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2012

On deriving conditional diagnosability of interconnection networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

2011

On the Surface Areas and Average Distances of Meshes and Tori.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2011

On the Surface Area of the Asymmetric Twisted Cube.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Distance formula and shortest paths for the (n, k)-star graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2010

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

The Number of Shortest Paths in the (n, k)-Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

On the surface area of the (n, k)-star graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A short note on the surface area of star graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

A Generating Function Approach to the Surface Areas of Some Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

On Disjoint Shortest Paths Routing on the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

On the Whitney numbers of the second kind for the star poset.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph.

[BibT_eX]

[DOI]

L. He

Proceedings of the Algorithms and Architectures for Parallel Processing, 2008

2007

A generalized broadcasting schema for the mesh structures.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2007

On the vertex disjoint effective path for the general tori.

[BibT_eX]

Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

On the effective paths for the general tori.

[BibT_eX]

Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

2006

A bypassing path based routing algorithm for the pyramid structures.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2006

On the Number of Spanning Trees in a Mesh Structure.

[BibT_eX]

Proceedings of the ISCA 19th International Conference on Parallel and Distributed Computing Systems, 2006

2005

The impact of the apex node on routing inside a pyramid structure.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2005

A study of a generalization of a card problem.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2005

Integer Programming Methods for Several Optimization Problems in Graph Theory.

[BibT_eX]

Proceedings of the 20th International Conference on Computers and Their Applications, 2005

Finding Median Set of Tree Structures in Synchronous Distributed Systems.

[BibT_eX]

Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2004

Minimal broadcasting schemas for the mesh structures.

[BibT_eX]

[DOI]

Int. J. High Perform. Comput. Netw., 2004

A Study of a Generalization of a Card Problem.

[BibT_eX]

Timothy Healy

Proceedings of the 19th International Conference on Computers and Their Applications, 2004

Alleviation of the Impact of the Apex Nodes on Routing in the Pyramid Structures.

[BibT_eX]

Proceedings of the 19th International Conference on Computers and Their Applications, 2004

Finding Central Sets of Tree Structures in Synchronous Distributed Systems.

[BibT_eX]

Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003

An Optimal Broadcasting Schema for Multidimensional Mesh Structures.

[BibT_eX]

[DOI]

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

An Alternative Routing Algorithm for the Pyramid Structures.

[BibT_eX]

[DOI]

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

2002

An Optimal Broadcasting Schema for Mesh Structures.

[BibT_eX]

Proceedings of the ISCA 17th International Conference Computers and Their Applications, 2002

2001

A routing algorithm for the pyramid structures.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

2000

The Calculation of Average Distance in Mesh Structures.

[BibT_eX]

[DOI]

Proceedings of the Applied Computing 2000, 2000

1999

Average Diameter and Its Estimation in Non-Linear Structures.

[BibT_eX]

[DOI]

Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

1998

Average diameter of network structures and its estimation.

[BibT_eX]

[DOI]

Proceedings of the 1998 ACM symposium on Applied Computing, 1998

1997

Correcting an Error in a 'Cheat Sheet'.

[BibT_eX]

[DOI]

SIGACT News, 1997

The average diameter of binary tree structures.

[BibT_eX]

[DOI]

Proceedings of the 1997 ACM symposium on Applied Computing, 1997

1996

On quantitative measurement of negation in logic programming.

[BibT_eX]

[DOI]

Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1995

The Essential Inadequacy of Deduction in Logic Programming.

[BibT_eX]

[DOI]

Log. J. IGPL, 1995

An alternative transformation rule for logic programs.

[BibT_eX]

[DOI]

Proceedings of the 1995 ACM symposium on applied computing, 1995

1994

The locality principle and completeness in logic programming.

[BibT_eX]

[DOI]

Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

1993

Static Behavior Analysis of a Mesh System.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

The Essential Inadequacy of Deductions in Logic Programming.

[BibT_eX]

Proceedings of the Logic Programming, 1993

Packet Delay Prediction in Datagram Mesh Systems.

[BibT_eX]

[DOI]