Probabilistic Proof of the Interchangeability of ./M/1 Queues in Series. - Venkat Anantharam (Queueing Syst. Theory Appl., 1987)

A Generalization of the Erlang Formula of Traffic Engineering. - Venkat Anantharam; B. Gopinath; D. Hajela (Queueing Syst. Theory Appl., 1988)

Threshold Phenomena in the Transient Behaviour of Markovian Models of Communication Networks and Databases. - Venkat Anantharam (Queueing Syst. Theory Appl., 1989)

How Large Delays Build Up in a GI/G/1 Queue. - Venkat Anantharam (Queueing Syst. Theory Appl., 1989)

The optimal buffer allocation problem. - Venkat Anantharam (IEEE Trans. Inf. Theory, 1989)

A large deviations approach to error exponents in source coding and hypothesis testing. - Venkat Anantharam (IEEE Trans. Inf. Theory, 1990)

The stability region of the finite-user slotted ALOHA protocol. - Venkat Anantharam (IEEE Trans. Inf. Theory, 1991)

Effect of Noise on Long-term Memory in Cellular Automata with Asynchronous Delays between the Processors. - Reza Gharavi; Venkat Anantharam (Complex Syst., 1992)

Editorial introduction. - Venkat Anantharam; Ralph L. Disney; Jean C. Walrand (Queueing Syst. Theory Appl., 1993)

The input-output map of a monotone discrete-time quasireversible node. - Venkat Anantharam (IEEE Trans. Inf. Theory, 1993)

Correction to 'The Input-Output Map of a Monotone Discrete-Time Quasireversible Node'. - Venkat Anantharam (IEEE Trans. Inf. Theory, 1993)

Optimization of a Database Hierarchy for Mobility Tracking in a Personal Communications Network. - Venkat Anantharam; Michael L. Honig; U. Madhov; Victor K. Wei (Perform. Evaluation, 1994)

Burst reduction properties of the leaky bucket flow control scheme in ATM networks. - Venkat Anantharam; Takis Konstantopoulos (IEEE Trans. Commun., 1994)

Correctness within a constant of an optimal buffer allocation rule of thumb. - Venkat Anantharam; Ayalvadi J. Ganesh (IEEE Trans. Inf. Theory, 1994)

Optimal flow control schemes that regulate the burstiness of traffic. - Takis Konstantopoulos; Venkat Anantharam (IEEE/ACM Trans. Netw., 1995)

Achieving 100% Throughput in an Input-Queued Switch. - Nick McKeown; Venkat Anantharam; Jean C. Walrand (INFOCOM, 1996)

Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals. - Ayalvadi J. Ganesh; Venkat Anantharam (Queueing Syst. Theory Appl., 1996)

Bits through queues. - Venkat Anantharam; Sergio Verdú (IEEE Trans. Inf. Theory, 1996)

On the departure process of a leaky bucket system with long-range dependent input traffic. - Sokratis D. Vamvakos; Venkat Anantharam (Queueing Syst. Theory Appl., 1998)

The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels. - Sivarama Venkatesan; Venkat Anantharam (IEEE Trans. Inf. Theory, 1998)

Identification Plus Transmission Over Channels with Perfect Feedbac. - Sivarama Venkatesan; Venkat Anantharam (IEEE Trans. Inf. Theory, 1998)

Analysis and Comparison of TCP Reno and Vegas. - Jeonghoon Mo; Richard J. La; Venkat Anantharam; Jean C. Walrand (INFOCOM, 1999)

Scheduling Strategies and Long-Range Dependence. - Venkat Anantharam (Queueing Syst. Theory Appl., 1999)

A methodology for the design of optimal traffic shapers in communication networks. - Venkat Anantharam; Takis Konstantopoulos (IEEE Trans. Autom. Control., 1999)

Achieving 100% throughput in an input-queued switch. - Nick McKeown; Adisak Mekkittikul; Venkat Anantharam; Jean C. Walrand (IEEE Trans. Commun., 1999)

Optimal sequences and sum capacity of synchronous CDMA systems. - Pramod Viswanath; Venkat Anantharam (IEEE Trans. Inf. Theory, 1999)

Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers. - Pramod Viswanath; Venkat Anantharam; David N. C. Tse (IEEE Trans. Inf. Theory, 1999)

Charge-Sensitive TCP and Rate Control in the Internet. - Richard J. La; Venkat Anantharam (INFOCOM, 2000)

The common randomness capacity of a network of discrete memoryless channels. - Sivarama Venkatesan; Venkat Anantharam (IEEE Trans. Inf. Theory, 2000)

High throughput low-density parity-check decoder architectures. - Engling Yeo; Payam Pakzad; Borivoje Nikolic; Venkat Anantharam (GLOBECOM, 2001)

Window-Based Congestion Control with Heterogeneous Users. - Richard J. La; Venkat Anantharam (INFOCOM, 2001)

Asymptotically optimal water-filling in vector multiple-access channels. - Pramod Viswanath; David N. C. Tse; Venkat Anantharam (IEEE Trans. Inf. Theory, 2001)

Bufferless all-optical networking with erasure codes. - Venkat Anantharam (ITW, 2002)

Optimal routing control: repeated game approach. - Richard J. La; Venkat Anantharam (IEEE Trans. Autom. Control., 2002)

Optimal sequences for CDMA under colored noise: A Schur-saddle function property. - Pramod Viswanath; Venkat Anantharam (IEEE Trans. Inf. Theory, 2002)

Utility-based rate control in the Internet for elastic traffic. - Richard J. La; Venkat Anantharam (IEEE/ACM Trans. Netw., 2002)

A Game-theoretic Look at the Gaussian Multiaccess Channel. - Richard J. La; Venkat Anantharam (Advances in Network Information Theory, 2003)

A pairwise error probability bound for the exponential- server timing channel. - Aaron B. Wagner; Venkat Anantharam (ICC, 2003)

Iterative decoder architectures. - Engling Yeo; Venkat Anantharam (IEEE Commun. Mag., 2003)

Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum. - Pablo Anigstein; Venkat Anantharam (IEEE Trans. Inf. Theory, 2003)

On the Nash dynamics of congestion games with player-specific utility. - Venkat Anantharam (CDC, 2004)

Fourth order cumulant based frequency estimation. - Venkat Anantharam (Circuits, Signals, and Systems, 2004)

Feedback, queueing, and the reliability of the ideal Poisson channel above capacity. - Aaron B. Wagner; Venkat Anantharam (ISIT, 2004)

Queuing analysis with traffic models based on deterministic dynamical systems. - Venkat Anantharam (Comput. Sci. J. Moldova, 2004)

A New Look at the Generalized Distributive Law. - Payam Pakzad; Venkat Anantharam (IEEE Trans. Inf. Theory, 2004)

An improved outer bound for the multiterminal source-coding problem. - Aaron B. Wagner; Venkat Anantharam (ISIT, 2005)

An Infeasibility Result for the Multiterminal Source-Coding Problem - Aaron B. Wagner; Venkat Anantharam (CoRR, 2005)

Estimation and Marginalization Using the Kikuchi Approximation Methods. - Payam Pakzad; Venkat Anantharam (Neural Comput., 2005)

Regulating Functions on Partially Ordered Sets. - Venkat Anantharam; Takis Konstantopoulos (Order, 2005)

An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. - Reza Gharavi; Venkat Anantharam (Theor. Comput. Sci., 2005)

Zero-rate reliability of the exponential-server timing channel. - Aaron B. Wagner; Venkat Anantharam (IEEE Trans. Inf. Theory, 2005)

Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation. - Zhengya Zhang; Lara Dolecek; Borivoje Nikolic; Venkat Anantharam; Martin J. Wainwright (GLOBECOM, 2006)

A Synchronization Technique for Array-based LDPC Codes in Channels With Varying Sampling Rate. - Lara Dolecek; Venkat Anantharam (ISIT, 2006)

On the rod placement theorem of Rybko and Shlosman. - Venkat Anantharam (Queueing Syst. Theory Appl., 2006)

Exact emulation of a priority queue with a switch and delay lines. - Anand D. Sarwate; Venkat Anantharam (Queueing Syst. Theory Appl., 2006)

Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels. - Payam Pakzad; Venkat Anantharam (IEEE Trans. Commun., 2006)

Analysis of Absorbing Sets for Array-Based LDPC Codes. - Lara Dolecek; Zhengya Zhang; Venkat Anantharam; Martin J. Wainwright; Borivoje Nikolic (ICC, 2007)

Quantization Effects in Low-Density Parity-Check Decoders. - Zhengya Zhang; Lara Dolecek; Martin J. Wainwright; Venkat Anantharam; Borivoje Nikolic (ICC, 2007)

An Information Theoretic View of Stochastic Resonance. - Venkat Anantharam; Vivek S. Borkar (ISIT, 2007)

On Subsets of Binary Strings Immune to Multiple Repetition Errors. - Lara Dolecek; Venkat Anantharam (ISIT, 2007)

Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals. - Amin Aminzadeh Gohari; Venkat Anantharam (ISIT, 2007)

Common randomness and distributed control: A counterexample. - Venkat Anantharam; Vivek S. Borkar (Syst. Control. Lett., 2007)

Using Reed-Muller RM(1, m) Codes Over Channels With Synchronization and Substitution Errors. - Lara Dolecek; Venkat Anantharam (IEEE Trans. Inf. Theory, 2007)

An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variations. - Amin Aminzadeh Gohari; Venkat Anantharam (Allerton, 2008)

Anonymity under light traffic conditions using a network of mixes. - Parv Venkitasubramaniam; Venkat Anantharam (Allerton, 2008)

Lowering LDPC Error Floors by Postprocessing. - Zhengya Zhang; Lara Dolecek; Borivoje Nikolic; Venkat Anantharam; Martin J. Wainwright (GLOBECOM, 2008)

A Palm theory approach to error exponents. - Venkat Anantharam; François Baccelli (ISIT, 2008)

Prefixing method for correcting repetition errors. - Lara Dolecek; Venkat Anantharam (ISIT, 2008)

New bounds on the information-theoretic key agreement of multiple terminals. - Amin Aminzadeh Gohari; Venkat Anantharam (ISIT, 2008)

Error floors in LDPC codes: Fast simulation, bounds and hardware emulation. - Pamela Lee; Lara Dolecek; Zhengya Zhang; Venkat Anantharam; Borivoje Nikolic; Martin J. Wainwright (ISIT, 2008)

Efficiency of selfish investments in network security. - Libin Jiang; Venkat Anantharam; Jean C. Walrand (NetEcon, 2008)

A technique to study the correlation measures of binary sequences. - Venkat Anantharam (Discret. Math., 2008)

An Improved Outer Bound for Multiterminal Source Coding. - Aaron B. Wagner; Venkat Anantharam (IEEE Trans. Inf. Theory, 2008)

A generalized cut-set bound. - Amin Aminzadeh Gohari; Venkat Anantharam (ISIT, 2009)

Bounds on the mutual informations of the binary sums of Bernoulli random variables. - Payam Pakzad; Venkat Anantharam; Amin Shokrollahi (ISIT, 2009)

Recent progress in multiuser information theory with correlated sources. - Venkat Anantharam (WiOpt, 2009)

Predicting error floors of structured LDPC codes: deterministic bounds and estimates. - Lara Dolecek; Pamela Lee; Zhengya Zhang; Venkat Anantharam; Borivoje Nikolic; Martin J. Wainwright (IEEE J. Sel. Areas Commun., 2009)

Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices. - Zhengya Zhang; Lara Dolecek; Borivoje Nikolic; Venkat Anantharam; Martin J. Wainwright (IEEE Trans. Commun., 2009)

A new dual to the Gács-Körner common information defined via the Gray-Wyner system. - Sudeep Kamath; Venkat Anantharam (Allerton, 2010)

What risks lead to ruin. - Narayana Santhanam; Venkat Anantharam (Allerton, 2010)

Design of Network Topology in an Adversarial Environment. - Assane Gueye; Jean C. Walrand; Venkat Anantharam (GameSec, 2010)

On an outer bound and an inner bound for the general broadcast channel. - Amin Aminzadeh Gohari; Abbas El Gamal; Venkat Anantharam (ISIT, 2010)

Compressing a long range dependent renewal process. - Barlas Oguz; Venkat Anantharam (ISIT, 2010)

Information-Theoretic Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements - Venkat Anantharam; François Baccelli (CoRR, 2010)

An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors. - Zhengya Zhang; Venkat Anantharam; Martin J. Wainwright; Borivoje Nikolic (IEEE J. Solid State Circuits, 2010)

Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods. - Lara Dolecek; Venkat Anantharam (SIAM J. Discret. Math., 2010)

Counterexamples to a proposed stam inequality on finite groups. - Venkat Anantharam (IEEE Trans. Inf. Theory, 2010)

Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. - Lara Dolecek; Zhengya Zhang; Venkat Anantharam; Martin J. Wainwright; Borivoje Nikolic (IEEE Trans. Inf. Theory, 2010)

Information-theoretic key agreement of multiple terminals: part I. - Amin Aminzadeh Gohari; Venkat Anantharam (IEEE Trans. Inf. Theory, 2010)

Information-theoretic key agreement of multiple terminal: part II: channel model. - Amin Aminzadeh Gohari; Venkat Anantharam (IEEE Trans. Inf. Theory, 2010)

How to Choose Communication Links in an Adversarial Environment? - Assane Gueye; Jean C. Walrand; Venkat Anantharam (GAMENETS, 2011)

Stochastic approximation with 'bad' noise. - Venkat Anantharam; Vivek S. Borkar (ITA, 2011)

Generating dependent random variables over networks. - Amin Aminzadeh Gohari; Venkat Anantharam (ITW, 2011)

Stable, scalable, decentralized P2P file sharing with non-altruistic peers - Barlas Oguz; Venkat Anantharam; Ilkka Norros (CoRR, 2011)

How bad are selfish investments in network security? - Libin Jiang; Venkat Anantharam; Jean C. Walrand (IEEE/ACM Trans. Netw., 2011)

Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbon. - Sudeep Kamath; Venkat Anantharam (Allerton Conference, 2012)

Universal algorithms: Building a case for pointwise convergence. - Narayana P. Santhanam; Venkat Anantharam (Allerton Conference, 2012)

Prediction over countable alphabets. - Narayana P. Santhanam; Venkat Anantharam (CISS, 2012)

On Marton's inner bound for broadcast channels. - Amin Aminzadeh Gohari; Chandra Nair; Venkat Anantharam (ISIT, 2012)

Pointwise lossy source coding theorem for sources with memory. - Barlas Oguz; Venkat Anantharam (ISIT, 2012)

Long range dependent Markov chains with applications. - Barlas Oguz; Venkat Anantharam (ITA, 2012)

The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n - Varun S. Jog; Venkat Anantharam (CoRR, 2012)

Hurst Index of Functions of Long-Range-Dependent Markov Chains. - Barlas Oguz; Venkat Anantharam (J. Appl. Probab., 2012)

Stochastic approximation with long range dependent and heavy tailed noise. - Venkat Anantharam; Vivek S. Borkar (Queueing Syst. Theory Appl., 2012)

Evaluation of Marton's Inner Bound for the General Broadcast Channel. - Amin Aminzadeh Gohari; Venkat Anantharam (IEEE Trans. Inf. Theory, 2012)

On hypercontractivity and the mutual information between Boolean functions. - Venkat Anantharam; Amin Aminzadeh Gohari; Sudeep Kamath; Chandra Nair (Allerton, 2013)

Improved cardinality bounds on the auxiliary random variables in Marton's inner bound. - Venkat Anantharam; Amin Aminzadeh Gohari; Chandra Nair (ISIT, 2013)

The densest subgraph problem in sparse random graphs. - Venkat Anantharam; Justin Salez (CoRR, 2013)

On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover - Venkat Anantharam; Amin Aminzadeh Gohari; Sudeep Kamath; Chandra Nair (CoRR, 2013)

Convex relative entropy decay in Markov chains. - Varun S. Jog; Venkat Anantharam (CISS, 2014)

On hypercontractivity and a data processing inequality. - Venkat Anantharam; Amin Aminzadeh Gohari; Sudeep Kamath; Chandra Nair (ISIT, 2014)

An energy harvesting AWGN channel with a finite battery. - Varun S. Jog; Venkat Anantharam (ISIT, 2014)

Data-driven weak universal redundancy. - Narayana Prasad Santhanam; Venkat Anantharam; Aleksandar Kavcic; Wojciech Szpankowski (ISIT, 2014)

Data driven consistency (working title). - Narayana P. Santhanam; Venkat Anantharam; Aleksandar Kavcic; Wojciech Szpankowski (CoRR, 2014)

Infeasibility Proof and Information State in Network Information Theory. - Amin Aminzadeh Gohari; Venkat Anantharam (IEEE Trans. Inf. Theory, 2014)

On Marton's Inner Bound for the General Broadcast Channel. - Amin Aminzadeh Gohari; Abbas El Gamal; Venkat Anantharam (IEEE Trans. Inf. Theory, 2014)

The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order 2n. - Varun S. Jog; Venkat Anantharam (IEEE Trans. Inf. Theory, 2014)

On error exponents for a dimension-matched vector MAC with additive noise. - Venkat Anantharam; François Baccelli (ISIT, 2015)

On the geometry of convex typical sets. - Varun S. Jog; Venkat Anantharam (ISIT, 2015)

A variational formula for risk-sensitive reward. - Venkatachalam Anantharam; Vivek Shripad Borkar (CoRR, 2015)

Agnostic insurability of model classes. - Narayana P. Santhanam; Venkat Anantharam (J. Mach. Learn. Res., 2015)

Stable Distributed P2P Protocols Based on Random Peer Sampling. - Barlas Oguz; Venkat Anantharam; Ilkka Norros (IEEE/ACM Trans. Netw., 2015)

State estimation in energy harvesting systems. - Omur Ozel; Venkat Anantharam (ITA, 2016)

The Boolean model in the Shannon regime: three thresholds and related asymptotics. - Venkat Anantharam; François Baccelli (J. Appl. Probab., 2016)

A Geometric Analysis of the AWGN Channel With a (σ, ρ)-Power Constraint. - Varun S. Jog; Venkat Anantharam (IEEE Trans. Inf. Theory, 2016)

On Non-Interactive Simulation of Joint Distributions. - Sudeep Kamath; Venkat Anantharam (IEEE Trans. Inf. Theory, 2016)

Load balancing in hypergraphs. - Payam Delgosha; Venkat Anantharam (Allerton, 2017)

Comments On "Information-Theoretic Key Agreement of Multiple Terminals - Part I". - Amin Aminzadeh Gohari; Venkat Anantharam (IEEE Trans. Inf. Theory, 2017)

Gaussian Extremality for Derivatives of Differential Entropy under the Additive Gaussian Noise Flow. - Xiaobing Zhang; Venkat Anantharam; Yanlin Geng (ISIT, 2018)

A Combinatorial Proof of a Formula of Biane and Chapuy. - Sinho Chewi; Venkat Anantharam (Electron. J. Comb., 2018)

Gaussian Optimality for Derivatives of Differential Entropy Using Linear Matrix Inequalities. - Xiaobing Zhang; Venkat Anantharam; Yanlin Geng (Entropy, 2018)

A Variational Characterization of Rényi Divergences. - Venkat Anantharam (IEEE Trans. Inf. Theory, 2018)

Intrinsic Entropies of Log-Concave Distributions. - Varun S. Jog; Venkat Anantharam (IEEE Trans. Inf. Theory, 2018)

The Two-Unicast Problem. - Sudeep Kamath; Venkatachalam Anantharam; David Tse; Chih-Chun Wang (IEEE Trans. Inf. Theory, 2018)

Optimal Resource Allocation over Networks via Lottery-Based Mechanisms. - Soham R. Phade; Venkat Anantharam (GAMENETS, 2019)

A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs. - Payam Delgosha; Venkat Anantharam (CoRR, 2019)

On the Geometry of Nash and Correlated Equilibria with Cumulative Prospect Theoretic Preferences. - Soham R. Phade; Venkat Anantharam (Decis. Anal., 2019)

Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise. - Venkat Anantharam; François Baccelli (IEEE Trans. Inf. Theory, 2019)

On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels. - Venkat Anantharam; Amin Aminzadeh Gohari; Chandra Nair (IEEE Trans. Inf. Theory, 2019)

Black-Box Strategies and Equilibrium for Games with Cumulative Prospect Theoretic Players. - Soham R. Phade; Venkat Anantharam (CoRR, 2020)

Nash equilibrium structure of Cox process Hotelling games. - Venkat Anantharam; François Baccelli (CoRR, 2020)

Universal Lossless Compression of Graphical Data. - Payam Delgosha; Venkat Anantharam (IEEE Trans. Inf. Theory, 2020)

Type Graphs and Small-Set Expansion. - Lei Yu 003; Venkat Anantharam; Jun Chen 005 (ISIT, 2021)

Mechanism Design for Cumulative Prospect Theoretic Agents: A General Framework and the Revelation Principle. - Soham R. Phade; Venkat Anantharam (CoRR, 2021)

A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma. - Cheuk Ting Li; Venkat Anantharam (IEEE Trans. Inf. Theory, 2021)

One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information. - Cheuk Ting Li; Venkat Anantharam (IEEE Trans. Inf. Theory, 2021)

Data-Derived Weak Universal Consistency. - Narayana Santhanam; Venkatachalam Anantharam; Wojciech Szpankowski (J. Mach. Learn. Res., 2022)

Weakening the grip of the model. - Venkat Anantharam (Queueing Syst. Theory Appl., 2022)

Reversible Markov decision processes and the Gaussian free field. - Venkat Anantharam (Syst. Control. Lett., 2022)

Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. - Venkat Anantharam; Varun S. Jog; Chandra Nair (IEEE Trans. Inf. Theory, 2022)

Distributed Compression of Graphical Data. - Payam Delgosha; Venkat Anantharam (IEEE Trans. Inf. Theory, 2022)

A Deterministic Algorithm for the Capacity of Finite-State Channels. - Chengyu Wu; Guangyue Han; Venkat Anantharam; Brian H. Marcus (IEEE Trans. Inf. Theory, 2022)

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. - Payam Delgosha; Venkat Anantharam (IEEE J. Sel. Areas Inf. Theory, 2022)

A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs. - Payam Delgosha; Venkat Anantharam (IEEE Trans. Inf. Theory, 2023)

Learning in Games with Cumulative Prospect Theoretic Preferences. - Soham R. Phade; Venkat Anantharam (Dyn. Games Appl., 2023)

Sequential Channel Synthesis. - Lei Yu 003; Venkat Anantharam (IEEE Trans. Inf. Theory, 2023)

An Information-Theoretic Proof of the Shannon-Hagelbarger Theorem. - Venkat Anantharam (ISIT, 2024)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity. - Lei Yu 003; Venkat Anantharam; Jun Chen 005 (IEEE Trans. Inf. Theory, 2024)

Quantum advantage in decentralized control of POMDPs: A control-theoretic view of the Mermin-Peres square. - Venkat Anantharam (CoRR, 2025)

On Statistical Estimation of Edge-Reinforced Random Walks. - Qinghua Ding; Venkat Anantharam (CoRR, 2025)

The Density Formula Approach for Non-reversible Isomorphism Theorems, with Applications. - Qinghua Ding; Venkat Anantharam (CoRR, 2025)