default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaolei Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j56]Qianru Zhou, Hai Liu
, Baolei Cheng, Yan Wang, Yuejuan Han, Jianxi Fan:
Fault tolerance of recursive match networks based on g-good-neighbor fault pattern. Appl. Math. Comput. 461: 128318 (2024)- [j55]Yihong Wang, Baolei Cheng, Yan Wang, Jia Yu, Jianxi Fan:
Strongly Menger Connectedness of a Class of Recursive Networks. Comput. J. 67(6): 2030-2038 (2024) - [j54]Mengjie Lv, Jianxi Fan, Baolei Cheng, Jia Yu, Xiaohua Jia:
Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks. J. Parallel Distributed Comput. 183: 104761 (2024) - [j53]Qianru Zhou, Baolei Cheng, Jingya Zhou, Jia Yu, Yan Wang, Jianxi Fan:
Reliability evaluation for a class of recursive match networks. Theor. Comput. Sci. 981: 114253 (2024) - [j52]Xiaoqing Liu, Baolei Cheng, Yan Wang, Jia Yu, Jianxi Fan:
Enhancing fault tolerance of balanced hypercube networks by the edge partition method. Theor. Comput. Sci. 986: 114340 (2024) - [j51]Qianru Zhou, Jianxi Fan, Yan Wang, Baolei Cheng, Guijuan Wang:
High fault-tolerant performance of the divide-and-swap cube network. Theor. Comput. Sci. 1019: 114834 (2024) - [j50]Huanwen Zhang, Yan Wang, Jianxi Fan, Yuejuan Han, Baolei Cheng:
Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication. J. Supercomput. 80(2): 1907-1934 (2024) - [j49]Yaqian Tang, Baolei Cheng, Yan Wang, Yuejuan Han, Jia Yu, Jianxi Fan:
Connectivity and diagnosability of a class of recursive networks. J. Supercomput. 80(3): 3817-3848 (2024) - [j48]Xiaoqing Liu, Jianxi Fan, Baolei Cheng, Yan Wang, Bai Yin, Xiaohua Jia:
A Family of General Architectures Toward Interconnection Networks and Data Center Networks. IEEE/ACM Trans. Netw. 32(5): 4099-4113 (2024) - [j47]Eminjan Sabir, Jianxi Fan, Jixiang Meng, Baolei Cheng:
Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks. IEEE Trans. Reliab. 73(1): 257-269 (2024) - [i1]Xiaorui Li, Baolei Cheng, Jianxi Fan, Yan Wang, Dajin Wang:
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes. CoRR abs/2401.01585 (2024) - 2023
- [j46]Hui Dong, Jianxi Fan, Baolei Cheng, Yan Wang, Li Xu:
Hamiltonian Properties of the Data Center Network HSDC with Faulty Elements. Comput. J. 66(8): 1965-1981 (2023) - [j45]Xueli Sun, Jianxi Fan, Baolei Cheng, Jingya Zhou, Yan Wang:
Relationship Between Component Connectivity And Component Diagnosability Of Some Regular Networks. Comput. J. 66(8): 2033-2042 (2023) - [j44]Baolei Cheng, Dajin Wang, Jianxi Fan:
Independent Spanning Trees in Networks: A Survey. ACM Comput. Surv. 55(14s): 335:1-335:29 (2023) - [j43]Xueli Sun, Jianxi Fan, Baolei Cheng, Yan Wang, Li Zhang:
Probabilistic Fault Diagnosis of Clustered Faults for Multiprocessor Systems. J. Comput. Sci. Technol. 38(4): 821-833 (2023) - [j42]Xueli Sun, Jianxi Fan, Baolei Cheng, Yan Wang, Jingya Zhou:
Reliability of Augmented 3-Ary n-Cubes with Extra Faults. J. Interconnect. Networks 23(2): 2150040:1-2150040:20 (2023) - [j41]Zhiyong Pan, Baolei Cheng, Jianxi Fan, Yan Wang, Xiajing Li:
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks. Theor. Comput. Sci. 942: 33-46 (2023) - [j40]Xueli Sun, Jianxi Fan, Baolei Cheng, Yan Wang:
The t/m-diagnosis strategy of augmented k-ary n-cubes. Theor. Comput. Sci. 945: 113671 (2023) - [j39]Yihong Wang, Jianxi Fan, Yuejuan Han, Yan Wang, Baolei Cheng:
Reliability evaluation of complete graph-based recursive networks. Theor. Comput. Sci. 966-967: 114015 (2023) - [j38]Xueli Sun, Jianxi Fan, Eminjan Sabir, Baolei Cheng, Jia Yu:
Reliability of augmented k-ary n-cubes under the extra connectivity condition. J. Supercomput. 79(12): 13641-13669 (2023) - [c19]Shuai Liu, Yan Wang, Jianxi Fan, Baolei Cheng:
Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing. ICA3PP (3) 2023: 40-56 - 2022
- [j37]Yifeng Wang, Baolei Cheng, Jianxi Fan, Yu Qian, Ruofan Jiang:
An Algorithm to Construct Completely Independent Spanning Trees in Line Graphs. Comput. J. 65(12): 2979-2990 (2022) - [j36]Yi Yi, Jianxi Fan, Baolei Cheng, Yan Wang, Jia Yu:
The 3-Extra Connectivity of the Data Center Network BCube. Comput. J. 65(12): 3199-3208 (2022) - [j35]Yihong Wang, Jianxi Fan, Xueli Sun, Baolei Cheng, Yan Wang:
Fault-tolerability of the hypercube and variants with faulty subcubes. J. Parallel Distributed Comput. 167: 148-156 (2022) - [j34]Yifeng Wang, Baolei Cheng, Yu Qian, Dajin Wang:
Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks. IEEE Trans. Computers 71(5): 1194-1203 (2022) - [j33]Suying Wu, Jianxi Fan, Baolei Cheng, Jia Yu, Yan Wang:
Connectivity and constructive algorithms of disjoint paths in dragonfly networks. Theor. Comput. Sci. 922: 257-270 (2022) - [c18]Yihong Wang, Xueli Sun, Weibei Fan, Baolei Cheng, Li Xu, Jianxi Fan:
Relationship between g-extra Connectivity and g-restricted Connectivity in Networks. ICPADS 2022: 155-160 - [c17]Suying Wu, Baolei Cheng, Yan Wang, Yuejuan Han, Jianxi Fan:
Hamiltonian Properties of the Dragonfly Network. ICS 2022: 167-179 - 2021
- [j32]Xiaoyan Li, Cheng-Kuan Lin, Jianxi Fan, Xiaohua Jia, Baolei Cheng, Jingya Zhou:
Relationship Between Extra Connectivity And Component Connectivity In Networks. Comput. J. 64(1): 38-53 (2021) - [j31]Mengjie Lv, Baolei Cheng, Jianxi Fan, Xi Wang, Jingya Zhou, Jia Yu:
The Conditional Reliability Evaluation of Data Center Network BCDC. Comput. J. 64(9): 1451-1464 (2021) - [j30]Hui Dong, Jianxi Fan, Baolei Cheng, Yan Wang, Jingya Zhou:
Fault-Tolerant and Unicast Performances of the Data Center Network HSDC. Int. J. Parallel Program. 49(5): 700-714 (2021) - [j29]Xueli Sun, Jianxi Fan, Baolei Cheng, Zhao Liu, Jia Yu:
Component conditional fault tolerance of hierarchical folded cubic networks. Theor. Comput. Sci. 883: 44-58 (2021) - [j28]Guo Chen, Baolei Cheng, Dajin Wang:
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube. IEEE Trans. Parallel Distributed Syst. 32(3): 665-673 (2021) - [c16]Yu Qian, Baolei Cheng, Jianxi Fan, Yifeng Wang, Ruofan Jiang:
Edge-disjoint spanning trees in the line graph of hypercubes. ASAP 2021: 61-64 - [c15]Qingrong Bian, Baolei Cheng, Jianxi Fan, Zhiyong Pan:
Completely Independent Spanning Trees in the Line Graphs of Torus Networks. ICA3PP (3) 2021: 540-553 - [c14]Zhiyong Pan, Baolei Cheng, Jianxi Fan, Huanwen Zhang:
A Parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube. PAAP 2021: 9-13 - 2020
- [j27]Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang:
An improved algorithm to construct edge-independent spanning trees in augmented cubes. Discret. Appl. Math. 277: 55-70 (2020) - [j26]Baolei Cheng, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, Guo Chen:
Constructing Node-Independent Spanning Trees in Augmented Cubes. Fundam. Informaticae 176(2): 103-128 (2020) - [j25]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Jingya Zhou, Baolei Cheng:
Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements. J. Comput. Sci. Technol. 35(5): 1064-1083 (2020) - [j24]Mengjie Lv, Jianxi Fan, Jingya Zhou, Baolei Cheng, Xiaohua Jia:
The extra connectivity and extra diagnosability of regular interconnection networks. Theor. Comput. Sci. 809: 88-102 (2020) - [j23]Mengjie Lv, Jianxi Fan, Guo Chen, Baolei Cheng, Jingya Zhou, Jia Yu:
The reliability analysis of k-ary n-cube networks. Theor. Comput. Sci. 835: 1-14 (2020) - [j22]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Baolei Cheng, Xiaohua Jia:
A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube. IEEE Trans. Parallel Distributed Syst. 31(3): 647-662 (2020) - [c13]Jingya Zhou, Jianxi Fan, Jin Wang, Baolei Cheng:
Representation Learning on Networks for Community Detection. CBD 2020: 157-162 - [c12]Hui Dong, Jianxi Fan, Baolei Cheng, Yan Wang, Jingya Zhou:
Connectivity and Routing Algorithm of the Data Center Network HSDC. NPC 2020: 407-419
2010 – 2019
- 2019
- [j21]Guijuan Wang, Cheng-Kuan Lin, Baolei Cheng, Jianxi Fan, Weibei Fan:
Structure Fault-Tolerance of the Generalized Hypercube. Comput. J. 62(10): 1463-1476 (2019) - [j20]Jingya Zhou, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng:
A Cost-Efficient Approach to Storing Users' Data for Online Social Networks. J. Comput. Sci. Technol. 34(1): 234-252 (2019) - [j19]Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia, Xiaoyan Li:
Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme. J. Parallel Distributed Comput. 134: 104-115 (2019) - [j18]Xiaoyan Li, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Xiaohua Jia:
The extra connectivity, extra conditional diagnosability and t/k-diagnosability of the data center network DCell. Theor. Comput. Sci. 766: 16-29 (2019) - [j17]Weibei Fan, Jianxi Fan, Cheng-Kuan Lin, Guijuan Wang, Baolei Cheng, Ruchuan Wang:
An efficient algorithm for embedding exchanged hypercubes into grids. J. Supercomput. 75(2): 783-807 (2019) - [c11]Guijuan Wang, Cheng-Kuan Lin, Jianxi Fan, Baolei Cheng, Zhao Liu:
Vertex-Disjoint Paths in the Generalized Hypercube under 1-Restricted Connectivity. HPCC/SmartCity/DSS 2019: 1491-1498 - 2018
- [j16]Baolei Cheng, Jianxi Fan, Qiang Lyu, Jingya Zhou, Zhao Liu:
Constructing independent spanning trees with height n on the n-dimensional crossed cube. Future Gener. Comput. Syst. 87: 404-415 (2018) - [j15]Dongfang Zhou, Jianxi Fan, Jingya Zhou, Yan Wang, Baolei Cheng:
Diagnosability of the exchanged crossed cube. Int. J. Comput. Math. Comput. Syst. Theory 3(2): 53-63 (2018) - [j14]Jingya Zhou, Jianxi Fan, Juncheng Jia, Baolei Cheng, Zhao Liu:
Optimizing cost for geo-distributed storage systems in online social networks. J. Comput. Sci. 26: 363-374 (2018) - [c10]Baolei Cheng, Jianxi Fan, Xiaoyan Li, Guijuan Wang, Jingya Zhou, Yuejuan Han:
Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks. ICA3PP (3) 2018: 342-354 - 2017
- [j13]Jingya Zhou, Jianxi Fan, Jin Wang, Baolei Cheng, Juncheng Jia:
Towards traffic minimization for data placement in online social networks. Concurr. Comput. Pract. Exp. 29(6) (2017) - [j12]Baolei Cheng, Dajin Wang, Jianxi Fan:
Constructing completely independent spanning trees in crossed cubes. Discret. Appl. Math. 219: 100-109 (2017) - [j11]Dongfang Zhou, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Jingya Zhou, Zhao Liu:
Optimal Path Embedding in the Exchanged Crossed Cube. J. Comput. Sci. Technol. 32(3): 618-629 (2017) - [j10]Zhao Liu, Jianxi Fan, Jingya Zhou, Baolei Cheng, Xiaohua Jia:
Fault-tolerant embedding of complete binary trees in locally twisted cubes. J. Parallel Distributed Comput. 101: 69-78 (2017) - [j9]Cheng-Kuan Lin, Yuan Zhao, Jianxi Fan, Baolei Cheng:
基于顶点度数的完全独立生成树研究 (Research on Completely Independent Spanning Trees Based on Degree of Vertices). 计算机科学 44(6): 94-96 (2017) - [c9]Jingya Zhou, Jianxi Fan, Jin Wang, Xi Wang, Baolei Cheng:
Cost-Efficient Influence Maximization in Online Social Networks. CBD 2017: 232-237 - 2016
- [c8]Jingya Zhou, Jianxi Fan, Juncheng Jia, Baolei Cheng, Zhao Liu:
Location-Aware Data Placement for Geo-Distributed Online Social Networks. CBD 2016: 234-239 - [c7]Jingya Zhou, Jianxi Fan, Baolei Cheng, Juncheng Jia:
Optimizing Inter-server Communications by Exploiting Overlapping Communities in Online Social Networks. ICA3PP 2016: 231-244 - 2015
- [j8]Jin Wang, Kejie Lu, Shukui Zhang, Jianxi Fan, Yanqin Zhu, Baolei Cheng:
An efficient communication relay placement algorithm for content-centric wireless mesh networks. Int. J. Commun. Syst. 28(2): 262-280 (2015) - [j7]Baolei Cheng, Jianxi Fan, Xiaohua Jia:
Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks. IEEE Trans. Parallel Distributed Syst. 26(1): 45-53 (2015) - [c6]Baolei Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang:
A Reliable Broadcasting Algorithm in Locally Twisted Cubes. CSCloud 2015: 323-328 - [c5]Zhao Liu, Jianxi Fan, Cheng-Kuan Lin, Baolei Cheng, Jingya Zhou:
Dynamic Reconfiguration of Complete Binary Trees in Faulty Locally Twisted Cubes. MSN 2015: 243-249 - 2014
- [c4]Haifei Shen, Jianxi Fan, Baolei Cheng, Cheng-Kuan Lin:
A model based on crossed cubes for VoD services. ICSAI 2014: 659-664 - 2013
- [j6]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen:
Constructive Algorithm of Independent Spanning Trees on Möbius Cubes. Comput. J. 56(11): 1347-1362 (2013) - [j5]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang:
Independent spanning trees in crossed cubes. Inf. Sci. 233: 276-289 (2013) - [j4]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Jin Wang:
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes. J. Parallel Distributed Comput. 73(5): 641-652 (2013) - [j3]Baolei Cheng, Jianxi Fan, Xiaohua Jia, Juncheng Jia:
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes. J. Supercomput. 65(3): 1279-1301 (2013) - [c3]Xi Wang, Jianxi Fan, Baolei Cheng, Wenjun Liu, Yan Wang:
One-to-One Disjoint Path Covers in DCell. NPC 2013: 61-70 - [c2]Baolei Cheng, Jianxi Fan, Jiwen Yang, Xi Wang:
Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes. NPC 2013: 232-244 - 2012
- [c1]Yuejuan Han, Jianxi Fan, Lantao You, Baolei Cheng, Yan Wang:
Adaptive Diagnosis in the Locally Twisted Cube. PAAP 2012: 106-110 - 2011
- [j2]Jianxi Fan, Xiaohua Jia, Baolei Cheng, Jia Yu:
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges. Theor. Comput. Sci. 412(29): 3440-3450 (2011) - 2010
- [j1]Jianxi Fan, Kenli Li, Shukui Zhang, Wujun Zhou, Baolei Cheng:
One-to-one communication in twisted cubes under restricted connectivity. Frontiers Comput. Sci. China 4(4): 489-499 (2010)
Coauthor Index
[j56] [j55] [j54] [j53] [j52] [j51] [j50] [j49] [j48] [j47] [i1] [j46] [j45] [j44] [j43] [j42] [j41] [j40] [j39] [j38] [c19] [j37] [j36] [j35] [j33] [c18] [c17] [j32] [j31] [j30] [j29] [c16] [c15] [c14] [j27] [j26] [j25] [j24] [j23] [j22] [c13] [c12] [j21] [j20] [j19] [j18] [j17] [c11] [j16] [j15] [j14] [c10] [j13] [j12] [j11] [j10] [j9] [c9] [c8] [c7] [j8] [j7] [c6] [c5] [c4] [j6] [j5] [j4] [j3] [c3] [c2] [c1] [j2] [j1]
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-11-07 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
