default search action
Li Tang 0004
Person information
- affiliation: Iowa State University, Department of Electrical and Computer Engineering, Ames, IA, USA
Other persons with the same name
- Li Tang — disambiguation page
- Li Tang 0001
— Northeastern University, State Key Laboratory of Synthetical Automation for Process Industries, Shenyang, China (and 1 more)
- Li Tang 0002 — University of Iowa, Department of Ophthalmology and Visual Sciences, Iowa City, IA, USA
- Li Tang 0003
- Li Tang 0005
- Li Tang 0006
- Li Tang 0007
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j4]Aditya Ramamoorthy
Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings. IEEE Trans. Inf. Theory 68(4): 2684-2703 (2022) - 2021
- [c6]Aditya Ramamoorthy, Li Tang:
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. ISIT 2021: 1712-1717 - 2020
- [j3]Aditya Ramamoorthy
Straggler-Resistant Distributed Matrix Computation via Coding Theory: Removing a Bottleneck in Large-Scale Data Processing. IEEE Signal Process. Mag. 37(3): 136-145 (2020) - [i8]Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang:
Straggler-resistant distributed matrix computation via coding theory. CoRR abs/2002.03515 (2020)
2010 – 2019
- 2019
- [j2]Li Tang
Erasure Coding for Distributed Matrix Multiplication for Matrices With Bounded Entries. IEEE Commun. Lett. 23(1): 8-11 (2019) - [c5]Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. ISIT 2019: 1777-1781 - [i7]Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel:
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. CoRR abs/1901.10674 (2019) - [i6]Aditya Ramamoorthy, Li Tang:
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. CoRR abs/1910.06515 (2019) - 2018
- [j1]Li Tang
Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes. IEEE Trans. Inf. Theory 64(4): 3099-3120 (2018) - [c4]Anindya Bijoy Das
C3LES: Codes for Coded Computation that Leverage Stragglers. ITW 2018: 1-5 - [i5]Anindya Bijoy Das, Li Tang, Aditya Ramamoorthy:
C3LES: Codes for Coded Computation that Leverage Stragglers. CoRR abs/1809.06242 (2018) - [i4]Li Tang, Konstantinos Konstantinidis, Aditya Ramamoorthy:
Erasure coding for distributed matrix multiplication for matrices with bounded entries. CoRR abs/1811.02144 (2018) - 2017
- [c3]Li Tang, Aditya Ramamoorthy:
Low subpacketization schemes for coded caching. ISIT 2017: 2790-2794 - [i3]Li Tang, Aditya Ramamoorthy:
Low Subpacketization Schemes for Coded Caching. CoRR abs/1706.00101 (2017) - 2016
- [c2]Li Tang, Aditya Ramamoorthy:
Coded Caching with Low Subpacketization Levels. GLOBECOM Workshops 2016: 1-6 - [c1]Li Tang, Aditya Ramamoorthy:
Coded caching for networks with the resolvability property. ISIT 2016: 420-424 - [i2]Li Tang, Aditya Ramamoorthy:
Coded Caching for Networks with the Resolvability Property. CoRR abs/1605.01424 (2016) - [i1]Li Tang, Aditya Ramamoorthy:
Coded Caching with Low Subpacketization Levels. CoRR abs/1607.07920 (2016)
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-10-23 20:28 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: