default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiao-Long Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Qiao-Long Huang, Ke Ye
, Xiao-Shan Gao:
Skew-polynomial-sparse matrix multiplication. J. Symb. Comput. 121: 102240 (2024)- [c8]Michael B. Monagan, Qiao-Long Huang:
A New Sparse Polynomial GCD by Separating Terms. ISSAC 2024: 134-142 - 2023
- [j3]Qiao-Long Huang:
Sparse polynomial interpolation based on derivatives. J. Symb. Comput. 114: 359-375 (2023) - [c7]Qiao-Long Huang, Xiao-Shan Gao:
New Sparse Multivariate Polynomial Factorization Algorithms over Integers. ISSAC 2023: 315-324 - 2022
- [i9]Qiao-Long Huang, Ke Ye, Xiao-Shan Gao:
Skew-sparse matrix multiplication. CoRR abs/2205.06429 (2022) - [i8]Qiao-Long Huang, Xiao-Shan Gao:
Bit Complexity of Polynomial GCD on Sparse Representation. CoRR abs/2207.13874 (2022) - 2021
- [c6]Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse Multiplication of Multivariate Linear Differential Operators. ISSAC 2021: 155-162 - 2020
- [j2]Qiao-Long Huang, Xiao-Shan Gao:
Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs. J. Symb. Comput. 101: 367-386 (2020) - [c5]Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse multiplication for skew polynomials. ISSAC 2020: 194-201 - [i7]Qiao-Long Huang:
Sparse Polynomial Interpolation Based on Diversification. CoRR abs/2002.03706 (2020) - [i6]Qiao-Long Huang:
Sparse Polynomial Interpolation Based on Derivative. CoRR abs/2002.03708 (2020)
2010 – 2019
- 2019
- [c4]Qiao-Long Huang, Xiao-Shan Gao:
Revisit Sparse Polynomial Interpolation Based on Randomized Kronecker Substitution. CASC 2019: 215-235 - [c3]Qiao-Long Huang:
Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic. ISSAC 2019: 219-226 - 2018
- [j1]Qiao-Long Huang:
An Improved Early Termination Sparse Interpolation Algorithm for Multivariate Polynomials. J. Syst. Sci. Complex. 31(2): 539-551 (2018) - 2017
- [c2]Qiao-Long Huang, Xiao-Shan Gao:
Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients. CASC 2017: 196-209 - [c1]Qiao-Long Huang, Xiao-Shan Gao:
Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients. MACIS 2017: 227-242 - [i5]Qiao-Long Huang, Xiao-Shan Gao:
Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients. CoRR abs/1704.04359 (2017) - [i4]Qiao-Long Huang, Xiao-Shan Gao:
Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients. CoRR abs/1706.00914 (2017) - [i3]Qiao-Long Huang, Xiao-Shan Gao:
Faster Deterministic Sparse Interpolation Algorithms for Straight-Line Program Multivariate Polynomials. CoRR abs/1709.08979 (2017) - [i2]Qiao-Long Huang, Xiao-Shan Gao:
Sparse Interpolation of Black-box Multivariate Polynomials using Kronecker Type Substitutions. CoRR abs/1710.01301 (2017) - [i1]Qiao-Long Huang, Xiao-Shan Gao:
Revisit Randomized Kronecker Substitution based Sparse Polynomial Interpolation. CoRR abs/1712.05481 (2017)
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-07-20 20:34 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:
