The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same. - Prakash Narayan; Donald L. Snyder (IEEE Trans. Inf. Theory, 1981)

The cutoff-rate region for multiple-access communication systems (D.Sc. Thesis abstr.). - Prakash Narayan (IEEE Trans. Inf. Theory, 1982)

Gaussian arbitrarily varying channels. - Brian L. Hughes; Prakash Narayan (IEEE Trans. Inf. Theory, 1987)

Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation. - Prakash Narayan; Donald L. Snyder (IEEE Trans. Inf. Theory, 1987)

Arbitrarily varying channels with constrained inputs and states. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1988)

The capacity of the arbitrarily varying channel revisited: Positivity, constraints. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1988)

The capacity of a vector Gaussian arbitrarily varying channel. - Brian L. Hughes; Prakash Narayan (IEEE Trans. Inf. Theory, 1988)

Capacity and decoding rules for classes of arbitrarily varying channels. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1989)

Capacity of the Gaussian arbitrarily varying channel. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1991)

Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures. - Chuang-Chun Liu; Prakash Narayan (IEEE Trans. Inf. Theory, 1994)

Channel capacity for a given decoding metric. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1995)

The optimal error exponent for Markov order estimation. - Lorenzo Finesso; Chuang-Chun Liu; Prakash Narayan (IEEE Trans. Inf. Theory, 1996)

Error exponents for successive refinement by partitioning. - A. Kanlis; Prakash Narayan (IEEE Trans. Inf. Theory, 1996)

Multithreaded performance analysis with Sun WorkShop thread event analyzer. - Po-Ting Wu; Prakash Narayan (SPDT, 1998)

Reliable Communication Under Channel Uncertainty. - Amos Lapidoth; Prakash Narayan (IEEE Trans. Inf. Theory, 1998)

Common randomness and secret key generation with a helper. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2000)

The secret key capacity for multiple terminals. - Imre Csiszár; Prakash Narayan (ITW, 2002)

Capacities of time-varying multiple-access channels with side information. - Arnab Das 001; Prakash Narayan (IEEE Trans. Inf. Theory, 2002)

Order estimation for a special class of hidden Markov sources and binary renewal processes. - Sanjeev Khudanpur; Prakash Narayan (IEEE Trans. Inf. Theory, 2002)

The private key capacity region for three terminals. - Chunxuan Ye; Prakash Narayan (ISIT, 2004)

Secrecy capacities for multiple terminals. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2004)

The secret key private key capacity region for three terminals. - Chunxuan Ye; Prakash Narayan (ISIT, 2005)

Reliable Communication over an Optical Fading Channel. - Kaushik Chakraborty 002; Prakash Narayan (ITW, 2006)

Stochastic control for long range cooperative optical beam tracking. - Arash Komaee; P. S. Krishnaprasad; Prakash Narayan (CDC, 2007)

On Multiterminal Secrecy Capacities. - Imre Csiszár; Prakash Narayan (ISIT, 2007)

Active pointing control for short range free-space optical communication. - Arash Komaee; P. S. Krishnaprasad; Prakash Narayan (Commun. Inf. Syst., 2007)

Full Life-Cycle Support for End-to-End Processes. - Bernhard Steffen; Prakash Narayan (Computer, 2007)

The Poisson Fading Channel. - Kaushik Chakraborty 002; Prakash Narayan (IEEE Trans. Inf. Theory, 2007)

Common Randomness, Multiuser Secrecy and Tree Packing. - Sirin Nitinawarat; Chunxuan Ye; Alexander Barg; Prakash Narayan; Alex Reznik (Allerton, 2008)

Secrecy Capacities for Multiterminal Channel Models. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2008)

Multiterminal Secrecy Generation and Tree Packing. - Prakash Narayan (ICITS, 2009)

Secrecy generation for multiple input multiple output channel models. - Imre Csiszár; Prakash Narayan (ISIT, 2009)

Perfect secrecy, perfect omniscience and steiner tree packing. - Sirin Nitinawarat; Alexander Barg; Prakash Narayan; Chunxuan Ye; Alex Reznik (ISIT, 2009)

The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function. - Himanshu Tyagi; Prakash Narayan (ISIT, 2009)

Multiterminal secrecy generation. - Imre Csiszár; Prakash Narayan (ITW, 2009)

Capacity of a shared secret key. - Imre Csiszár; Prakash Narayan (ISIT, 2010)

Perfect secrecy and combinatorial tree packing. - Sirin Nitinawarat; Prakash Narayan (ISIT, 2010)

Secure computing. - Himanshu Tyagi; Prakash Narayan; Piyush Gupta (ISIT, 2010)

Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing. - Sirin Nitinawarat; Prakash Narayan (IEEE Trans. Inf. Theory, 2010)

Secret Key Generation for a Pairwise Independent Network Model. - Sirin Nitinawarat; Chunxuan Ye; Alexander Barg; Prakash Narayan; Alex Reznik (IEEE Trans. Inf. Theory, 2010)

When Is a Function Securely Computable? - Himanshu Tyagi; Prakash Narayan; Piyush Gupta (IEEE Trans. Inf. Theory, 2011)

Secret Key Generation for Correlated Gaussian Sources. - Sirin Nitinawarat; Prakash Narayan (IEEE Trans. Inf. Theory, 2012)

Secret Key and Private Key Constructions for Simple Multiterminal Source Models. - Chunxuan Ye; Prakash Narayan (IEEE Trans. Inf. Theory, 2012)

Secrecy Generation for Multiaccess Channel Models. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2013)

How Many Queries Will Resolve Common Randomness? - Himanshu Tyagi; Prakash Narayan (IEEE Trans. Inf. Theory, 2013)

Memoryless sampling rate distortion. - Vinay Praneeth Boda; Prakash Narayan (Allerton, 2015)

Common randomness for secure computing. - Prakash Narayan; Himanshu Tyagi; Shun Watanabe (ISIT, 2015)

Independent and memoryless sampling rate distortion. - Vinay Praneeth Boda; Prakash Narayan (ISIT, 2016)

Multiterminal Secrecy by Public Discussion. - Prakash Narayan; Himanshu Tyagi (Found. Trends Commun. Inf. Theory, 2016)

Sampling Rate Distortion. - Vinay Praneeth Boda; Prakash Narayan (IEEE Trans. Inf. Theory, 2017)

Data Privacy for a ρ-Recoverable Function. - Ajaykrishnan Nageswaran; Prakash Narayan (ISIT, 2018)

Universal Sampling Rate Distortion. - Vinay Praneeth Boda; Prakash Narayan (IEEE Trans. Inf. Theory, 2018)

Predicate Privacy and List Privacy for a ρ-Recoverable Function. - Ajaykrishnan Nageswaran; Prakash Narayan (ISIT, 2019)

Data Privacy for a $ rho$ -Recoverable Function. - Ajaykrishnan Nageswaran; Prakash Narayan (IEEE Trans. Inf. Theory, 2019)

Universal Single-Shot Sampling Rate Distortion. - Sagnik Bhattacharya; Prakash Narayan (ISIT, 2021)

Distribution Privacy Under Function $ rho$ -Recoverability. - Ajaykrishnan Nageswaran; Prakash Narayan (ISIT, 2021)

Distribution Privacy Under Function Recoverability. - Ajaykrishnan Nageswaran; Prakash Narayan (IEEE Trans. Inf. Theory, 2022)

Shared Information for the Cliqueylon Graph. - Sagnik Bhattacharya; Prakash Narayan (ISIT, 2023)

Corrections to "Distribution Privacy Under Function Recoverability". - Ajaykrishnan Nageswaran; Prakash Narayan (IEEE Trans. Inf. Theory, 2023)

Shared Information for a Markov Chain on a Tree. - Sagnik Bhattacharya; Prakash Narayan (IEEE Trans. Inf. Theory, 2024)

List Privacy Under Function Recoverability. - Ajaykrishnan Nageswaran; Prakash Narayan (IEEE Trans. Inf. Theory, 2024)