default search action
Lianrong Pu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Abel C. H. Chen
, Wen-Kang Jia, Feng-Jang Hwang
Machine learning and deep learning methods for wireless network applications. EURASIP J. Wirel. Commun. Netw. 2022(1): 115 (2022) - 2021
- [j5]Chi-Hua Chen
Editorial. Int. J. Distributed Sens. Networks 17(2): 155014772199288 (2021) - [j4]Jinhao Zhang, Zehua Zhang, Lianrong Pu, Jijun Tang, Fei Guo
AIEpred: An Ensemble Predictive Model of Classifier Chain to Identify Anti-Inflammatory Peptides. IEEE ACM Trans. Comput. Biol. Bioinform. 18(5): 1831-1840 (2021) - [c5]Yael Ben-Ari, Dan Flomin, Lianrong Pu, Yaron Orenstein, Ron Shamir:
Improving the efficiency of de Bruijn graph construction using compact universal hitting sets. BCB 2021: 4:1-4:9 - 2020
- [j3]Lianrong Pu, Daming Zhu, Haitao Jiang:
A 1.375-approximation algorithm for unsigned translocation sorting. J. Comput. Syst. Sci. 113: 163-178 (2020)
2010 – 2019
- 2018
- [j2]Lianrong Pu, Yu Lin
Can a breakpoint graph be decomposed into none other than 2-cycles? Theor. Comput. Sci. 734: 38-45 (2018) - [c4]Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff, Binhai Zhu:
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications. COCOON 2018: 26-38 - 2017
- [j1]Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu, Hong Liu:
Approximating Max NAE-k-SAT by anonymous local search. Theor. Comput. Sci. 657: 54-63 (2017) - 2016
- [c3]Lianrong Pu, Haitao Jiang:
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? FAW 2016: 205-214 - [c2]Lianrong Pu, Daming Zhu, Haitao Jiang:
A New Approximation Algorithm for Unsigned Translocation Sorting. WABI 2016: 269-280 - 2015
- [c1]Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu:
Local Search to Approximate Max NAE- k k -Sat Tightly. FAW 2015: 271-281
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-05-22 21:32 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: