Venkat Anantharam

Orcid: 0000-0002-6214-7927

Affiliations:
  • University of California, Berkeley, USA


According to our database1, Venkat Anantharam authored at least 158 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity.
IEEE Trans. Inf. Theory, April, 2024

An Information-Theoretic Proof of the Shannon-Hagelbarger Theorem.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Sequential Channel Synthesis.
IEEE Trans. Inf. Theory, May, 2023

Learning in Games with Cumulative Prospect Theoretic Preferences.
Dyn. Games Appl., March, 2023

A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs.
IEEE Trans. Inf. Theory, February, 2023

2022
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs.
IEEE J. Sel. Areas Inf. Theory, December, 2022

A Deterministic Algorithm for the Capacity of Finite-State Channels.
IEEE Trans. Inf. Theory, 2022

Distributed Compression of Graphical Data.
IEEE Trans. Inf. Theory, 2022

Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality.
IEEE Trans. Inf. Theory, 2022

Reversible Markov decision processes and the Gaussian free field.
Syst. Control. Lett., 2022

Weakening the grip of the model.
Queueing Syst. Theory Appl., 2022

Data-Derived Weak Universal Consistency.
J. Mach. Learn. Res., 2022

2021
One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information.
IEEE Trans. Inf. Theory, 2021

A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma.
IEEE Trans. Inf. Theory, 2021

Mechanism Design for Cumulative Prospect Theoretic Agents: A General Framework and the Revelation Principle.
CoRR, 2021

Type Graphs and Small-Set Expansion.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Universal Lossless Compression of Graphical Data.
IEEE Trans. Inf. Theory, 2020

Nash equilibrium structure of Cox process Hotelling games.
CoRR, 2020

Black-Box Strategies and Equilibrium for Games with Cumulative Prospect Theoretic Players.
CoRR, 2020

2019
On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels.
IEEE Trans. Inf. Theory, 2019

Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise.
IEEE Trans. Inf. Theory, 2019

On the Geometry of Nash and Correlated Equilibria with Cumulative Prospect Theoretic Preferences.
Decis. Anal., 2019

A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs.
CoRR, 2019

Optimal Resource Allocation over Networks via Lottery-Based Mechanisms.
Proceedings of the Game Theory for Networks, 2019

2018
The Two-Unicast Problem.
IEEE Trans. Inf. Theory, 2018

Intrinsic Entropies of Log-Concave Distributions.
IEEE Trans. Inf. Theory, 2018

A Variational Characterization of Rényi Divergences.
IEEE Trans. Inf. Theory, 2018

Gaussian Optimality for Derivatives of Differential Entropy Using Linear Matrix Inequalities.
Entropy, 2018

A Combinatorial Proof of a Formula of Biane and Chapuy.
Electron. J. Comb., 2018

Gaussian Extremality for Derivatives of Differential Entropy under the Additive Gaussian Noise Flow.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Comments On "Information-Theoretic Key Agreement of Multiple Terminals - Part I".
IEEE Trans. Inf. Theory, 2017

Load balancing in hypergraphs.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
On Non-Interactive Simulation of Joint Distributions.
IEEE Trans. Inf. Theory, 2016

A Geometric Analysis of the AWGN Channel With a (σ, ρ)-Power Constraint.
IEEE Trans. Inf. Theory, 2016

The Boolean model in the Shannon regime: three thresholds and related asymptotics.
J. Appl. Probab., 2016

State estimation in energy harvesting systems.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

2015
Stable Distributed P2P Protocols Based on Random Peer Sampling.
IEEE/ACM Trans. Netw., 2015

Agnostic insurability of model classes.
J. Mach. Learn. Res., 2015

A variational formula for risk-sensitive reward.
CoRR, 2015

On the geometry of convex typical sets.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On error exponents for a dimension-matched vector MAC with additive noise.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order 2<sup>n</sup>.
IEEE Trans. Inf. Theory, 2014

On Marton's Inner Bound for the General Broadcast Channel.
IEEE Trans. Inf. Theory, 2014

Infeasibility Proof and Information State in Network Information Theory.
IEEE Trans. Inf. Theory, 2014

Data driven consistency (working title).
CoRR, 2014

Data-driven weak universal redundancy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An energy harvesting AWGN channel with a finite battery.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On hypercontractivity and a data processing inequality.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Convex relative entropy decay in Markov chains.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
CoRR, 2013

The densest subgraph problem in sparse random graphs.
CoRR, 2013

Improved cardinality bounds on the auxiliary random variables in Marton's inner bound.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On hypercontractivity and the mutual information between Boolean functions.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Evaluation of Marton's Inner Bound for the General Broadcast Channel.
IEEE Trans. Inf. Theory, 2012

Stochastic approximation with long range dependent and heavy tailed noise.
Queueing Syst. Theory Appl., 2012

Hurst Index of Functions of Long-Range-Dependent Markov Chains.
J. Appl. Probab., 2012

The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n
CoRR, 2012

Long range dependent Markov chains with applications.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Pointwise lossy source coding theorem for sources with memory.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On Marton's inner bound for broadcast channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Prediction over countable alphabets.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Universal algorithms: Building a case for pointwise convergence.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbon.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
How bad are selfish investments in network security?
IEEE/ACM Trans. Netw., 2011

Stable, scalable, decentralized P2P file sharing with non-altruistic peers
CoRR, 2011

Generating dependent random variables over networks.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Stochastic approximation with 'bad' noise.
Proceedings of the Information Theory and Applications Workshop, 2011

How to Choose Communication Links in an Adversarial Environment?
Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

2010
Information-theoretic key agreement of multiple terminal: part II: channel model.
IEEE Trans. Inf. Theory, 2010

Information-theoretic key agreement of multiple terminals: part I.
IEEE Trans. Inf. Theory, 2010

Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes.
IEEE Trans. Inf. Theory, 2010

Counterexamples to a proposed stam inequality on finite groups.
IEEE Trans. Inf. Theory, 2010

Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods.
SIAM J. Discret. Math., 2010

An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors.
IEEE J. Solid State Circuits, 2010

Information-Theoretic Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements
CoRR, 2010

Compressing a long range dependent renewal process.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On an outer bound and an inner bound for the general broadcast channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Design of Network Topology in an Adversarial Environment.
Proceedings of the Decision and Game Theory for Security, 2010

What risks lead to ruin.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

A new dual to the Gács-Körner common information defined via the Gray-Wyner system.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices.
IEEE Trans. Commun., 2009

Predicting error floors of structured LDPC codes: deterministic bounds and estimates.
IEEE J. Sel. Areas Commun., 2009

Recent progress in multiuser information theory with correlated sources.
Proceedings of the 7th International Symposium on Modeling and Optimization in Mobile, 2009

Bounds on the mutual informations of the binary sums of Bernoulli random variables.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A generalized cut-set bound.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
An Improved Outer Bound for Multiterminal Source Coding.
IEEE Trans. Inf. Theory, 2008

A technique to study the correlation measures of binary sequences.
Discret. Math., 2008

Efficiency of selfish investments in network security.
Proceedings of the ACM SIGCOMM 2008 Workshop on Economics of Networked Systems, 2008

Error floors in LDPC codes: Fast simulation, bounds and hardware emulation.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

New bounds on the information-theoretic key agreement of multiple terminals.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Prefixing method for correcting repetition errors.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A Palm theory approach to error exponents.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Lowering LDPC Error Floors by Postprocessing.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Anonymity under light traffic conditions using a network of mixes.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variations.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

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

Common randomness and distributed control: A counterexample.
Syst. Control. Lett., 2007

Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On Subsets of Binary Strings Immune to Multiple Repetition Errors.
Proceedings of the IEEE International Symposium on Information Theory, 2007

An Information Theoretic View of Stochastic Resonance.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Quantization Effects in Low-Density Parity-Check Decoders.
Proceedings of IEEE International Conference on Communications, 2007

Analysis of Absorbing Sets for Array-Based LDPC Codes.
Proceedings of IEEE International Conference on Communications, 2007

2006
Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels.
IEEE Trans. Commun., 2006

Exact emulation of a priority queue with a switch and delay lines.
Queueing Syst. Theory Appl., 2006

On the rod placement theorem of Rybko and Shlosman.
Queueing Syst. Theory Appl., 2006

A Synchronization Technique for Array-based LDPC Codes in Channels With Varying Sampling Rate.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
Zero-rate reliability of the exponential-server timing channel.
IEEE Trans. Inf. Theory, 2005

An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices.
Theor. Comput. Sci., 2005

Regulating Functions on Partially Ordered Sets.
Order, 2005

Estimation and Marginalization Using the Kikuchi Approximation Methods.
Neural Comput., 2005

An Infeasibility Result for the Multiterminal Source-Coding Problem
CoRR, 2005

An improved outer bound for the multiterminal source-coding problem.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
A New Look at the Generalized Distributive Law.
IEEE Trans. Inf. Theory, 2004

Queuing analysis with traffic models based on deterministic dynamical systems.
Comput. Sci. J. Moldova, 2004

Feedback, queueing, and the reliability of the ideal Poisson channel above capacity.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Fourth order cumulant based frequency estimation.
Proceedings of the Second IASTED International Conference on Circuits, 2004

On the Nash dynamics of congestion games with player-specific utility.
Proceedings of the 43rd IEEE Conference on Decision and Control, 2004

2003
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum.
IEEE Trans. Inf. Theory, 2003

Iterative decoder architectures.
IEEE Commun. Mag., 2003

A pairwise error probability bound for the exponential- server timing channel.
Proceedings of IEEE International Conference on Communications, 2003

A Game-theoretic Look at the Gaussian Multiaccess Channel.
Proceedings of the Advances in Network Information Theory, 2003

2002
Utility-based rate control in the Internet for elastic traffic.
IEEE/ACM Trans. Netw., 2002

Optimal sequences for CDMA under colored noise: A Schur-saddle function property.
IEEE Trans. Inf. Theory, 2002

Optimal routing control: repeated game approach.
IEEE Trans. Autom. Control., 2002

Bufferless all-optical networking with erasure codes.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
Asymptotically optimal water-filling in vector multiple-access channels.
IEEE Trans. Inf. Theory, 2001

Window-Based Congestion Control with Heterogeneous Users.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

High throughput low-density parity-check decoder architectures.
Proceedings of the Global Telecommunications Conference, 2001

2000
The common randomness capacity of a network of discrete memoryless channels.
IEEE Trans. Inf. Theory, 2000

Charge-Sensitive TCP and Rate Control in the Internet.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers.
IEEE Trans. Inf. Theory, 1999

Optimal sequences and sum capacity of synchronous CDMA systems.
IEEE Trans. Inf. Theory, 1999

Achieving 100% throughput in an input-queued switch.
IEEE Trans. Commun., 1999

A methodology for the design of optimal traffic shapers in communication networks.
IEEE Trans. Autom. Control., 1999

Scheduling Strategies and Long-Range Dependence.
Queueing Syst. Theory Appl., 1999

Analysis and Comparison of TCP Reno and Vegas.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998
Identification Plus Transmission Over Channels with Perfect Feedbac.
IEEE Trans. Inf. Theory, 1998

The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 1998

On the departure process of a leaky bucket system with long-range dependent input traffic.
Queueing Syst. Theory Appl., 1998

1996
Bits through queues.
IEEE Trans. Inf. Theory, 1996

Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals.
Queueing Syst. Theory Appl., 1996

Achieving 100% Throughput in an Input-Queued Switch.
Proceedings of the Proceedings IEEE INFOCOM '96, 1996

1995
Optimal flow control schemes that regulate the burstiness of traffic.
IEEE/ACM Trans. Netw., 1995

1994
Correctness within a constant of an optimal buffer allocation rule of thumb.
IEEE Trans. Inf. Theory, 1994

Burst reduction properties of the leaky bucket flow control scheme in ATM networks.
IEEE Trans. Commun., 1994

Optimization of a Database Hierarchy for Mobility Tracking in a Personal Communications Network.
Perform. Evaluation, 1994

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

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

Editorial introduction.
Queueing Syst. Theory Appl., 1993

1992
Effect of Noise on Long-term Memory in Cellular Automata with Asynchronous Delays between the Processors.
Complex Syst., 1992

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

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

1989
The optimal buffer allocation problem.
IEEE Trans. Inf. Theory, 1989

How Large Delays Build Up in a GI/G/1 Queue.
Queueing Syst. Theory Appl., 1989

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

1988
A Generalization of the Erlang Formula of Traffic Engineering.
Queueing Syst. Theory Appl., 1988

1987
Probabilistic Proof of the Interchangeability of ./M/1 Queues in Series.
Queueing Syst. Theory Appl., 1987


  Loading...