default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHao Du 0001
Person information
- affiliation: Beijing University of Posts and Telecommunications, School of Sciences, Beijing, China
- affiliation: Austrian Academy of Sciences, Johann Radon Institute (RICAM), Linz, Austria
- affiliation (PhD 2019): University of Chinese Academy of Sciences, School of Mathematical Sciences, Beijing, China
- affiliation: Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Key Laboratory of Mathematics Mechanization, Beijing, China
Other persons with the same name
- Hao Du — disambiguation page
- Hao Du 0002
![[0000-0002-6912-2749]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6912-2749")
— University of Electronic Science and Technology of China, School of Information and Communication Engineering, Chengdu, China - Hao Du 0003 — National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
- Hao Du 0004 — University of Washington, Department of Computer Science and Engineering, Seattle, WA, USA (and 1 more)
- Hao Du 0005 — National University of Singapore, Saw Swee Hock School of Public Health, Singapore (and 1 more)
- Hao Du 0006 — City University of Hong Kong, Department of Computer Science, Hong Kong
- Hao Du 0007 — Southwest Jiaotong University, Department of Electrical Engineering, Chengdu, China
- Hao Du 0008 — Chinese Academy of Sciences, Academy of Opto-Electronics, Beijing, China
- Hao Du 0009 — Xi'an Jiaotong University, Department of Electronic and Information Engineering, Xi'an, China
- Hao Du 0010 — Wuhan University, GNSS Research Center, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Hao Du, Yiman Gao, Jing Guo, Ziming Li:
Computing Logarithmic Parts by Evaluation Homomorphisms✱. ISSAC 2023: 242-250- [i4]Shaoshi Chen, Hao Du, Yiman Gao, Ziming Li:
Reducing Hyperexponential Functions over Monomial Extensions. CoRR abs/2310.01194 (2023) - 2022
- [j3]Hao Du, Christoph Koutschan, Thotsaporn Thanatipanonda, Elaine Wong:
Binomial determinants for tiling problems yield to the holonomic ansatz. Eur. J. Comb. 99: 103437 (2022) - 2021
- [i3]Hao Du, Christoph Koutschan, Thotsaporn Thanatipanonda, Elaine Wong:
Binomial Determinants for Tiling Problems Yield to the Holonomic Ansatz. CoRR abs/2105.08539 (2021) - 2020
- [c2]Hao Du, Jing Guo, Ziming Li, Elaine Wong:
An additive decomposition in logarithmic towers and beyond. ISSAC 2020: 146-153 - [i2]Hao Du, Jing Guo, Ziming Li, Elaine Wong:
An Additive Decomposition in S-Primitive Towers. CoRR abs/2002.02355 (2020)
2010 – 2019
- 2019
- [j2]Hao Du, Jing Guo, Ziming Li:
An additive decomposition in multiple logarithmic extensions. ACM Commun. Comput. Algebra 53(3): 110-113 (2019) - [j1]Hao Du, Ziming Li:
The Ore-Sato Theorem and Shift Exponents in the q-Difference Case. J. Syst. Sci. Complex. 32(1): 271-286 (2019) - 2018
- [c1]Shaoshi Chen, Hao Du, Ziming Li:
Additive Decompositions in Primitive Extensions. ISSAC 2018: 135-142 - [i1]Shaoshi Chen, Hao Du, Ziming Li:
Additive Decompositions in Primitive Extensions. CoRR abs/1802.02329 (2018)
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-12-08 02:23 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:
