We stand with Ukraine

We stand with Ukraine

Yan Wang

Orcid: 0000-0003-1409-8478

Affiliations:

Soochow University, School of Computer Science and Technology, Suzhou, China

According to our database¹, Yan Wang authored at least 43 papers between 2011 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org

On csauthors.net:

Bibliography

2024

A Family of General Architectures Toward Interconnection Networks and Data Center Networks.

[BibT_eX]

[DOI]

,

,

,

,

,

IEEE/ACM Trans. Netw., October, 2024

Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength.

[BibT_eX]

[DOI]

,

,

,

Int. J. Found. Comput. Sci., April, 2024

Connectivity and diagnosability of a class of recursive networks.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Supercomput., February, 2024

Enhancing fault tolerance of balanced hypercube networks by the edge partition method.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., February, 2024

Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication.

[BibT_eX]

[DOI]

,

,

,

,

J. Supercomput., January, 2024

Reliability evaluation for a class of recursive match networks.

[BibT_eX]

[DOI]

,

,

,

,

,

Theor. Comput. Sci., January, 2024

Fault tolerance of recursive match networks based on <i>g</i>-good-neighbor fault pattern.

[BibT_eX]

[DOI]

,

,

,

,

,

Appl. Math. Comput., January, 2024

High fault-tolerant performance of the divide-and-swap cube network.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., 2024

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2024

Strongly Menger Connectedness of a Class of Recursive Networks.

[BibT_eX]

[DOI]

,

,

,

,

Comput. J., 2024

Super Structure Fault-Tolerance Assessment of the Generalized Hypercube.

[BibT_eX]

[DOI]

,

,

,

Comput. J., 2024

2023

Edge-independent spanning trees in folded crossed cubes.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., August, 2023

Relationship Between Component Connectivity And Component Diagnosability Of Some Regular Networks.

[BibT_eX]

[DOI]

,

,

,

,

Comput. J., August, 2023

Hamiltonian Properties of the Data Center Network HSDC with Faulty Elements.

[BibT_eX]

[DOI]

,

,

,

,

Comput. J., August, 2023

Embedding hierarchical folded cubes into linear arrays and complete binary trees with minimum wirelength.

[BibT_eX]

[DOI]

,

,

,

J. Supercomput., July, 2023

Probabilistic Fault Diagnosis of Clustered Faults for Multiprocessor Systems.

[BibT_eX]

[DOI]

,

,

,

,

J. Comput. Sci. Technol., July, 2023

Reliability of Augmented 3-Ary n-Cubes with Extra Faults.

[BibT_eX]

[DOI]

,

,

,

,

J. Interconnect. Networks, June, 2023

The <i>t</i>/<i>m</i>-diagnosis strategy of augmented <i>k</i>-ary <i>n</i>-cubes.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., February, 2023

Reliability evaluation of complete graph-based recursive networks.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., 2023

A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., 2023

A Cost-Driven Method for Deep-Learning-Based Hardware Trojan Detection.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Sensors, 2023

Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Algorithms and Architectures for Parallel Processing, 2023

2022

Connectivity and constructive algorithms of disjoint paths in dragonfly networks.

[BibT_eX]

[DOI]

,

,

,

,

Theor. Comput. Sci., 2022

Fault-tolerability of the hypercube and variants with faulty subcubes.

[BibT_eX]

[DOI]

,

,

,

,

J. Parallel Distributed Comput., 2022

The 3-Extra Connectivity of the Data Center Network BCube.

[BibT_eX]

[DOI]

,

,

,

,

Comput. J., 2022

Hamiltonian Properties of the Dragonfly Network.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021

Fault-Tolerant and Unicast Performances of the Data Center Network HSDC.

[BibT_eX]

[DOI]

,

,

,

,

Int. J. Parallel Program., 2021

Multiclassification of Endoscopic Colonoscopy Images Based on Deep Transfer Learning.

[BibT_eX]

[DOI]

,

,

,

,

Comput. Math. Methods Medicine, 2021

Fault-Tolerant Routing of Generalized Hypercubes under 3-Component Connectivity.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), New York City, NY, USA, September 30, 2021

Parallel Construction of Independent Spanning Trees on Folded Crossed Cubes.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 32nd IEEE International Conference on Application-specific Systems, 2021

2020

An optimized cluster storage method for real-time big data in Internet of Things.

[BibT_eX]

[DOI]

,

,

,

,

J. Supercomput., 2020

An improved algorithm to construct edge-independent spanning trees in augmented cubes.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2020

Connectivity and Routing Algorithm of the Data Center Network HSDC.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Network and Parallel Computing, 2020

Embedding Augmented Cubes into Grid Networks for Minimum Wirelength.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Algorithms and Architectures for Parallel Processing, 2020

2019

Optimally Embedding 3-Ary n-Cubes into Grids.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comput. Sci. Technol., 2019

2018

Diagnosability of the exchanged crossed cube.

[BibT_eX]

[DOI]

,

,

,

,

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

2017

Edge-independent spanning trees in augmented cubes.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2017

2013

One-to-One Disjoint Path Covers in DCell.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013

Grid-Based Real-Time Data Gathering Protocol in Wireless Sensor Network with Mobile Sink.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013

2012

An algorithm to construct independent spanning trees on parity cubes.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2012

Independent spanning trees on twisted cubes.

[BibT_eX]

[DOI]

,

,

,

J. Parallel Distributed Comput., 2012

Adaptive Diagnosis in the Locally Twisted Cube.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Fifth International Symposium on Parallel Architectures, 2012

2011

An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes.

[BibT_eX]

[DOI]

,

,

Proceedings of the Fourth International Symposium on Parallel Architectures, 2011

Loading...