Cheng Zhao

35 papers A 1Misc 2Journal 31Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing.
Proc. VLDB Endow.
Qiange Wang, Yongze Yan, Hongshi Tan, Cheng Chen, Cheng Zhao, Jiaming Tian, Jiaxin Jiang, Xiaoliang Cong, Yanfeng Zhang, Ge Yu, Weng-Fai Wong, Bingsheng He
2024 A conf
Exploring Performance and Cost Optimization with ASIC-Based CXL Memory.
EuroSys
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
2024 J jnl
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework.
CoRR
Junyi Mei, Shixuan Sun, Chao Li, Cheng Xu, Cheng Chen, Yibo Liu, Jing Wang, Cheng Zhao, Xiaofeng Hou, Minyi Guo, Bingsheng He, Xiaoliang Cong
2024 J jnl
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework.
Proc. VLDB Endow.
Junyi Mei, Shixuan Sun, Chao Li, Cheng Xu, Cheng Chen, Yibo Liu, Jing Wang, Cheng Zhao, Xiaofeng Hou, Minyi Guo, Bingsheng He, Xiaoliang Cong
2023 — conf
ByteGAP: A Non-continuous Distributed Graph Computing System using Persistent Memory.
VLDB Workshops
MiaoMiao Cheng, Jiujian Chen, Cheng Zhao, Cheng Chen, Yongmin Hu, Xiaoliang Cong, Liang Qin, Hexiang Lin, Ronghua Li, Guoren Wang, Shuai Zhang, Lei Zhang
2022 J jnl
On the maxima of motzkin-straus programs and cliques of graphs.
J. Glob. Optim.
Qingsong Tang, Xiangde Zhang, Cheng Zhao, Peng Zhao
2018 J jnl
A continuous characterization of the maximum vertex-weighted clique in hypergraphs.
J. Comb. Optim.
Qingsong Tang, Xiangde Zhang, Guoren Wang, Cheng Zhao
2017 J jnl
On Motzkin-Straus type results for non-uniform hypergraphs.
J. Comb. Optim.
Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao
2016 J jnl
A Novel Image Encryption Scheme Using the Composite Discrete Chaotic System.
Entropy
Hegui Zhu, Xiangde Zhang, Hai Yu, Cheng Zhao, Zhiliang Zhu
2016 J jnl
An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications.
Discret. Appl. Math.
Yuejian Peng, Hao Peng, Qingsong Tang, Cheng Zhao
2016 J jnl
Connection between the clique number and the Lagrangian of 3-uniform hypergraphs.
Optim. Lett.
Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao
2015 J jnl
On Finding Lagrangians of 3-uniform Hypergraphs.
Ars Comb.
George He, Yuejian Peng, Cheng Zhao
2015 J jnl
On Lagrangians of r-uniform hypergraphs.
J. Comb. Optim.
Yuejian Peng, Qingsong Tang, Cheng Zhao
2014 J jnl
On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs.
J. Optim. Theory Appl.
Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao
2014 J jnl
On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges.
J. Optim. Theory Appl.
Yanping Sun, Qingsong Tang, Cheng Zhao, Yuejian Peng
2014 J jnl
Some results on Lagrangians of hypergraphs.
Discret. Appl. Math.
Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao
2013 J jnl
A Motzkin-Straus Type Result for 3-Uniform Hypergraphs.
Graphs Comb.
Yuejian Peng, Cheng Zhao
2013 J jnl
A novel image encryption-compression scheme using hyper-chaos and Chinese remainder theorem.
Signal Process. Image Commun.
Hegui Zhu, Cheng Zhao, Xiangde Zhang
2013 J jnl
A novel iris and chaos-based random number generator.
Comput. Secur.
Hegui Zhu, Cheng Zhao, Xiangde Zhang, Lianping Yang
2009 J jnl
On non-strong jumping numbers and density structures of hypergraphs.
Discret. Math.
Yuejian Peng, Cheng Zhao
2008 J jnl
Generating non-jumping numbers recursively.
Discret. Appl. Math.
Yuejian Peng, Cheng Zhao
2007 J jnl
Characterization of P
Discret. Appl. Math.
Jiping Liu, Yuejian Peng, Cheng Zhao
2005 J jnl
On incomparable and uncomplemented families of sets.
Australas. J Comb.
Yuejian Peng, Cheng Zhao
2004 Misc conf
An Intelligent Design Method of Product Scheme Innovation.
WSC
Yong Zhao, Cheng Zhao, Jianzhong Cha
2004 Misc conf
Individual Product Customization Based On Multi-agent Technology.
WSC
Yong Zhao, Cheng Zhao, Jianzhong Cha
2003 J jnl
The total chromatic numbers of joins of sparse graphs.
Australas. J Comb.
Anthony J. W. Hilton, Jiping Liu, Cheng Zhao
2001 J jnl
On a conjecture of Hilton.
Australas. J Comb.
Jiping Liu, Cheng Zhao
2001 J jnl
The Overfull Conjecture and the Conformability Conjecture.
Discret. Math.
Anthony J. W. Hilton, Fred C. Holroyd, Cheng Zhao
2000 J jnl
Approximation Algorithms for Some Graph Partitioning Problems.
J. Graph Algorithms Appl.
George He, Jiping Liu, Cheng Zhao
2000 J jnl
Estimation of the Mutation Rate During Error-prone Polymerase Chain Reaction.
J. Comput. Biol.
Dai Wang, Cheng Zhao, Rong Cheng, Fengzhu Sun
1996 J jnl
A new bound on the feedback vertex sets in cubic graphs.
Discret. Math.
Jiping Liu, Cheng Zhao
1996 J jnl
Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle.
Discret. Appl. Math.
Anthony J. W. Hilton, Jiping Liu, Cheng Zhao
1994 J jnl
Smallest (1, 2)-eulerian weight and shortest cycle covering.
J. Graph Theory
Cheng Zhao
1993 J jnl
A sufficient condition for a regular graph to be class 1.
J. Graph Theory
Anthony J. W. Hilton, Cheng Zhao
1992 J jnl
The chromatic index of a graph whose core has maximum degree two.
Discret. Math.
Anthony J. W. Hilton, Cheng Zhao