default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCheng Zhao 0001
Person information
- affiliation: Indiana State University, Department of Mathematics and Computer Sciences, Terre Haute, IN, USA
- affiliation (former): Jilin University, Institute of Mathematics, Changchun, China
- affiliation (former): University of Reading, Department of Mathematics, Whiteknights, UK
- affiliation (former): West Virginia University, Department of Mathematics, Morgantown, WV, USA
Other persons with the same name
- Cheng Zhao — disambiguation page
- Cheng Zhao 0002
![[0000-0001-8502-3233]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8502-3233")
(aka: Henry Cheng Zhao) — Microsoft, Mountain View, CA, USA (and 4 more) - Cheng Zhao 0003 — Shenzhen University, School of Biomedical Engineering, Guangdong Key Laboratory for Biomedical Measurements and Ultrasound Imaging, China
2020 – today
- 2024
[j29]Junyi Mei, Shixuan Sun, Chao Li, Cheng Xu, Cheng Chen, Yibo Liu, Jing Wang, Cheng Zhao, Xiaofeng Hou, Minyi Guo, Bingsheng He, Xiaoliang Cong:
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework. Proc. VLDB Endow. 17(8): 1788-1801 (2024)- [c4]Yupeng Tang, Ping Zhou, Wenhui Zhang, Henry Hu, Qirui Yang, Hao Xiang, Tongping Liu, Jiaxin Shan, Ruoyun Huang, Cheng Zhao, Cheng Chen, Hui Zhang, Fei Liu, Shuai Zhang, Xiaoning Ding, Jianjun Chen:
Exploring Performance and Cost Optimization with ASIC-Based CXL Memory. EuroSys 2024: 818-833 - [i1]Junyi Mei, Shixuan Sun, Chao Li, Cheng Xu, Cheng Chen, Yibo Liu, Jing Wang, Cheng Zhao, Xiaofeng Hou, Minyi Guo, Bingsheng He, Xiaoliang Cong:
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework. CoRR abs/2404.08364 (2024) - 2023
- [c3]Miaomiao Cheng, Jiujian Chen, Cheng Zhao, Cheng Chen, Yongmin Hu, Xiaoliang Cong, Liang Qin, Hexiang Lin, Ronghua Li, Guoren Wang, Shuai Zhang, Lei Zhang:
ByteGAP: A Non-continuous Distributed Graph Computing System using Persistent Memory. VLDB Workshops 2023 - 2022
- [j28]Qingsong Tang, Xiangde Zhang, Cheng Zhao, Peng Zhao:
On the maxima of motzkin-straus programs and cliques of graphs. J. Glob. Optim. 84(4): 989-1003 (2022)
2010 – 2019
- 2018
- [j27]Qingsong Tang, Xiangde Zhang, Guoren Wang, Cheng Zhao:
A continuous characterization of the maximum vertex-weighted clique in hypergraphs. J. Comb. Optim. 35(4): 1250-1260 (2018) - 2017
- [j26]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
On Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 34(2): 504-521 (2017) - 2016
- [j25]Yuejian Peng, Hao Peng, Qingsong Tang, Cheng Zhao:
An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications. Discret. Appl. Math. 200: 170-175 (2016) - [j24]Hegui Zhu, Xiangde Zhang, Hai Yu, Cheng Zhao, Zhiliang Zhu:
A Novel Image Encryption Scheme Using the Composite Discrete Chaotic System. Entropy 18(8): 276 (2016) - [j23]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
Connection between the clique number and the Lagrangian of 3-uniform hypergraphs. Optim. Lett. 10(4): 685-697 (2016) - 2015
- [j22]George He, Yuejian Peng, Cheng Zhao:
On Finding Lagrangians of 3-uniform Hypergraphs. Ars Comb. 122: 235-256 (2015) - [j21]Yuejian Peng, Qingsong Tang, Cheng Zhao:
On Lagrangians of r-uniform hypergraphs. J. Comb. Optim. 30(3): 812-825 (2015) - 2014
- [j20]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
Some results on Lagrangians of hypergraphs. Discret. Appl. Math. 166: 222-238 (2014) - [j19]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs. J. Optim. Theory Appl. 163(1): 31-56 (2014) - [j18]Yanping Sun, Qingsong Tang, Cheng Zhao, Yuejian Peng:
On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges. J. Optim. Theory Appl. 163(1): 57-79 (2014) - 2013
- [j17]Hegui Zhu, Cheng Zhao, Xiangde Zhang, Lianping Yang:
A novel iris and chaos-based random number generator. Comput. Secur. 36: 40-48 (2013) - [j16]Yuejian Peng, Cheng Zhao:
A Motzkin-Straus Type Result for 3-Uniform Hypergraphs. Graphs Comb. 29(3): 681-694 (2013) - [j15]Hegui Zhu, Cheng Zhao, Xiangde Zhang:
A novel image encryption-compression scheme using hyper-chaos and Chinese remainder theorem. Signal Process. Image Commun. 28(6): 670-680 (2013)
2000 – 2009
- 2009
- [j14]Yuejian Peng, Cheng Zhao:
On non-strong jumping numbers and density structures of hypergraphs. Discret. Math. 309(12): 3917-3929 (2009) - 2008
- [j13]Yuejian Peng, Cheng Zhao:
Generating non-jumping numbers recursively. Discret. Appl. Math. 156(10): 1856-1864 (2008) - 2007
- [j12]Jiping Liu, Yuejian Peng, Cheng Zhao:
Characterization of P6-free graphs. Discret. Appl. Math. 155(8): 1038-1043 (2007) - 2005
- [j11]Yuejian Peng, Cheng Zhao:
On incomparable and uncomplemented families of sets. Australas. J Comb. 33: 157-168 (2005) - 2004
- [c2]Yong Zhao, Cheng Zhao, Jianzhong Cha:
Individual Product Customization Based On Multi-agent Technology. WSC 2004: 805-814 - [c1]Yong Zhao, Cheng Zhao, Jianzhong Cha:
An Intelligent Design Method of Product Scheme Innovation. WSC 2004: 815-824 - 2003
- [j10]Anthony J. W. Hilton, Jiping Liu, Cheng Zhao:
The total chromatic numbers of joins of sparse graphs. Australas. J Comb. 28: 93-106 (2003) - 2001
- [j9]Jiping Liu, Cheng Zhao:
On a conjecture of Hilton. Australas. J Comb. 24: 265-274 (2001) - [j8]Anthony J. W. Hilton, Fred C. Holroyd, Cheng Zhao:
The Overfull Conjecture and the Conformability Conjecture. Discret. Math. 241(1-3): 343-361 (2001) - 2000
- [j7]Dai Wang, Cheng Zhao, Rong Cheng, Fengzhu Sun:
Estimation of the Mutation Rate During Error-prone Polymerase Chain Reaction. J. Comput. Biol. 7(1-2): 143-158 (2000) - [j6]George He, Jiping Liu, Cheng Zhao:
Approximation Algorithms for Some Graph Partitioning Problems. J. Graph Algorithms Appl. 4(2): 1-11 (2000)
1990 – 1999
- 1996
- [j5]Anthony J. W. Hilton, Jiping Liu, Cheng Zhao:
Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle. Discret. Appl. Math. 65(1-3): 347-377 (1996) - [j4]Jiping Liu, Cheng Zhao:
A new bound on the feedback vertex sets in cubic graphs. Discret. Math. 148(1-3): 119-131 (1996) - 1994
- [j3]Cheng Zhao:
Smallest (1, 2)-eulerian weight and shortest cycle covering. J. Graph Theory 18(2): 153-160 (1994) - 1993
- [j2]Anthony J. W. Hilton, Cheng Zhao:
A sufficient condition for a regular graph to be class 1. J. Graph Theory 17(6): 701-712 (1993) - 1992
- [j1]Anthony J. W. Hilton, Cheng Zhao:
The chromatic index of a graph whose core has maximum degree two. Discret. Math. 101(1-3): 135-147 (1992)
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.
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.
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.
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 2025-03-13 20:21 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:
