default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrakash Narayan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Sagnik Bhattacharya
, Prakash Narayan:
Shared Information for a Markov Chain on a Tree. IEEE Trans. Inf. Theory 70(7): 4655-4666 (2024)- [j36]Ajaykrishnan Nageswaran, Prakash Narayan:
List Privacy Under Function Recoverability. IEEE Trans. Inf. Theory 70(9): 6620-6626 (2024) - 2023
- [j35]Ajaykrishnan Nageswaran, Prakash Narayan:
Corrections to "Distribution Privacy Under Function Recoverability". IEEE Trans. Inf. Theory 69(3): 1965 (2023) - [c36]Sagnik Bhattacharya, Prakash Narayan:
Shared Information for the Cliqueylon Graph. ISIT 2023: 1693-1698 - [i15]Ajaykrishnan Nageswaran, Prakash Narayan:
List Privacy Under Function Recoverability. CoRR abs/2307.05828 (2023) - [i14]Sagnik Bhattacharya, Prakash Narayan:
Shared Information for a Markov Chain on a Tree. CoRR abs/2307.15844 (2023) - 2022
- [j34]Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function Recoverability. IEEE Trans. Inf. Theory 68(5): 3317-3339 (2022) - [c35]Sagnik Bhattacharya, Prakash Narayan:
Shared Information for a Markov Chain on a Tree. ISIT 2022: 3049-3054 - 2021
- [c34]Sagnik Bhattacharya, Prakash Narayan:
Universal Single-Shot Sampling Rate Distortion. ISIT 2021: 2620-2624 - [c33]Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function $\rho$ -Recoverability. ISIT 2021: 3332-3337 - [i13]Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function Recoverability. CoRR abs/2103.08077 (2021) - 2020
- [c32]Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function Recoverability. ISIT 2020: 890-895
2010 – 2019
- 2019
- [j33]Ajaykrishnan Nageswaran, Prakash Narayan:
Data Privacy for a $\rho$ -Recoverable Function. IEEE Trans. Inf. Theory 65(6): 3470-3488 (2019) - [c31]Ajaykrishnan Nageswaran, Prakash Narayan:
Predicate Privacy and List Privacy for a ρ-Recoverable Function. ISIT 2019: 2139-2143 - 2018
- [j32]Vinay Praneeth Boda, Prakash Narayan:
Universal Sampling Rate Distortion. IEEE Trans. Inf. Theory 64(12): 7742-7758 (2018) - [c30]Ajaykrishnan Nageswaran, Prakash Narayan:
Data Privacy for a ρ-Recoverable Function. ISIT 2018: 1046-1050 - [i12]Ajaykrishnan Nageswaran, Prakash Narayan:
Data Privacy for a ρ-Recoverable Function. CoRR abs/1802.07851 (2018) - 2017
- [j31]Vinay Praneeth Boda, Prakash Narayan:
Sampling Rate Distortion. IEEE Trans. Inf. Theory 63(1): 563-574 (2017) - [c29]Vinay Praneeth Boda, Prakash Narayan:
Universal sampling rate distortion. ISIT 2017: 2008-2012 - [i11]Vinay Praneeth Boda, Prakash Narayan:
Universal Sampling Rate Distortion. CoRR abs/1706.07409 (2017) - 2016
- [j30]Prakash Narayan, Himanshu Tyagi:
Multiterminal Secrecy by Public Discussion. Found. Trends Commun. Inf. Theory 13(2-3): 129-275 (2016) - [c28]Vinay Praneeth Boda, Prakash Narayan:
Independent and memoryless sampling rate distortion. ISIT 2016: 2968-2972 - [i10]Vinay Praneeth Boda, Prakash Narayan:
Sampling Rate Distortion. CoRR abs/1607.04143 (2016) - 2015
- [c27]Vinay Praneeth Boda, Prakash Narayan:
Memoryless sampling rate distortion. Allerton 2015: 919-923 - [c26]Prakash Narayan, Himanshu Tyagi, Shun Watanabe:
Common randomness for secure computing. ISIT 2015: 949-953 - 2014
- [c25]Vinay Praneeth Boda, Prakash Narayan:
Sampling rate distortion. ISIT 2014: 3057-3061 - 2013
- [j29]Imre Csiszár, Prakash Narayan:
Secrecy Generation for Multiaccess Channel Models. IEEE Trans. Inf. Theory 59(1): 17-31 (2013) - [j28]Himanshu Tyagi, Prakash Narayan:
How Many Queries Will Resolve Common Randomness? IEEE Trans. Inf. Theory 59(9): 5363-5378 (2013) - [c24]Himanshu Tyagi, Prakash Narayan:
How many queries will resolve common randomness? ISIT 2013: 3165-3169 - [i9]Himanshu Tyagi, Prakash Narayan:
How Many Queries Will Resolve Common Randomness? CoRR abs/1305.1397 (2013) - 2012
- [j27]Chunxuan Ye, Prakash Narayan:
Secret Key and Private Key Constructions for Simple Multiterminal Source Models. IEEE Trans. Inf. Theory 58(2): 639-651 (2012) - [j26]Sirin Nitinawarat, Prakash Narayan:
Secret Key Generation for Correlated Gaussian Sources. IEEE Trans. Inf. Theory 58(6): 3373-3391 (2012) - 2011
- [j25]Himanshu Tyagi, Prakash Narayan, Piyush Gupta:
When Is a Function Securely Computable? IEEE Trans. Inf. Theory 57(10): 6337-6350 (2011) - [c23]Himanshu Tyagi, Prakash Narayan, Piyush Gupta:
When is a function securely computable? ISIT 2011: 2876-2880 - 2010
- [j24]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. IEEE Trans. Inf. Theory 56(12): 6482-6489 (2010) - [j23]Sirin Nitinawarat, Prakash Narayan:
Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing. IEEE Trans. Inf. Theory 56(12): 6490-6500 (2010) - [c22]Imre Csiszár, Prakash Narayan:
Capacity of a shared secret key. ISIT 2010: 2593-2596 - [c21]Himanshu Tyagi, Prakash Narayan, Piyush Gupta:
Secure computing. ISIT 2010: 2612-2616 - [c20]Sirin Nitinawarat, Prakash Narayan:
Perfect secrecy and combinatorial tree packing. ISIT 2010: 2622-2626 - [c19]Sirin Nitinawarat, Prakash Narayan:
Perfect omniscience, perfect secrecy and Steiner tree packing. ITA 2010: 362-366 - [i8]Himanshu Tyagi, Prakash Narayan, Piyush Gupta:
When is a Function Securely Computable? CoRR abs/1007.2945 (2010) - [i7]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. CoRR abs/1007.3518 (2010) - [i6]Sirin Nitinawarat, Prakash Narayan:
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing. CoRR abs/1008.1079 (2010) - [i5]Chunxuan Ye, Prakash Narayan:
Secret Key and Private Key Constructions for Simple Multiterminal Source Models. CoRR abs/1008.2122 (2010)
2000 – 2009
- 2009
- [c18]Prakash Narayan:
Multiterminal Secrecy Generation and Tree Packing. ICITS 2009: 127 - [c17]Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Chunxuan Ye, Alex Reznik:
Perfect secrecy, perfect omniscience and steiner tree packing. ISIT 2009: 1288-1292 - [c16]Himanshu Tyagi, Prakash Narayan:
The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function. ISIT 2009: 1954-1957 - [c15]Imre Csiszár, Prakash Narayan:
Secrecy generation for multiple input multiple output channel models. ISIT 2009: 2447-2451 - [c14]Imre Csiszár, Prakash Narayan:
Multiterminal secrecy generation. ITW 2009: 4 - [i4]Himanshu Tyagi, Prakash Narayan:
The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function. CoRR abs/0910.0653 (2009) - 2008
- [j22]Imre Csiszár, Prakash Narayan:
Secrecy Capacities for Multiterminal Channel Models. IEEE Trans. Inf. Theory 54(6): 2437-2452 (2008) - [c13]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Common Randomness, Multiuser Secrecy and Tree Packing. Allerton 2008: 217-220 - [c12]Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret key generation for a pairwise independent network model. ISIT 2008: 1015-1019 - 2007
- [j21]Arash Komaee, P. S. Krishnaprasad, Prakash Narayan:
Active pointing control for short range free-space optical communication. Commun. Inf. Syst. 7(2): 177-194 (2007) - [j20]Bernhard Steffen, Prakash Narayan:
Full Life-Cycle Support for End-to-End Processes. Computer 40(11): 64-73 (2007) - [j19]Kaushik Chakraborty, Prakash Narayan:
The Poisson Fading Channel. IEEE Trans. Inf. Theory 53(7): 2349-2364 (2007) - [c11]Arash Komaee, P. S. Krishnaprasad, Prakash Narayan:
Stochastic control for long range cooperative optical beam tracking. CDC 2007: 4938-4943 - [c10]Kaushik Chakraborty, Prakash Narayan:
The Poisson Fading Channel. CISS 2007: 331-332 - [c9]Imre Csiszár, Prakash Narayan:
On Multiterminal Secrecy Capacities. ISIT 2007: 2051-2055 - 2006
- [c8]Kaushik Chakraborty, Prakash Narayan:
Reliable Communication over an Optical Fading Channel. ITW 2006: 6-10 - 2005
- [c7]Chunxuan Ye, Prakash Narayan:
Secret key and private key constructions for simple multiterminal source models. ISIT 2005: 2133-2137 - [c6]Imre Csiszár, Prakash Narayan:
Secrecy capacities for multiterminal channel models. ISIT 2005: 2138-2141 - [c5]Chunxuan Ye, Prakash Narayan:
The secret key~private key capacity region for three terminals. ISIT 2005: 2142-2146 - [i3]Chunxuan Ye, Prakash Narayan:
The Secret Key-Private Key Capacity Region for Three Terminals. CoRR abs/cs/0511047 (2005) - [i2]Chunxuan Ye, Prakash Narayan:
Secret Key and Private Key Constructions for Simple Multiterminal Source Models. CoRR abs/cs/0511050 (2005) - [i1]Chunxuan Ye, Prakash Narayan:
The Private Key Capacity Region for Three Terminals. CoRR abs/cs/0511051 (2005) - 2004
- [j18]Imre Csiszár, Prakash Narayan:
Secrecy capacities for multiple terminals. IEEE Trans. Inf. Theory 50(12): 3047-3061 (2004) - [c4]Chunxuan Ye, Prakash Narayan:
The private key capacity region for three terminals. ISIT 2004: 44 - 2002
- [j17]Arnab Das, Prakash Narayan:
Capacities of time-varying multiple-access channels with side information. IEEE Trans. Inf. Theory 48(1): 4-25 (2002) - [j16]Sanjeev Khudanpur, Prakash Narayan:
Order estimation for a special class of hidden Markov sources and binary renewal processes. IEEE Trans. Inf. Theory 48(6): 1704-1713 (2002) - [c3]Imre Csiszár, Prakash Narayan:
The secret key capacity for multiple terminals. ITW 2002: 8-10 - 2001
- [c2]Arnab Das, Prakash Narayan:
Capacities of time-varying multiple-access channels with side information. ITW 2001: 107 - 2000
- [j15]Imre Csiszár, Prakash Narayan:
Common randomness and secret key generation with a helper. IEEE Trans. Inf. Theory 46(2): 344-366 (2000)
1990 – 1999
- 1998
- [j14]Amos Lapidoth, Prakash Narayan:
Reliable Communication Under Channel Uncertainty. IEEE Trans. Inf. Theory 44(6): 2148-2177 (1998) - [c1]Po-Ting Wu, Prakash Narayan:
Multithreaded performance analysis with Sun WorkShop thread event analyzer. SPDT 1998: 161 - 1996
- [j13]A. Kanlis, Prakash Narayan:
Error exponents for successive refinement by partitioning. IEEE Trans. Inf. Theory 42(1): 275-282 (1996) - [j12]Lorenzo Finesso, Chuang-Chun Liu, Prakash Narayan:
The optimal error exponent for Markov order estimation. IEEE Trans. Inf. Theory 42(5): 1488-1497 (1996) - 1995
- [j11]Imre Csiszár, Prakash Narayan:
Channel capacity for a given decoding metric. IEEE Trans. Inf. Theory 41(1): 35-43 (1995) - 1994
- [j10]Chuang-Chun Liu, Prakash Narayan:
Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures. IEEE Trans. Inf. Theory 40(4): 1167-1180 (1994) - 1991
- [j9]Imre Csiszár, Prakash Narayan:
Capacity of the Gaussian arbitrarily varying channel. IEEE Trans. Inf. Theory 37(1): 18-26 (1991)
1980 – 1989
- 1989
- [j8]Imre Csiszár, Prakash Narayan:
Capacity and decoding rules for classes of arbitrarily varying channels. IEEE Trans. Inf. Theory 35(4): 752-769 (1989) - 1988
- [j7]Imre Csiszár, Prakash Narayan:
Arbitrarily varying channels with constrained inputs and states. IEEE Trans. Inf. Theory 34(1): 27-34 (1988) - [j6]Imre Csiszár, Prakash Narayan:
The capacity of the arbitrarily varying channel revisited: Positivity, constraints. IEEE Trans. Inf. Theory 34(2): 181-193 (1988) - [j5]Brian L. Hughes, Prakash Narayan:
The capacity of a vector Gaussian arbitrarily varying channel. IEEE Trans. Inf. Theory 34(5): 995-1003 (1988) - 1987
- [j4]Brian L. Hughes, Prakash Narayan:
Gaussian arbitrarily varying channels. IEEE Trans. Inf. Theory 33(2): 267-284 (1987) - [j3]Prakash Narayan, Donald L. Snyder:
Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation. IEEE Trans. Inf. Theory 33(4): 539-556 (1987) - 1982
- [j2]Prakash Narayan:
The cutoff-rate region for multiple-access communication systems (D.Sc. Thesis abstr.). IEEE Trans. Inf. Theory 28(2): 393 (1982) - 1981
- [j1]Prakash Narayan, Donald L. Snyder:
The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same. IEEE Trans. Inf. Theory 27(4): 414-419 (1981)
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-03-04 21:26 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:
