default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi-Jheng Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Yun-Hsin Chiang
, Yi-Jheng Lin, Cheng-Shang Chang, Y.-W. Peter Hong:
Throughput Analysis for Parallel Decoding of Irregular Repetition Slotted ALOHA With Noise. IEEE/ACM Trans. Netw. 32(4): 3544-3558 (2024)- 2023
- [j6]Chia-Ming Chang, Yi-Jheng Lin, Cheng-Shang Chang, Duan-Shin Lee:
On the Stability Regions of Coded Poisson Receivers With Multiple Classes of Users and Receivers. IEEE/ACM Trans. Netw. 31(1): 234-247 (2023) - 2022
- [j5]Yi-Jheng Lin, Che-Hao Yu, Tzu-Hsuan Liu, Cheng-Shang Chang, Wen-Tsuen Chen:
Constructions and Comparisons of Pooling Matrices for Pooled Testing of COVID-19. IEEE Trans. Netw. Sci. Eng. 9(2): 467-480 (2022) - [j4]Tzu-Hsuan Liu, Che-Hao Yu, Yi-Jheng Lin, Chia-Ming Chang, Cheng-Shang Chang, Duan-Shin Lee:
ALOHA Receivers: A Network Calculus Approach for Analyzing Coded Multiple Access With SIC. IEEE/ACM Trans. Netw. 30(2): 840-854 (2022) - [c2]Yun-Hsin Chiang, Yi-Jheng Lin, Cheng-Shang Chang, Y.-W. Peter Hong:
Parallel Decoding of IRSA with Noise. PIMRC 2022: 320-326 - 2021
- [j3]Yi-Jheng Lin, Che-Hao Yu, Tzu-Hsuan Liu, Cheng-Shang Chang, Wen-Tsuen Chen:
Positively Correlated Samples Save Pooled Testing Costs. IEEE Trans. Netw. Sci. Eng. 8(3): 2170-2182 (2021) - [j2]Cheng-Shang Chang, Jang-Ping Sheu, Yi-Jheng Lin:
On the Theoretical Gap of Channel Hopping Sequences With Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem. IEEE/ACM Trans. Netw. 29(4): 1620-1633 (2021) - [c1]Yi-Jheng Lin, Cheng-Shang Chang:
PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity. WOCC 2021: 199-203 - [i6]Yi-Jheng Lin, Cheng-Shang Chang:
PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity. CoRR abs/2104.08461 (2021) - [i5]Chia-Ming Chang, Yi-Jheng Lin, Cheng-Shang Chang, Duan-Shin Lee:
On the Stability Regions of Coded Poisson Receivers with Multiple Classes of Users and Receivers. CoRR abs/2107.10696 (2021) - [i4]Yi-Jheng Lin, Chia-Ming Chang, Cheng-Shang Chang:
A Hierarchical Stitching Algorithm for Coded Compressed Sensing. CoRR abs/2108.13760 (2021) - 2020
- [i3]Tzu-Hsuan Liu, Che-Hao Yu, Yi-Jheng Lin, Cheng-Shang Chang, Duan-Shin Lee:
ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC. CoRR abs/2009.03145 (2020) - [i2]Yi-Jheng Lin, Che-Hao Yu, Tzu-Hsuan Liu, Cheng-Shang Chang, Wen-Tsuen Chen:
Comparisons of Pooling Matrices for Pooled Testing of COVID-19. CoRR abs/2010.00060 (2020) - [i1]Yi-Jheng Lin, Che-Hao Yu, Tzu-Hsuan Liu, Cheng-Shang Chang, Wen-Tsuen Chen:
Positively Correlated Samples Save Pooled Testing Costs. CoRR abs/2011.09794 (2020)
2010 – 2019
- 2013
- [j1]Yu-Chi Chen, Gwoboa Horng, Yi-Jheng Lin, Kuo-Chang Chen:
Privacy Preserving Index for Encrypted Electronic Medical Records. J. Medical Syst. 37(6): 9992 (2013)
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-09-10 01:07 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:
