default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTang Liu 0002
Person information
- affiliation: University of Illinois at Chicago, IL, USA
Other persons with the same name
- Tang Liu — disambiguation page
- Tang Liu 0001
![[0000-0002-9191-7222]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-9191-7222")
— Sichuan Normal University, College of Fundamental Education, Chengdu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j3]Tang Liu, Daniela Tuninetti:
Tight Information Theoretic Converse Results for Some Pliable Index Coding Problems. IEEE Trans. Inf. Theory 66(5): 2642-2657 (2020)- [c9]Tang Liu, Daniela Tuninetti:
Secure Decentralized Pliable Index Coding. ISIT 2020: 1729-1734 - [c8]Tang Liu, Daniela Tuninetti:
Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem. ITW 2020: 1-5 - [i8]Tang Liu, Daniela Tuninetti:
Secure Decentralized Pliable Index Coding. CoRR abs/2001.03810 (2020) - [i7]Tang Liu, Daniela Tuninetti:
Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem. CoRR abs/2010.10494 (2020)
2010 – 2019
- 2019
- [c7]Tang Liu, Daniela Tuninetti:
Decentralized Pliable Index Coding. ISIT 2019: 532-536 - [c6]Tang Liu, Daniela Tuninetti:
Private Pliable Index Coding. ITW 2019: 1-5 - [i6]Tang Liu, Daniela Tuninetti:
Private Pliable Index Coding. CoRR abs/1904.04468 (2019) - [i5]Tang Liu, Daniela Tuninetti:
Decentralized Pliable Index Coding. CoRR abs/1904.05272 (2019) - 2018
- [c5]Tang Liu, Daniela Tuninetti:
An Information Theoretic Converse for the "Consecutive Complete-S" PICOD Problem. ITW 2018: 1-5 - [i4]Tang Liu, Daniela Tuninetti:
An Information Theoretic Converse for the "Consecutive Complete-S" PICOD Problem. CoRR abs/1806.05148 (2018) - [i3]Tang Liu, Daniela Tuninetti:
Tight Information Theoretic Converse Results for some Pliable Index Coding Problems. CoRR abs/1810.02451 (2018) - 2017
- [j2]Tang Liu, Daniela Tuninetti, Sae-Young Chung:
On the DoF Region of the MIMO Gaussian Two-User Interference Channel With an Instantaneous Relay. IEEE Trans. Inf. Theory 63(7): 4453-4471 (2017) - [c4]Tang Liu, Daniela Tuninetti:
Information theoretic converse proofs for some PICOD problems. ITW 2017: 284-288 - 2016
- [j1]Zhiyu Cheng, Natasha Devroye, Tang Liu:
The Degrees of Freedom of Full-Duplex Bidirectional Interference Networks With and Without a MIMO Relay. IEEE Trans. Wirel. Commun. 15(4): 2912-2924 (2016) - [c3]Tang Liu, Daniela Tuninetti:
Pliable Index COding: Novel lower bound on the fraction of satisfied clients with a single transmission and its application. ITW 2016: 325-329 - 2015
- [c2]Tang Liu, Daniela Tuninetti, Sae-Young Chung:
On the DoF of two-user interference channel with an instantaneous relay. ISIT 2015: 1049-1053 - [i2]Tang Liu, Daniela Tuninetti, Sae-Young Chung:
On the DoF region of the two-user Interference Channel with an Instantaneous Relay. CoRR abs/1506.06558 (2015) - 2014
- [c1]Tang Liu, Daniela Tuninetti, Syed Ali Jafar:
The DoF of the asymmetric MIMO interference channel with square direct link channel matrices. Allerton 2014: 1260-1266 - [i1]Tang Liu, Daniela Tuninetti, Syed Ali Jafar:
The DoF of the Asymmetric MIMO Interference Channel with Square Direct Link Channel Matrices. CoRR abs/1410.5107 (2014)
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-04-24 21: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:
