default search action
Chang Lv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Chang Lv, Qiong Liu, Chaoyong Zhang, Yaping Ren, Hao Zhou
:
A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem. Comput. Oper. Res. 166: 106627 (2024) - [j12]Hao Zhou, Hui Liu, Chang Lv, Chaoyong Zhang, Weiming Shen:
A path relinking with tabu search algorithm for solving hybrid flow shop scheduling problem considering multiple critical paths. Comput. Oper. Res. 170: 106783 (2024) - [j11]Lu Hou, Zhenyu Huang, Chang Lv:
Quantum Algorithms for the Multiplication of Circulant Matrices and Vectors. Inf. 15(8): 453 (2024) - [j10]Xiao Li, Chang Lv, Zhizhong Pan:
A Generalized MSST Algorithm for Counting Points of Elliptic Curves over 픽pn. J. Syst. Sci. Complex. 37(4): 1738-1754 (2024) - [j9]Kun Cheng
Deep Learning Approach for Driver Speed Intention Recognition Based on Naturalistic Driving Data. IEEE Trans. Intell. Transp. Syst. 25(10): 14546-14559 (2024) - [c3]Lu Hou, Chang Lv:
Amplitude Transformation of Quantum State Based on QSVT. ISIT 2024: 2056-2061 - 2023
- [j8]Zixuan Liang
Lateral Entry Guidance With Terminal Time Constraint. IEEE Trans. Aerosp. Electron. Syst. 59(3): 2544-2553 (2023) - [c2]Shixin Tian, Zhili Dong, Kunpeng Wang, Chang Lv:
Subfield Attack on NTRU by using symmetric function map. ISIT 2023: 2308-2313 - 2022
- [j7]Chang Lv, Chaoyong Zhang, Yaping Ren
A fuzzy correlation based heuristic for Dual-mode integrated Location routing problem. Comput. Oper. Res. 146: 105923 (2022) - [c1]Zhili Dong, Shixin Tian, Kunpeng Wang, Chang Lv:
Subfield Attacks on HSVP in Ideal Lattices. Inscrypt 2022: 447-462 - 2020
- [j6]Leilei Meng
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 142: 106347 (2020) - [j5]Yuqing Zhu
Refined analysis to the extended tower number field sieve. Theor. Comput. Sci. 814: 49-68 (2020)
2010 – 2019
- 2019
- [j4]Yuqing Zhu
A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity. Des. Codes Cryptogr. 87(5): 971-986 (2019) - 2018
- [i4]Chang Lv:
Nonexistence of generalized bent functions and the quadratic norm form equations. CoRR abs/1804.01292 (2018) - 2017
- [j3]Chang Lv
On the Non-Existence of Certain Classes of Generalized Bent Functions. IEEE Trans. Inf. Theory 63(1): 738-746 (2017) - [j2]Chang Lv:
On the Non-Existence of Certain Classes of Perfect p-Ary Sequences and Perfect Almost p-Ary Sequences. IEEE Trans. Inf. Theory 63(8): 5350-5359 (2017) - 2016
- [j1]Yuqing Zhu
Classifying and generating exact coset representatives of PGL2(Fq) in PGL2(Fq2). Finite Fields Their Appl. 42: 118-127 (2016) - [i3]Chang Lv, Jianing Li:
On the Non-existence of certain classes of generalized bent functions. CoRR abs/1604.04826 (2016) - [i2]Chang Lv:
On the Non-existence of certain classes of perfect p-ary sequences and perfect almost p-ary sequences. CoRR abs/1612.05682 (2016) - [i1]Yuqing Zhu, Jincheng Zhuang, Chang Lv, Dongdai Lin:
Improvements on the Individual Logarithm Step in exTNFS. IACR Cryptol. ePrint Arch. 2016: 727 (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-10-23 21:24 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: