![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Zhizhang Shen
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j46]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen
, Abhishek Vangipuram:
On the g-extra connectivity of augmented cubes. Theor. Comput. Sci. 970: 114059 (2023) - [c33]Eddie Cheng, Ethan Gibbons, Ke Qiu, Zhizhang Shen:
Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks. ICPADS 2023: 138-145 - 2022
- [j45]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen
:
A Note on Linearly Many Faults of Interconnection Networks. J. Interconnect. Networks 22(1): 2142017:1-2142017:6 (2022) - [j44]Eddie Cheng, Yaping Mao
, Ke Qiu, Zhizhang Shen
:
A general approach to deriving diagnosability results of interconnection networks. Int. J. Parallel Emergent Distributed Syst. 37(4): 369-397 (2022) - [j43]Eddie Cheng, Ke Qiu, Zhizhang Shen
:
On the g-extra diagnosability of enhanced hypercubes. Theor. Comput. Sci. 921: 6-19 (2022) - [i1]Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen
:
A general approach to deriving diagnosability results of interconnection networks. CoRR abs/2205.01631 (2022) - 2020
- [j42]Eddie Cheng, Ke Qiu, Zhizhang Shen
:
The g-extra diagnosability of the generalized exchanged hypercube. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 112-123 (2020) - [j41]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Preface. Int. J. Parallel Emergent Distributed Syst. 35(1): 1 (2020) - [j40]Eddie Cheng, Ke Qiu, Zhizhang Shen
:
Diagnosability of interconnection networks: past, present and future. Int. J. Parallel Emergent Distributed Syst. 35(1): 2-8 (2020) - [j39]Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
Preface. Parallel Process. Lett. 30(3): 2002001:1 (2020) - [j38]Eddie Cheng
, Ke Qiu, Zhizhang Shen
, Weihua Yang:
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. Parallel Process. Lett. 30(3): 2040009:1-2040009:14 (2020)
2010 – 2019
- 2019
- [j37]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. Theor. Comput. Sci. 757: 56-67 (2019) - [p1]Eddie Cheng, Rong-Xia Hao, Ke Qiu, Zhizhang Shen:
Structural Properties and Fault Resiliency of Interconnection Networks. From Parallel to Emergent Computing 2019: 77-102 - 2017
- [j36]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A strong connectivity property of the generalized exchanged hypercube. Discret. Appl. Math. 216: 529-536 (2017) - [j35]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
Diagnosability problems of the exchanged hypercube and its generalization. Int. J. Comput. Math. Comput. Syst. Theory 2(2): 39-52 (2017) - [j34]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On Diagnosability of Interconnection Networks. Int. J. Unconv. Comput. 13(3): 245-251 (2017) - [j33]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On the restricted connectivity of the arrangement graph. J. Supercomput. 73(8): 3669-3682 (2017) - [c32]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A Study of the Decycling Problem for the Generalized Exchanged Hypercube. ISPAN-FCST-ISCC 2017: 93-99 - 2016
- [j32]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
Length two path centered surface areas of the (n, k)-star graph. Inf. Sci. 332: 115-130 (2016) - [j31]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks. Parallel Process. Lett. 26(1): 1650005:1-1650005:18 (2016) - 2015
- [j30]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults. J. Interconnect. Networks 15(1-2): 1550007:1-1550007:23 (2015) - 2014
- [j29]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Surface Areas of the Alternating Group Graph and the Split-Star Graph. Ars Comb. 115: 239-260 (2014) - [j28]Eddie Cheng, Ke Qiu, Zhizhang Shen
:
The number of shortest paths in the (n, k)-star graph. Discret. Math. Algorithms Appl. 6(4) (2014) - [j27]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
Length two path-centred surface areas for the arrangement graph. Int. J. Comput. Math. 91(6): 1170-1189 (2014) - [j26]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
The edge-centered surface area of the arrangement graph. J. Comb. Optim. 27(1): 49-64 (2014) - [j25]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On the conditional diagnosability of matching composition networks. Theor. Comput. Sci. 557: 101-114 (2014) - [j24]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
Deriving length two path centered surface area for the arrangement graph: a generating function approach. J. Supercomput. 68(3): 1241-1264 (2014) - [c31]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults. CSE 2014: 1213-1220 - 2013
- [j23]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs. Comput. J. 56(7): 871-881 (2013) - [j22]Eddie Cheng
, László Lipták, Ke Qiu, Zhizhang Shen
:
Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. Graphs Comb. 29(4): 835-841 (2013) - [j21]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Faster Algorithm for Finding Disjoint Ordering of Sets. Int. J. Netw. Comput. 3(2): 182-191 (2013) - [j20]Eddie Cheng
, Jerrold W. Grossman, Ke Qiu, Zhizhang Shen
:
The number of shortest paths in the arrangement graph. Inf. Sci. 240: 191-204 (2013) - 2012
- [j19]Eddie Cheng
, László Lipták, Ke Qiu, Zhizhang Shen
:
On deriving conditional diagnosability of interconnection networks. Inf. Process. Lett. 112(17-18): 674-677 (2012) - [j18]Eddie Cheng
, László Lipták, Ke Qiu, Zhizhang Shen
:
A Unified Approach to the Conditional Diagnosability of Interconnection Networks. J. Interconnect. Networks 13(3-4) (2012) - [j17]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A note on the alternating group network. J. Supercomput. 59(1): 246-248 (2012) - [j16]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On the surface area of the augmented cubes. J. Supercomput. 61(3): 856-868 (2012) - [c30]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
The Edge-Centered Surface Area of the Arrangement Graph. COCOA 2012: 49-60 - [c29]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A Faster Algorithm for Finding Disjoint Ordering of Sets. ICNC 2012: 118-124 - 2011
- [j15]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On the Surface Areas and Average Distances of Meshes and Tori. Parallel Process. Lett. 21(1): 61-75 (2011) - [c28]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On the Surface Area of the Asymmetric Twisted Cube. COCOA 2011: 411-423 - 2010
- [j14]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. Int. J. Comput. Math. 87(13): 2903-2914 (2010) - [j13]Eddie Cheng
, Jerrold W. Grossman, László Lipták, Ke Qiu, Zhizhang Shen
:
Distance formula and shortest paths for the (n, k)-star graphs. Inf. Sci. 180(9): 1671-1680 (2010) - [c27]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
The Number of Shortest Paths in the (n, k)-Star Graphs. COCOA (1) 2010: 222-236
2000 – 2009
- 2009
- [j12]Eddie Cheng, Ke Qiu, Zhizhang Shen
:
A Generating Function Approach to the Surface Areas of Some Interconnection Networks. J. Interconnect. Networks 10(3): 189-204 (2009) - [j11]Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
A short note on the surface area of star graphs. Parallel Process. Lett. 19(1): 19-22 (2009) - [j10]Zhizhang Shen
, Ke Qiu, Eddie Cheng
:
On the surface area of the (n, k)-star graph. Theor. Comput. Sci. 410(52): 5481-5490 (2009) - [c26]Eddie Cheng
, Shuhong Gao, Ke Qiu, Zhizhang Shen
:
On Disjoint Shortest Paths Routing on the Hypercube. COCOA 2009: 375-383 - 2008
- [j9]Zhizhang Shen
, Ke Qiu:
On the Whitney numbers of the second kind for the star poset. Eur. J. Comb. 29(7): 1585-1586 (2008) - [c25]Zhizhang Shen
, Ke Qiu, Eddie Cheng
:
On the Surface Area of the (n, k)-Star Graph. COCOA 2008: 393-404 - [c24]L. He, Ke Qiu, Zhizhang Shen
:
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph. ICA3PP 2008: 70-78 - 2007
- [j8]Zhizhang Shen
:
A generalized broadcasting schema for the mesh structures. Appl. Math. Comput. 186(2): 1293-1310 (2007) - [c23]Zhizhang Shen, Ke Qiu:
On the effective paths for the general tori. PDCS 2007: 230-235 - [c22]Zhizhang Shen, Ke Qiu:
On the vertex disjoint effective path for the general tori. PDCS 2007: 236-241 - 2006
- [j7]Zhizhang Shen
:
A bypassing path based routing algorithm for the pyramid structures. Appl. Math. Comput. 181(2): 1523-1543 (2006) - [c21]Zhizhang Shen:
On the Number of Spanning Trees in a Mesh Structure. PDCS 2006: 1-6 - [c20]Zhizhang Shen:
A Generalized Broadcasting Schema for the Mesh Structures. CATA 2006: 270-275 - 2005
- [j6]Zhizhang Shen
:
A study of a generalization of a card problem. Appl. Math. Comput. 166(2): 385-410 (2005) - [j5]Zhizhang Shen
:
The impact of the apex node on routing inside a pyramid structure. Appl. Math. Comput. 169(1): 157-178 (2005) - [c19]Jonathan W. Berry, Daniel Hrozencik, Shrisha Rao, Zhizhang Shen:
Finding Median Set of Tree Structures in Synchronous Distributed Systems. CATA 2005: 7-12 - [c18]Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang:
Integer Programming Methods for Several Optimization Problems in Graph Theory. CATA 2005: 50-55 - 2004
- [j4]Zhizhang Shen
:
Minimal broadcasting schemas for the mesh structures. Int. J. High Perform. Comput. Netw. 2(2/3/4): 210-221 (2004) - [c17]Jonathan W. Berry, Daniel Hrozencik, Shrisha Rao, Zhizhang Shen:
Finding Central Sets of Tree Structures in Synchronous Distributed Systems. PDCS 2004: 201-208 - [c16]Zhizhang Shen, Timothy Healy:
A Study of a Generalization of a Card Problem. CATA 2004: 55-58 - [c15]Zhizhang Shen:
Alleviation of the Impact of the Apex Nodes on Routing in the Pyramid Structures. CATA 2004: 168-171 - 2003
- [c14]Zhizhang Shen
:
An Alternative Routing Algorithm for the Pyramid Structures. SAC 2003: 1009-1013 - [c13]Zhizhang Shen:
An Optimal Broadcasting Schema for Multidimensional Mesh Structures. SAC 2003: 1019-1023 - 2002
- [c12]Zhizhang Shen:
An Optimal Broadcasting Schema for Mesh Structures. CATA 2002: 273-276 - [c11]Zhizhang Shen:
An Alternative Routing Algorithm for the Pyramid Structures. CATA 2002: 487-490 - 2001
- [c10]Zhizhang Shen
:
A routing algorithm for the pyramid structures. SAC 2001: 484-488 - 2000
- [c9]Zhizhang Shen
:
The Calculation of Average Distance in Mesh Structures. SAC (1) 2000: 89-93
1990 – 1999
- 1999
- [c8]Zhizhang Shen
:
Average Diameter and Its Estimation in Non-Linear Structures. SAC 1999: 489-490 - 1998
- [c7]Zhizhang Shen
:
Average diameter of network structures and its estimation. SAC 1998: 593-597 - 1997
- [j3]Zhizhang Shen:
Correcting an Error in a 'Cheat Sheet'. SIGACT News 28(1): 49 (1997) - [c6]Zhizhang Shen
:
The average diameter of binary tree structures. SAC 1997: 40-44 - 1996
- [c5]Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen
:
On quantitative measurement of negation in logic programming. SAC 1996: 58-62 - 1995
- [j2]Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen:
The Essential Inadequacy of Deduction in Logic Programming. Log. J. IGPL 3(1): 107-110 (1995) - [c4]Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen
:
An alternative transformation rule for logic programs. SAC 1995: 364-368 - 1994
- [c3]Howard C. Wasserman, Zhizhang Shen
:
The locality principle and completeness in logic programming. SAC 1994: 286-291 - 1993
- [j1]Zhizhang Shen
:
Static Behavior Analysis of a Mesh System. Inf. Process. Lett. 47(6): 295-299 (1993) - [c2]Zhizhang Shen
, Peter G. Drexel, Liam Urbach:
Packet Delay Prediction in Datagram Mesh Systems. SAC 1993: 539-545 - [c1]Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen:
The Essential Inadequacy of Deductions in Logic Programming. ILPS 1993: 644
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint