default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiansun Zeng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Tinghui Cao
, Liansun Zeng, Yongchao Liu, Wu Ling:
Research on Freight Volume Prediction of Express Transportation Based on BP Neural Network + Time Series. BDEIM 2023: 10-15- [c8]Xinxin Li, Liansun Zeng:
Research on signal denoising method based on improved wavelet threshold. EITCE 2023: 857-861
2010 – 2019
- 2019
- [j6]Feng Liu, Peixin Ge, Liansun Zeng:
基于延迟CSIT的非对称双向中继X信道传输方案 (Transmission Scheme for Asymmetric Two-way Relay X Channel Based on Delayed CSIT). 计算机科学 46(8): 152-156 (2019) - 2018
- [j5]Zhenchao Yu, Feng Liu, Liansun Zeng:
BC单播与BC多播并存的多用户网络分析 (Multi-user Network Analysis of BC Unicast and BC Multicast Coexistence). 计算机科学 45(10): 120-123 (2018) - 2017
- [c7]Feng Liu, Cong-gai Li, Yanli Xu, Liansun Zeng:
Optimal state scheduling for three-hop directed cascaded networks with time division duplexing (invited paper). ICUFN 2017: 1042-1047 - [c6]Feng Liu, Dengfei Kang, Cong-gai Li, Liansun Zeng:
On the antenna efficiency of coexisting networks with broadcast and point-to-point channels (Invited Paper). ICUFN 2017: 1056-1058 - 2016
- [j4]Feng Liu, Yuanyuan Wang, Liansun Zeng:
点对点信道与两用户广播信道并存时的自由度 (Degrees of Freedom of Coexistence Network with Point-to-Point and Two-user Broadcast Channels). 计算机科学 43(2): 129-134 (2016) - [c5]Cong Li, Feng Liu, Liansun Zeng:
On the DoF of co-existing 2×2 X channel and 2×2 interference channel. ICUFN 2016: 270-272 - 2015
- [j3]Luna Zhou, Feng Liu, Liansun Zeng:
两个点对点(PTP)网络并存时的自由度研究 (Research on Degrees of Freedom of Two PTP Networks Coexistence). 计算机科学 42(1): 110-112 (2015) - [j2]Yuanyuan Wang, Feng Liu, Liansun Zeng, Youjun Zhang:
点对点信道感知两用户干扰信道时的自由度研究 (On Degrees of Freedom of Cognitive Networks from Point-to-Point Channel to Two-user Interference Channel). 计算机科学 42(9): 102-106 (2015) - [c4]Feng Liu, Liansun Zeng, Shengming Jiang:
Frequency scheduling for cascaded wireless relay networks with half duplex. ICC 2015: 2512-2516 - [c3]Feng Liu, Shengming Jiang, Liansun Zeng, Xuan Geng:
Achievable rate region of frequency-division-duplex cascaded wireless networks with single source and two destinations. ICUFN 2015: 180-185 - 2014
- [j1]Feng Liu, Xiaofeng Wang, Liansun Zeng:
On the Degrees of Freedom for Multi-Hop Wireless Networks under Layered TDD Constraint. EAI Endorsed Trans. Scalable Inf. Syst. 1(3): e4 (2014) - [c2]Feng Liu, Xiaofeng Wang, Liansun Zeng:
Fibonacci sequence and cascaded directed relay networks with time-division-duplex constraint. ICC 2014: 5113-5118 - [c1]Feng Liu, Liansun Zeng:
Achievable DF rate for cascaded undirected wireless networks with TDD and hidden-terminal. ICCC 2014: 733-737
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-06-19 21:01 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:
