default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYao Li 0007
Person information
- affiliation: Akamai Technologies, Inc., Santa Clara, CA, USA
- affiliation (former): UCLA, Los Angeles, CA, USA
- affiliation (Ph.D., 2012): Rutgers University, Piscataway, NJ, USA
Other persons with the same name
- Yao Li — disambiguation page
- Yao Li 0001 — Carleton University, Telecommunications Research Institute of Ontario, Ottawa, Canada
- Yao Li 0002 — Huazhong University of Science and Technology, China
- Yao Li 0003 — University of Adelaide, School of Computer Science, Australia
- Yao Li 0004
![[0000-0001-8720-883X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8720-883X")
— University of Pennsylvania, Department of Computer and Information Science, Philadelphia, PA, USA (and 2 more) - Yao Li 0005 — Southeast University, MOE Key Laboratory of Micro-Inertial Instrument and Advanced Navigation Technology, Nanjing, China
- Yao Li 0006 — University of California, Irvine, Irvine, CA, USA
- Yao Li 0008 — University of Maryland, Baltimore County, Baltimore, MD, USA
- Yao Li 0009 — Université Pierre et Marie Curie, Paris, France
- Yao Li 0010 — Shanghai Jiao Tong University, School of Biomedical Engineering, China
- Yao Li 0011 — ZheJiang Sci-Tech University, School of Information Science and Technology, Hangzhou, China
- Yao Li 0012 — Northeastern University, Shenyang, China
- Yao Li 0013 — Chinese Academy of Sciences, Key Laboratory of Mountain Hazards and Earth Surface Process, Chengdu, China
- Yao Li 0014 — Harbin Institute of Technology, State Key Laboratory of Robotics and System, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j7]Louis Tan, Yao Li, Ashish Khisti, Emina Soljanin:
Successive Segmentation-Based Coding for Broadcasting Over Erasure Channels. IEEE Trans. Inf. Theory 62(6): 3026-3038 (2016)- [c10]Philipp Schläfer, Chu-Hsiang Huang, Clayton Schoeny, Christian Weis, Yao Li, Norbert Wehn, Lara Dolecek:
Error resilience and energy efficiency: An LDPC decoder design study. DATE 2016: 588-593 - 2015
- [j6]Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Belief Propagation Algorithms on Noisy Hardware. IEEE Trans. Commun. 63(1): 11-24 (2015) - [j5]Yao Li, Yuejie Chi, Chu-Hsiang Huang, Lara Dolecek:
Orthogonal Matching Pursuit on Faulty Circuits. IEEE Trans. Commun. 63(7): 2541-2554 (2015) - [j4]Chu-Hsiang Huang, Yao Li, Lara Dolecek:
ACOCO: Adaptive Coding for Approximate Computing on Faulty Memories. IEEE Trans. Commun. 63(12): 4615-4628 (2015) - [c9]Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Adaptive error correction coding scheme for computations in the noisy min-sum decoder. ISIT 2015: 1906-1910 - 2014
- [j3]Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Gallager B LDPC Decoder with Transient and Permanent Errors. IEEE Trans. Commun. 62(1): 15-28 (2014) - [c8]Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Noisy belief propagation decoder. ACSSC 2014: 2111-2115 - [c7]Yao Li, Louis Tan, Ashish Khisti, Emina Soljanin:
Successive segmentation-based coding for broadcasting over erasure channels. ISIT 2014: 2172-2176 - 2013
- [j2]Yao Li, Emina Soljanin, Predrag Spasojevic:
Three schemes for wireless coded broadcast to heterogeneous users. Phys. Commun. 6: 114-123 (2013) - [c6]Yao Li, Lara Dolecek:
Effects of approximate representation in belief propagation for inference in wireless sensor networks. ACSSC 2013: 532-536 - [c5]Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Gallager B LDPC Decoder with Transient and permanent errors. ISIT 2013: 3010-3014 - [c4]Louis Tan, Yao Li, Ashish Khisti, Emina Soljanin:
Source broadcasting over erasure channels: Distortion bounds and code design. ITW 2013: 1-5 - 2012
- [c3]Yao Li, Péter Vingelmann, Morten Videbæk Pedersen, Emina Soljanin:
Round-robin streaming with generations. NetCod 2012: 143-148 - [i6]Yao Li, Emina Soljanin, Predrag Spasojevic:
Three Schemes for Wireless Coded Broadcast to Heterogeneous Users. CoRR abs/1205.4233 (2012) - [i5]Yao Li, Péter Vingelmann, Morten Videbæk Pedersen, Emina Soljanin:
Round-Robin Streaming with Generations. CoRR abs/1206.3014 (2012) - 2011
- [j1]Yao Li, Emina Soljanin, Predrag Spasojevic:
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding. IEEE Trans. Inf. Theory 57(2): 1111-1123 (2011) - 2010
- [c2]Yao Li, Emina Soljanin, Predrag Spasojevic:
Collecting coded coupons over generations. ISIT 2010: 2448-2452 - [i4]Yao Li, Emina Soljanin, Predrag Spasojevic:
Collecting Code Coupons Over Generations. CoRR abs/1002.1406 (2010) - [i3]Yao Li, Emina Soljanin, Predrag Spasojevic:
Collecting Coded Coupons over Overlapping Generations. CoRR abs/1002.1407 (2010) - [i2]Yao Li, Emina Soljanin, Predrag Spasojevic:
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding. CoRR abs/1011.3498 (2010)
2000 – 2009
- 2009
- [c1]Yao Li, Emina Soljanin:
Rateless codes for single-server streaming to diverse users. Allerton 2009: 1419-1426 - [i1]Yao Li, Emina Soljanin:
Rateless Codes for Single-Server Streaming to Diverse Users. CoRR abs/0912.5055 (2009)
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-12-19 23:08 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:
