default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Zhu 0015
Person information
- affiliation: Shanghai Jiao Tong University, School of Mathematical Sciences, China
Other persons with the same name
- Yan Zhu — disambiguation page
- Yan Zhu 0001
![[0000-0002-9610-0641]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9610-0641")
— University of Macau, Analog and Mixed Signal VLSI Laboratory, Macao, China - Yan Zhu 0002 — Stanford University, CA, USA
- Yan Zhu 0003 — Northwestern University, Evanston, IL, USA
- Yan Zhu 0004 — University of Sydney, Department of Electrical Engineering, Australia
- Yan Zhu 0005 — Nanjing Agricultural University, China
- Yan Zhu 0006 — Monash University, Department of Medicinal Chemistry, Melbourne, Australia
- Yan Zhu 0007 — Southwest Jiaotong University, Chengdu, China (and 1 more)
- Yan Zhu 0008 — East China University of Science and Technology, Department of Mathematics, Shanghai, China (and 2 more)
- Yan Zhu 0009 — Facebook, Applied Machine Learning, USA (and 2 more)
- Yan Zhu 0010 — University of Science and Technology Beijing, China (and 3 more)
- Yan Zhu 0011 — Tsinghua University, Department of Management Science & Engineering, Beijing, China
- Yan Zhu 0012 — Beijing Jiaotong University, China
- Yan Zhu 0013 — New Mexico University, Albuquerque, NM, USA
- Yan Zhu 0014 — University of California, Riverside, CA, USA (and 1 more)
- Yan Zhu 0016 — Chinese Academy of Sciences, State Key Laboratory of Computer Architecture, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka, Yan Zhu:
Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials. Ars Math. Contemp. 22(2): 2 (2022)
2010 – 2019
- 2019
- [j6]Eiichi Bannai, Yan Zhu:
Tight t-designs on one shell of Johnson association schemes. Eur. J. Comb. 80: 23-36 (2019) - 2017
- [j5]Yan Zhu, Eiichi Bannai, Etsuko Bannai, Kyoung-Tark Kim, Wei-Hsuan Yu:
On Spherical Designs of Some Harmonic Indices. Electron. J. Comb. 24(2): 2 (2017) - [j4]Eiichi Bannai, Etsuko Bannai, Yan Zhu:
Relative t-designs in binary Hamming association scheme H(n, 2). Des. Codes Cryptogr. 84(1-2): 23-53 (2017) - [j3]Eiichi Bannai, Etsuko Bannai, Hajime Tanaka, Yan Zhu:
Design Theory from the Viewpoint of Algebraic Combinatorics. Graphs Comb. 33(1): 1-41 (2017) - [j2]Yan Zhu, Eiichi Bannai, Etsuko Bannai, Takuya Ikuta, Kyoung-Tark Kim:
Harmonic Index Designs in Binary Hamming Schemes. Graphs Comb. 33(6): 1405-1418 (2017) - 2016
- [j1]Yan Zhu, Eiichi Bannai, Etsuko Bannai:
Tight relative 2-designs on two shells in Johnson association schemes. Discret. Math. 339(2): 957-973 (2016)
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-11-07 21:32 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:
