default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPraneeth Kumar Vippathalla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Praneeth Kumar Vippathalla, Martin Wachiye Wafula, Mihai-Alin Badiu, Justin P. Coon:
On the Lossy Compression of Spatial Networks. ISIT 2024: 416-421- [i8]Sophie Taylor, Praneeth Kumar Vippathalla, Justin P. Coon:
The Asymptotic Behaviour of Information Leakage Metrics. CoRR abs/2409.13003 (2024) - 2023
- [j2]Praneeth Kumar Vippathalla
, Navin Kashyap:
The Secure Storage Capacity of a DNA Wiretap Channel Model. IEEE Trans. Inf. Theory 69(9): 5550-5569 (2023) - [j1]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement via Secure Omniscience. IEEE Trans. Inf. Theory 69(12): 8029-8053 (2023) - [c6]Martin Wachiye Wafula, Praneeth Kumar Vippathalla, Justin P. Coon, Mihai-Alin Badiu:
Rate-Distortion Function of the Stochastic Block Model. ACSSC 2023: 699-703 - [i7]Martin Wachiye Wafula, Praneeth Kumar Vippathalla, Justin P. Coon, Mihai-Alin Badiu:
Rate-Distortion Function of the Stochastic Block Model. CoRR abs/2309.14464 (2023) - [i6]Praneeth Kumar Vippathalla, Mihai-Alin Badiu, Justin P. Coon:
Graph Compression with Side Information at the Decoder. CoRR abs/2311.09111 (2023) - 2022
- [c5]Praneeth Kumar Vippathalla, Navin Kashyap:
The Secure Storage Capacity of a DNA Wiretap Channel Model. ISIT 2022: 1785-1790 - [c4]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. ITW 2022: 726-731 - [i5]Praneeth Kumar Vippathalla, Navin Kashyap:
The Secure Storage Capacity of a DNA Wiretap Channel Model. CoRR abs/2201.05995 (2022) - 2021
- [c3]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. ISIT 2021: 1624-1629 - [i4]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. CoRR abs/2102.01771 (2021) - [i3]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Wiretap Secret Key Agreement Via Secure Omniscience. CoRR abs/2112.00394 (2021) - 2020
- [c2]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Secure Information Exchange for Omniscience. ISIT 2020: 966-971
2010 – 2019
- 2019
- [c1]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. ISIT 2019: 947-951 - [i2]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. CoRR abs/1901.05817 (2019) - [i1]Chung Chan, Manuj Mukherjee, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement with Nearly No Discussion. CoRR abs/1904.11383 (2019)
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 12:58 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:
