default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Hao Ling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Davin Choo
, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-free house allocation with minimum subsidy. Oper. Res. Lett. 54: 107103 (2024)- [j6]Yan Hao Ling, Jonathan Scarlett:
Maxflow-Based Bounds for Low-Rate Information Propagation Over Noisy Networks. IEEE Trans. Inf. Theory 70(6): 3840-3854 (2024) - [j5]Yan Hao Ling, Jonathan Scarlett:
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels. IEEE Trans. Inf. Theory 70(11): 7599-7615 (2024) - [c4]Yan Hao Ling, Jonathan Scarlett:
Exact Error Exponents for a Concatenated Coding Based Class of DNA Storage Codes. ISIT 2024: 3426-3431 - [i8]Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-Free House Allocation with Minimum Subsidy. CoRR abs/2403.01162 (2024) - [i7]Yan Hao Ling, Jonathan Scarlett:
Exact Error Exponents of Concatenated Codes for DNA Storage. CoRR abs/2409.01223 (2024) - 2023
- [j4]Yan Hao Ling, Jonathan Scarlett:
Multi-Bit Relaying Over a Tandem of Channels. IEEE Trans. Inf. Theory 69(6): 3511-3524 (2023) - [c3]Ivan Lau, Yan Hao Ling, Mayank Shrivastava, Jonathan Scarlett:
Max-Quantile Grouped Infinite-Arm Bandits. ALT 2023: 909-945 - [i6]Yan Hao Ling, Jonathan Scarlett:
Maxflow-Based Bounds for Low-Rate Information Propagation over Noisy Networks. CoRR abs/2304.02226 (2023) - [i5]Yan Hao Ling, Jonathan Scarlett:
Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels. CoRR abs/2311.14251 (2023) - 2022
- [j3]Yan Hao Ling, Jonathan Scarlett:
Simple Coding Techniques for Many-Hop Relaying. IEEE Trans. Inf. Theory 68(11): 7043-7053 (2022) - [c2]Yan Hao Ling, Jonathan Scarlett:
A Simple Coding Scheme Attaining Positive Information Velocity. ISIT 2022: 3215-3219 - [i4]Yan Hao Ling, Jonathan Scarlett:
Multi-Bit Relaying over a Tandem of Channels. CoRR abs/2208.02003 (2022) - [i3]Ivan Lau, Yan Hao Ling, Mayank Shrivastava, Jonathan Scarlett:
Max-Quantile Grouped Infinite-Arm Bandits. CoRR abs/2210.01295 (2022) - 2021
- [j2]Yan Hao Ling, Jonathan Scarlett:
Optimal Rates of Teaching and Learning Under Uncertainty. IEEE Trans. Inf. Theory 67(11): 7067-7080 (2021) - [c1]Yan Hao Ling, Jonathan Scarlett:
Optimal Rates of Teaching and Learning Under Binary Symmetric Noise. ISIT 2021: 1356-1360 - [i2]Yan Hao Ling, Jonathan Scarlett:
Optimal Rates of Teaching and Learning Under Uncertainty. CoRR abs/2104.06565 (2021) - [i1]Yan Hao Ling, Jonathan Scarlett:
Simple Coding Techniques for Many-Hop Relaying. CoRR abs/2112.07120 (2021)
2010 – 2019
- 2018
- [j1]Kang Hao Cheong, Zong Xuan Tan, Yan Hao Ling:
A time-based switching scheme for nomadic-colonial alternation under noisy conditions. Commun. Nonlinear Sci. Numer. Simul. 60: 107-114 (2018)
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 2025-01-09 13:20 CET 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:
