default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaitao Cao 0001
Person information
- affiliation: Nanjing Normal University, Department of Mathematics, China
Other persons with the same name
- Haitao Cao 0002
![[0000-0002-1913-4514]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-1913-4514")
— Hohai University, Department of Mathematics and Physics, Changzhou, China (and 1 more) - Haitao Cao 0003 — Michigan Technological University, Department of Geological and Mining Engineering and Sciences, Houghton, MI, USA
- Haitao Cao 0004 — Guangzhou Panyu Polytechnic, China (and 3 more)
- Haitao Cao 0005 — Beihang University, State Key Laboratory of Software Development Environment, Beijing, China
- Haitao Cao 0006 — Xiamen University, School of Informatics, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j30]Hong Lu, Haitao Cao:
Further results on large sets plus of partitioned incomplete Latin squares. Discret. Math. 348(1): 114215 (2025)- 2024
- [j29]Dongliang Li, Haitao Cao:
New results on orthogonal arrays OA(3,5,4n + 2). J. Comb. Theory, Ser. A 204: 105864 (2024) - 2023
- [j28]Kunxuan Gu, Fujie Zhang, Haitao Cao:
The existence of (1,m)-near-Skolem sequences. Australas. J Comb. 87: 68-85 (2023) - [j27]Hong Lu, Jianpeng Chen, Haitao Cao:
On a pair of orthogonal golf designs. Discret. Math. 346(8): 113406 (2023) - [j26]Fujie Zhang, Haitao Cao:
On a conjecture about (m1, m2)-near-Skolem sequences. Discret. Math. 346(10): 113556 (2023) - 2022
- [j25]Cong Shen, Haitao Cao:
On large set plus of disjoint incomplete Latin squares. Discret. Math. 345(9): 112970 (2022) - 2020
- [j24]Xiaolei Niu, Haitao Cao, Keqin Feng:
Binary periodic sequences with 2-level autocorrelation values. Discret. Math. 343(3): 111723 (2020) - [j23]C. Shen, Y. Zheng, Haitao Cao:
Completing the spectrum for three designs related to the graph K4-e. Discret. Math. 343(10): 112011 (2020)
2010 – 2019
- 2018
- [j22]Xiaojuan Lu, Xiaolei Niu, Haitao Cao:
Some results on generalized strong external difference families. Des. Codes Cryptogr. 86(12): 2857-2868 (2018) - [j21]L. Wang, Haitao Cao:
A note on the Hamilton-Waterloo problem with C8-factors and Cm-factors. Discret. Math. 341(1): 67-73 (2018) - [j20]L. Wang, Haitao Cao:
Completing the spectrum of almost resolvable cycle systems with odd cycle length. Discret. Math. 341(5): 1479-1491 (2018) - [j19]Xiaolei Niu, Haitao Cao:
Constructions and bounds for separating hash families. Discret. Math. 341(9): 2627-2638 (2018) - 2017
- [j18]Fen Chen, Haitao Cao:
On the existence of (K1, 3, λ)-frames of type gu. Australas. J Comb. 68: 317-329 (2017) - [i3]Xiaolei Niu, Haitao Cao:
Some new bounds of placement delivery arrays. CoRR abs/1703.08900 (2017) - 2016
- [j17]Fen Chen, Haitao Cao:
Uniformly resolvable decompositions of Kv into K2 and K1, 3 graphs. Discret. Math. 339(8): 2056-2062 (2016) - [i2]Xiaolei Niu, Haitao Cao:
Some bounds of separating hash families. CoRR abs/1611.03274 (2016) - [i1]Minquan Cheng, Jing Jiang, Qifa Yan, Xiaohu Tang, Haitao Cao:
Optimal Placement Delivery Arrays. CoRR abs/1611.04213 (2016) - 2015
- [j16]Feifei Lu, Haitao Cao:
On the existence of holey 4-cycle frames. Discret. Math. 338(4): 637-644 (2015) - [j15]Haitao Cao, J. Lei, Lie Zhu:
Constructions of large sets of disjoint group-divisible designs using a generalization of. Discret. Math. 338(8): 1449-1459 (2015) - 2012
- [j14]Meixin Niu, Haitao Cao:
More results on cycle frames and almost resolvable cycle systems. Discret. Math. 312(22): 3392-3405 (2012) - 2011
- [j13]Haitao Cao, Wen Li:
Existence of strong symmetric self-orthogonal diagonal Latin squares. Discret. Math. 311(10-11): 841-843 (2011) - [j12]Haitao Cao, Meixin Niu, C. Tang:
On the existence of cycle frames and almost resolvable cycle systems. Discret. Math. 311(20): 2220-2232 (2011)
2000 – 2009
- 2009
- [j11]Haitao Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei:
On orthogonal generalized equitable rectangles. Des. Codes Cryptogr. 51(3): 225-230 (2009) - [j10]Haitao Cao, L. Wang, Ruizhong Wei:
The existence of HGDDs with block size four and its application to double frames. Discret. Math. 309(4): 945-949 (2009) - [j9]Haitao Cao, Kejun Chen, Ruizhong Wei:
Super-simple balanced incomplete block designs with block size 4 and index 5. Discret. Math. 309(9): 2808-2814 (2009) - [j8]Haitao Cao, F. Yan:
Super-simple group divisible designs with block size 4 and index 5. Discret. Math. 309(16): 5111-5119 (2009) - [j7]Haitao Cao, Ruizhong Wei:
Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 55(3): 1387-1394 (2009) - 2007
- [j6]Haitao Cao, Lijun Ji, Lie Zhu:
Constructions for generalized Steiner systems GS (3, 4, v , 2). Des. Codes Cryptogr. 45(2): 185-197 (2007) - 2006
- [j5]Haitao Cao:
Resolvable packings RtildeMP(3, 2; n, n-3) and coverings RtildeMC(3, 2; n, n-2). Discret. Math. 306(12): 1240-1246 (2006) - 2004
- [j4]Haitao Cao, Y. Tang:
On Kirkman packing designs KPD({3, 4}, v). Discret. Math. 279(1-3): 121-133 (2004) - [j3]Haitao Cao, Beiliang Du:
Kirkman packing designs KPD ({w, sast}, v) and related threshold schemes. Discret. Math. 281(1-3): 83-95 (2004) - [j2]Haitao Cao, L. Ji, Zhu Lie:
Large sets of disjoint packings on 6k+5 points. J. Comb. Theory A 108(2): 169-183 (2004) - 2002
- [j1]Haitao Cao, Lie Zhu:
Kirkman Packing Designs KPD ({3, 5*}, v). Des. Codes Cryptogr. 26(1-3): 127-138 (2002)
Coauthor Index
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-10-08 21:33 CEST 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:
