


default search action
Jithin Ravi
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]K. V. Harsha, Jithin Ravi, Tobias Koch:
On the Second-Order Asymptotics of the Hoeffding Test and Other Divergence Tests. CoRR abs/2403.03537 (2024) - 2022
- [j7]Chao Qi
, Jithin Ravi:
Coded Caching With File and Demand Privacy. IEEE Commun. Lett. 26(9): 1979-1983 (2022) - [j6]Varun Narayanan, Jithin Ravi
, Vivek K. Mishra, Bikash Kumar Dey
, Nikhil Karamchandani
, Vinod M. Prabhakaran
:
Private Index Coding. IEEE Trans. Inf. Theory 68(3): 2020-2049 (2022) - [j5]Jithin Ravi
, Tobias Koch
:
Scaling Laws for Gaussian Random Many-Access Channels. IEEE Trans. Inf. Theory 68(4): 2429-2459 (2022) - [j4]Chinmay Gurjarpadhye, Jithin Ravi
, Sneha Kamath, Bikash Kumar Dey
, Nikhil Karamchandani
:
Fundamental Limits of Demand-Private Coded Caching. IEEE Trans. Inf. Theory 68(6): 4106-4134 (2022) - [c12]K. V. Harsha
, Jithin Ravi, Tobias Koch:
Second-Order Asymptotics of Hoeffding-Like Hypothesis Tests. ITW 2022: 654-659 - [i12]K. V. Harsha, Jithin Ravi, Tobias Koch:
Second-Order Asymptotics of Hoeffding-Like Hypothesis Tests. CoRR abs/2205.05631 (2022) - 2021
- [c11]Jithin Ravi, Tobias Koch:
Scaling Laws for Many-Access Channels and Unsourced Random Access. ACSCC 2021: 1482-1487 - [i11]Chinmay Gurjarpadhye, Jithin Ravi, Sneha Kamath, Bikash Kumar Dey, Nikhil Karamchandani:
Fundamental Limits of Demand-Private Coded Caching. CoRR abs/2101.07127 (2021) - 2020
- [j3]Deepesh Data
, Gowtham R. Kurri
, Jithin Ravi
, Vinod M. Prabhakaran
:
Interactive Secure Function Computation. IEEE Trans. Inf. Theory 66(9): 5492-5521 (2020) - [c10]Jithin Ravi, Tobias Koch:
Capacity per Unit-Energy of Gaussian Random Many-Access Channels. ISIT 2020: 3025-3030 - [c9]Chinmay Gurjarpadhye, Jithin Ravi, Bikash Kumar Dey, Nikhil Karamchandani:
Improved Memory-Rate Trade-off for Caching with Demand Privacy. ITW 2020: 1-5 - [c8]Sneha Kamath, Jithin Ravi, Bikash Kumar Dey:
Demand-Private Coded Caching and the Exact Trade-off for N=K=2. NCC 2020: 1-6 - [i10]Jithin Ravi, Tobias Koch:
Capacity per Unit-Energy of Gaussian Random Many-Access Channels. CoRR abs/2005.07436 (2020) - [i9]Varun Narayanan, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, Vinod M. Prabhakaran:
Private Index Coding. CoRR abs/2006.00257 (2020) - [i8]Jithin Ravi, Tobias Koch:
Scaling Laws for Gaussian Random Many-Access Channels. CoRR abs/2012.10350 (2020)
2010 – 2019
- 2019
- [j2]Jithin Ravi
, Bikash Kumar Dey
:
Function Computation Through a Bidirectional Relay. IEEE Trans. Inf. Theory 65(2): 902-916 (2019) - [c7]Jithin Ravi, Tobias Koch:
Capacity per Unit-Energy of Gaussian Many-Access Channels. ISIT 2019: 2763-2767 - [i7]Jithin Ravi, Tobias Koch:
Capacity per Unit-Energy of Gaussian Many-Access Channels. CoRR abs/1904.11742 (2019) - [i6]Sneha Kamath, Jithin Ravi, Bikash Kumar Dey:
Demand-Private Coded Caching and the Exact Trade-off for N=K=2. CoRR abs/1911.06995 (2019) - 2018
- [c6]Gowtham R. Kurri, Vinod M. Prabhakaran, Jithin Ravi
:
The Role of Interaction and Common Randomness in Two-User Secure Computation. ISIT 2018: 591-595 - [c5]Varun Narayanan, Vinod M. Prabhakaran, Jithin Ravi
, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani:
Private Index Coding. ISIT 2018: 596-600 - [i5]Deepesh Data, Gowtham R. Kurri, Jithin Ravi, Vinod M. Prabhakaran:
Interactive Secure Function Computation. CoRR abs/1812.03838 (2018) - 2016
- [j1]Jithin Ravi
, Bikash Kumar Dey, Emanuele Viterbo
:
Oblivious Transfer Over Wireless Channels. IEEE Trans. Commun. 64(3): 893-905 (2016) - [c4]Jithin Ravi
, Bikash Kumar Dey:
Broadcast Function Computation with Complementary Side Information. GLOBECOM Workshops 2016: 1-6 - [i4]Jithin Ravi, Bikash Kumar Dey:
Function Computation through a Bidirectional Relay. CoRR abs/1609.07923 (2016) - [i3]Jithin Ravi, Bikash Kumar Dey:
Broadcast Function Computation with Complementary Side Information. CoRR abs/1610.00867 (2016) - 2015
- [c3]Jithin Ravi
, Bikash Kumar Dey:
Zero-error function computation through a bidirectional relay. ITW 2015: 1-5 - [c2]Jithin Ravi
, Bikash Kumar Dey, Emanuele Viterbo
:
Oblivious transfer over OFDM and MIMO channels. ITW 2015: 1-5 - [i2]Jithin Ravi, Bikash Kumar Dey, Emanuele Viterbo:
Oblivious Transfer over Wireless Channels. CoRR abs/1508.00664 (2015) - 2014
- [i1]Jithin Ravi, Bikash Kumar Dey:
Zero-Error Function Computation through a Bidirectional Relay. CoRR abs/1411.6835 (2014) - 2012
- [c1]Jithin Ravi, Bikash Kumar Dey:
Exact topology inference for DAGs using network coding. NetCod 2012: 73-78
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-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint