default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVenkat Anantharam
Venkatachalam Anantharam
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j88]Lei Yu
, Venkat Anantharam, Jun Chen:
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity. IEEE Trans. Inf. Theory 70(4): 2287-2308 (2024)- [c72]Venkat Anantharam:
An Information-Theoretic Proof of the Shannon-Hagelbarger Theorem. ISIT 2024: 3398-3401 - 2023
- [j87]Soham R. Phade, Venkat Anantharam:
Learning in Games with Cumulative Prospect Theoretic Preferences. Dyn. Games Appl. 13(1): 265-306 (2023) - [j86]Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs. IEEE Trans. Inf. Theory 69(2): 719-751 (2023) - [j85]Lei Yu, Venkat Anantharam:
Sequential Channel Synthesis. IEEE Trans. Inf. Theory 69(5): 2779-2795 (2023) - [i40]Payam Delgosha, Venkat Anantharam:
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. CoRR abs/2301.05742 (2023) - [i39]Venkat Anantharam:
An information-theoretic proof of the Shannon-Hagelbarger theorem. CoRR abs/2312.11404 (2023) - 2022
- [j84]Narayana Santhanam, Venkatachalam Anantharam, Wojciech Szpankowski:
Data-Derived Weak Universal Consistency. J. Mach. Learn. Res. 23: 27:1-27:55 (2022) - [j83]Payam Delgosha, Venkat Anantharam:
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. IEEE J. Sel. Areas Inf. Theory 3(4): 746-758 (2022) - [j82]Venkat Anantharam:
Weakening the grip of the model. Queueing Syst. Theory Appl. 100(3-4): 385-387 (2022) - [j81]Venkat Anantharam:
Reversible Markov decision processes and the Gaussian free field. Syst. Control. Lett. 169: 105382 (2022) - [j80]Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. IEEE Trans. Inf. Theory 68(3): 1412-1439 (2022) - [j79]Chengyu Wu, Guangyue Han, Venkat Anantharam, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 68(3): 1465-1479 (2022) - [j78]Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. IEEE Trans. Inf. Theory 68(12): 7665-7684 (2022) - [c71]Lei Yu, Venkat Anantharam:
Sequential Channel Synthesis. ISIT 2022: 1542-1547 - [i38]Lei Yu, Venkat Anantharam:
Sequential Channel Synthesis. CoRR abs/2202.03100 (2022) - [i37]Venkat Anantharam:
Reversible Markov decision processes and the Gaussian free field. CoRR abs/2207.05217 (2022) - 2021
- [j77]Cheuk Ting Li, Venkat Anantharam:
A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma. IEEE Trans. Inf. Theory 67(5): 2624-2651 (2021) - [j76]Cheuk Ting Li, Venkat Anantharam:
One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information. IEEE Trans. Inf. Theory 67(8): 5509-5525 (2021) - [c70]Lei Yu, Venkat Anantharam, Jun Chen:
Type Graphs and Small-Set Expansion. ISIT 2021: 993-998 - [c69]Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs. ISIT 2021: 2792-2797 - [i36]Soham R. Phade, Venkat Anantharam:
Mechanism Design for Cumulative Prospect Theoretic Agents: A General Framework and the Revelation Principle. CoRR abs/2101.08722 (2021) - [i35]Lei Yu, Venkat Anantharam, Jun Chen:
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity. CoRR abs/2102.00668 (2021) - [i34]Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs. CoRR abs/2107.08350 (2021) - 2020
- [j75]Payam Delgosha, Venkat Anantharam:
Universal Lossless Compression of Graphical Data. IEEE Trans. Inf. Theory 66(11): 6962-6976 (2020) - [c68]Payam Delgosha, Venkat Anantharam:
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. ISIT 2020: 2349-2354 - [i33]Soham R. Phade, Venkat Anantharam:
Black-Box Strategies and Equilibrium for Games with Cumulative Prospect Theoretic Players. CoRR abs/2004.09592 (2020) - [i32]Venkat Anantharam, François Baccelli:
Nash equilibrium structure of Cox process Hotelling games. CoRR abs/2008.06617 (2020)
2010 – 2019
- 2019
- [j74]Soham R. Phade, Venkat Anantharam:
On the Geometry of Nash and Correlated Equilibria with Cumulative Prospect Theoretic Preferences. Decis. Anal. 16(2): 142-156 (2019) - [j73]Venkat Anantharam, Amin Aminzadeh Gohari, Chandra Nair:
On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels. IEEE Trans. Inf. Theory 65(3): 1361-1371 (2019) - [j72]Venkat Anantharam, François Baccelli:
Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise. IEEE Trans. Inf. Theory 65(5): 2808-2823 (2019) - [c67]Soham R. Phade, Venkat Anantharam:
Optimal Resource Allocation over Networks via Lottery-Based Mechanisms. GAMENETS 2019: 51-70 - [c66]Cheuk Ting Li, Venkat Anantharam:
A Unified Framework for One-shot Achievability via the Poisson Matching Lemma. ISIT 2019: 942-946 - [c65]Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. ISIT 2019: 1847-1851 - [i31]Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. CoRR abs/1901.06619 (2019) - [i30]Payam Delgosha, Venkat Anantharam:
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs. CoRR abs/1908.00964 (2019) - [i29]Payam Delgosha, Venkat Anantharam:
Universal Lossless Compression of Graphical Data. CoRR abs/1909.09844 (2019) - 2018
- [j71]Sinho Chewi, Venkat Anantharam:
A Combinatorial Proof of a Formula of Biane and Chapuy. Electron. J. Comb. 25(1): 1 (2018) - [j70]Xiaobing Zhang, Venkat Anantharam, Yanlin Geng:
Gaussian Optimality for Derivatives of Differential Entropy Using Linear Matrix Inequalities. Entropy 20(3): 182 (2018) - [j69]Varun S. Jog, Venkat Anantharam:
Intrinsic Entropies of Log-Concave Distributions. IEEE Trans. Inf. Theory 64(1): 93-108 (2018) - [j68]Sudeep Kamath, Venkatachalam Anantharam, David Tse, Chih-Chun Wang:
The Two-Unicast Problem. IEEE Trans. Inf. Theory 64(5): 3865-3882 (2018) - [j67]Venkat Anantharam:
A Variational Characterization of Rényi Divergences. IEEE Trans. Inf. Theory 64(11): 6979-6989 (2018) - [c64]Cheuk Ting Li, Venkat Anantharam:
One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information. Allerton 2018: 259-266 - [c63]Xiaobing Zhang, Venkat Anantharam, Yanlin Geng:
Gaussian Extremality for Derivatives of Differential Entropy under the Additive Gaussian Noise Flow. ISIT 2018: 1605-1609 - [c62]Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. ISIT 2018: 2216-2220 - [i28]Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. CoRR abs/1802.07446 (2018) - [i27]Soham R. Phade, Venkat Anantharam:
Learning in Games with Cumulative Prospect Theoretic Preferences. CoRR abs/1804.08005 (2018) - [i26]Cheuk Ting Li, Venkat Anantharam:
One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information. CoRR abs/1809.01793 (2018) - [i25]Soham R. Phade, Venkat Anantharam:
Optimal Resource Allocation over Networks via Lottery-Based Mechanisms. CoRR abs/1812.00501 (2018) - [i24]Cheuk Ting Li, Venkat Anantharam:
A Unified Framework for One-shot Achievability via the Poisson Matching Lemma. CoRR abs/1812.03616 (2018) - 2017
- [j66]Amin Aminzadeh Gohari, Venkat Anantharam:
Comments On "Information-Theoretic Key Agreement of Multiple Terminals - Part I". IEEE Trans. Inf. Theory 63(8): 5440-5442 (2017) - [c61]Payam Delgosha, Venkat Anantharam:
Load balancing in hypergraphs. Allerton 2017: 45-52 - [c60]Soham R. Phade, Venkat Anantharam:
On the geometry of nash and correlated equilibria with cumulative prospect theoretic preferences. Allerton 2017: 724-731 - [c59]Venkat Anantharam:
A variational characterization of Rényi divergences. ISIT 2017: 893-897 - [c58]Payam Delgosha, Venkat Anantharam:
Universal lossless compression of graphical data. ISIT 2017: 1578-1582 - [i23]Venkat Anantharam:
A Variational Characterization of Rényi Divergences. CoRR abs/1701.07796 (2017) - [i22]Varun S. Jog, Venkat Anantharam:
Intrinsic entropies of log-concave distributions. CoRR abs/1702.01203 (2017) - [i21]Sinho Chewi, Venkat Anantharam:
A combinatorial proof of a formula of Biane and Chapuy. CoRR abs/1705.10925 (2017) - [i20]Payam Delgosha, Venkat Anantharam:
Load Balancing in Hypergraphs. CoRR abs/1710.00308 (2017) - [i19]Soham R. Phade, Venkat Anantharam:
On the Geometry of Nash and Correlated Equilibria with Cumulative Prospect Theoretic Preferences. CoRR abs/1712.00859 (2017) - 2016
- [j65]Venkat Anantharam, François Baccelli:
The Boolean model in the Shannon regime: three thresholds and related asymptotics. J. Appl. Probab. 53(4): 1001-1018 (2016) - [j64]Sudeep Kamath, Venkat Anantharam:
On Non-Interactive Simulation of Joint Distributions. IEEE Trans. Inf. Theory 62(6): 3419-3435 (2016) - [j63]Varun S. Jog, Venkat Anantharam:
A Geometric Analysis of the AWGN Channel With a (σ, ρ)-Power Constraint. IEEE Trans. Inf. Theory 62(8): 4413-4438 (2016) - [c57]Omur Ozel, Venkat Anantharam:
State estimation in energy harvesting systems. ITA 2016: 1-9 - 2015
- [j62]Narayana P. Santhanam, Venkat Anantharam:
Agnostic insurability of model classes. J. Mach. Learn. Res. 16: 2329-2355 (2015) - [j61]Barlas Oguz, Venkat Anantharam, Ilkka Norros:
Stable Distributed P2P Protocols Based on Random Peer Sampling. IEEE/ACM Trans. Netw. 23(5): 1444-1456 (2015) - [c56]Varun S. Jog, Venkat Anantharam:
A geometric analysis of the AWGN channel with a (σ, ρ)-power constraint. ISIT 2015: 121-125 - [c55]Varun S. Jog, Venkat Anantharam:
On the geometry of convex typical sets. ISIT 2015: 829-833 - [c54]Venkat Anantharam, François Baccelli:
On error exponents for a dimension-matched vector MAC with additive noise. ISIT 2015: 934-938 - [i18]Venkatachalam Anantharam, Vivek Shripad Borkar:
A variational formula for risk-sensitive reward. CoRR abs/1501.00676 (2015) - [i17]Varun S. Jog, Venkat Anantharam:
A Geometric Analysis of the AWGN channel with a $(σ, ρ)$-Power Constraint. CoRR abs/1504.05182 (2015) - [i16]Sudeep Kamath, Venkat Anantharam:
On Non-Interactive Simulation of Joint Distributions. CoRR abs/1505.00769 (2015) - [i15]Sudeep Kamath, Venkat Anantharam, David N. C. Tse, Chih-Chun Wang:
The two-unicast problem. CoRR abs/1506.01105 (2015) - 2014
- [j60]Amin Aminzadeh Gohari, Abbas El Gamal, Venkat Anantharam:
On Marton's Inner Bound for the General Broadcast Channel. IEEE Trans. Inf. Theory 60(7): 3748-3762 (2014) - [j59]Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order 2n. IEEE Trans. Inf. Theory 60(7): 3773-3786 (2014) - [j58]Amin Aminzadeh Gohari, Venkat Anantharam:
Infeasibility Proof and Information State in Network Information Theory. IEEE Trans. Inf. Theory 60(10): 5992-6004 (2014) - [c53]Varun S. Jog, Venkat Anantharam:
Convex relative entropy decay in Markov chains. CISS 2014: 1-6 - [c52]Varun S. Jog, Venkat Anantharam:
An energy harvesting AWGN channel with a finite battery. ISIT 2014: 806-810 - [c51]Narayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data-driven weak universal redundancy. ISIT 2014: 1877-1881 - [c50]Venkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair:
On hypercontractivity and a data processing inequality. ISIT 2014: 3022-3026 - [i14]Venkat Anantharam, François Baccelli:
The Boolean Model in the Shannon Regime: Three Thresholds and Related Asymptotics. CoRR abs/1408.1338 (2014) - [i13]Narayana P. Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data driven consistency (working title). CoRR abs/1411.4407 (2014) - 2013
- [c49]Venkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair:
On hypercontractivity and the mutual information between Boolean functions. Allerton 2013: 13-19 - [c48]Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for groups of order 2n. ISIT 2013: 594-598 - [c47]Venkat Anantharam, Amin Aminzadeh Gohari, Chandra Nair:
Improved cardinality bounds on the auxiliary random variables in Marton's inner bound. ISIT 2013: 1272-1276 - [i12]Venkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair:
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover. CoRR abs/1304.6133 (2013) - [i11]Venkat Anantharam, Justin Salez:
The densest subgraph problem in sparse random graphs. CoRR abs/1312.4494 (2013) - 2012
- [j57]Barlas Oguz, Venkat Anantharam:
Hurst Index of Functions of Long-Range-Dependent Markov Chains. J. Appl. Probab. 49(2): 451-471 (2012) - [j56]Venkat Anantharam, Vivek S. Borkar:
Stochastic approximation with long range dependent and heavy tailed noise. Queueing Syst. Theory Appl. 71(1-2): 221-242 (2012) - [j55]Amin Aminzadeh Gohari, Venkat Anantharam:
Evaluation of Marton's Inner Bound for the General Broadcast Channel. IEEE Trans. Inf. Theory 58(2): 608-619 (2012) - [c46]Narayana P. Santhanam, Venkat Anantharam:
Universal algorithms: Building a case for pointwise convergence. Allerton Conference 2012: 489-493 - [c45]Barlas Oguz, Venkat Anantharam, Ilkka Norros:
Stable, distributed P2P protocols based on random peer sampling. Allerton Conference 2012: 915-919 - [c44]Sudeep Kamath, Venkat Anantharam:
Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbon. Allerton Conference 2012: 1057-1064 - [c43]Narayana P. Santhanam, Venkat Anantharam:
Prediction over countable alphabets. CISS 2012: 1-6 - [c42]Barlas Oguz, Venkat Anantharam:
Pointwise lossy source coding theorem for sources with memory. ISIT 2012: 363-367 - [c41]Amin Aminzadeh Gohari, Chandra Nair, Venkat Anantharam:
On Marton's inner bound for broadcast channels. ISIT 2012: 581-585 - [c40]Barlas Oguz, Venkat Anantharam:
Long range dependent Markov chains with applications. ITA 2012: 274-280 - [i10]Amin Aminzadeh Gohari, Chandra Nair, Venkat Anantharam:
On Marton's inner bound for broadcast channels. CoRR abs/1202.0898 (2012) - [i9]Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n. CoRR abs/1207.6355 (2012) - [i8]Narayana P. Santhanam, Venkat Anantharam:
Agnostic insurability of model classes. CoRR abs/1212.3866 (2012) - 2011
- [j54]Libin Jiang, Venkat Anantharam, Jean C. Walrand:
How bad are selfish investments in network security? IEEE/ACM Trans. Netw. 19(2): 549-560 (2011) - [c39]Assane Gueye, Jean C. Walrand, Venkat Anantharam:
How to Choose Communication Links in an Adversarial Environment? GAMENETS 2011: 233-248 - [c38]Venkat Anantharam, Vivek S. Borkar:
Stochastic approximation with 'bad' noise. ITA 2011: 28-29 - [c37]Amin Aminzadeh Gohari, Venkat Anantharam:
Generating dependent random variables over networks. ITW 2011: 698-702 - [i7]Amin Aminzadeh Gohari, Venkat Anantharam:
Generating Dependent Random Variables Over Networks. CoRR abs/1105.1505 (2011) - [i6]Barlas Oguz, Venkat Anantharam, Ilkka Norros:
Stable, scalable, decentralized P2P file sharing with non-altruistic peers. CoRR abs/1107.3166 (2011) - 2010
- [j53]Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic:
An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors. IEEE J. Solid State Circuits 45(4): 843-855 (2010) - [j52]Lara Dolecek, Venkat Anantharam:
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods. SIAM J. Discret. Math. 23(4): 2120-2146 (2010) - [j51]Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic:
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. IEEE Trans. Inf. Theory 56(1): 181-201 (2010) - [j50]Venkat Anantharam:
Counterexamples to a proposed stam inequality on finite groups. IEEE Trans. Inf. Theory 56(4): 1825-1827 (2010) - [j49]Amin Aminzadeh Gohari, Venkat Anantharam:
Information-theoretic key agreement of multiple terminals: part I. IEEE Trans. Inf. Theory 56(8): 3973-3996 (2010) - [j48]Amin Aminzadeh Gohari, Venkat Anantharam:
Information-theoretic key agreement of multiple terminal: part II: channel model. IEEE Trans. Inf. Theory 56(8): 3997-4010 (2010) - [c36]Narayana Santhanam, Venkat Anantharam:
What risks lead to ruin. Allerton 2010: 844-850 - [c35]Sudeep Kamath, Venkat Anantharam:
A new dual to the Gács-Körner common information defined via the Gray-Wyner system. Allerton 2010: 1340-1346 - [c34]Assane Gueye, Jean C. Walrand, Venkat Anantharam:
Design of Network Topology in an Adversarial Environment. GameSec 2010: 1-20 - [c33]Amin Aminzadeh Gohari, Abbas El Gamal, Venkat Anantharam:
On an outer bound and an inner bound for the general broadcast channel. ISIT 2010: 540-544 - [c32]Barlas Oguz, Venkat Anantharam:
Compressing a long range dependent renewal process. ISIT 2010: 1443-1447 - [i5]Amin Aminzadeh Gohari, Abbas El Gamal, Venkat Anantharam:
On an Outer bound and an Inner Bound for the General Broadcast Channel. CoRR abs/1006.5166 (2010) - [i4]Venkat Anantharam, François Baccelli:
Information-Theoretic Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements. CoRR abs/1012.4924 (2010)
2000 – 2009
- 2009
- [j47]Lara Dolecek, Pamela Lee, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, Martin J. Wainwright:
Predicting error floors of structured LDPC codes: deterministic bounds and estimates. IEEE J. Sel. Areas Commun. 27(6): 908-917 (2009) - [j46]Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin J. Wainwright:
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices. IEEE Trans. Commun. 57(11): 3258-3268 (2009) - [c31]Amin Aminzadeh Gohari, Venkat Anantharam:
A generalized cut-set bound. ISIT 2009: 99-103 - [c30]Payam Pakzad, Venkat Anantharam, Amin Shokrollahi:
Bounds on the mutual informations of the binary sums of Bernoulli random variables. ISIT 2009: 304-308 - [c29]Amin Aminzadeh Gohari, Venkat Anantharam:
Evaluation of Marton's inner bound for the general broadcast channel. ISIT 2009: 2462-2466 - [c28]Venkat Anantharam:
Recent progress in multiuser information theory with correlated sources. WiOpt 2009: 1-2 - [e1]Bruce E. Hajek, Leandros Tassiulas, Venkat Anantharam, Ioannis Kontoyiannis:
2009 IEEE Information Theory Workshop, ITW 2009, Volos, Greece, June 10-12, 2009. IEEE 2009, ISBN 978-1-4244-4536-3 [contents] - [i3]Amin Aminzadeh Gohari, Venkat Anantharam:
Evaluation of Marton's Inner Bound for the General Broadcast Channel. CoRR abs/0904.4541 (2009) - [i2]Amin Aminzadeh Gohari, Venkat Anantharam:
A Generalized Cut-Set Bound. CoRR abs/0904.4542 (2009) - 2008
- [j45]Venkat Anantharam:
A technique to study the correlation measures of binary sequences. Discret. Math. 308(24): 6203-6209 (2008) - [j44]Aaron B. Wagner, Venkat Anantharam:
An Improved Outer Bound for Multiterminal Source Coding. IEEE Trans. Inf. Theory 54(5): 1919-1937 (2008) - [c27]Amin Aminzadeh Gohari, Venkat Anantharam:
An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variations. Allerton 2008: 301-308 - [c26]Parv Venkitasubramaniam, Venkat Anantharam:
Anonymity under light traffic conditions using a network of mixes. Allerton 2008: 1373-1380 - [c25]Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin J. Wainwright:
Lowering LDPC Error Floors by Postprocessing. GLOBECOM 2008: 3074-3079 - [c24]Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, Martin J. Wainwright:
Error floors in LDPC codes: Fast simulation, bounds and hardware emulation. ISIT 2008: 444-448 - [c23]Amin Aminzadeh Gohari, Venkat Anantharam:
New bounds on the information-theoretic key agreement of multiple terminals. ISIT 2008: 742-746 - [c22]Lara Dolecek, Venkat Anantharam:
Prefixing method for correcting repetition errors. ISIT 2008: 965-969 - [c21]Venkat Anantharam, François Baccelli:
A Palm theory approach to error exponents. ISIT 2008: 1768-1772 - [c20]Libin Jiang, Venkat Anantharam, Jean C. Walrand:
Efficiency of selfish investments in network security. NetEcon 2008: 31-36 - 2007
- [j43]Venkat Anantharam, Vivek S. Borkar:
Common randomness and distributed control: A counterexample. Syst. Control. Lett. 56(7-8): 568-572 (2007) - [j42]Lara Dolecek, Venkat Anantharam:
Using Reed-Muller RM(1, m) Codes Over Channels With Synchronization and Substitution Errors. IEEE Trans. Inf. Theory 53(4): 1430-1443 (2007) - [c19]Zhengya Zhang, Lara Dolecek, Martin J. Wainwright, Venkat Anantharam, Borivoje Nikolic:
Quantization Effects in Low-Density Parity-Check Decoders. ICC 2007: 6231-6237 - [c18]Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic:
Analysis of Absorbing Sets for Array-Based LDPC Codes. ICC 2007: 6261-6268 - [c17]Venkat Anantharam, Vivek S. Borkar:
An Information Theoretic View of Stochastic Resonance. ISIT 2007: 966-970 - [c16]Lara Dolecek, Venkat Anantharam:
On Subsets of Binary Strings Immune to Multiple Repetition Errors. ISIT 2007: 1691-1695 - [c15]Amin Aminzadeh Gohari, Venkat Anantharam:
Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple Terminals. ISIT 2007: 2056-2060 - 2006
- [j41]Venkat Anantharam:
On the rod placement theorem of Rybko and Shlosman. Queueing Syst. Theory Appl. 52(3): 185-188 (2006) - [j40]Anand D. Sarwate, Venkat Anantharam:
Exact emulation of a priority queue with a switch and delay lines. Queueing Syst. Theory Appl. 53(3): 115-125 (2006) - [j39]Payam Pakzad, Venkat Anantharam:
Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels. IEEE Trans. Commun. 54(7): 1149-1153 (2006) - [c14]Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin J. Wainwright:
Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation. GLOBECOM 2006 - [c13]Lara Dolecek, Venkat Anantharam:
A Synchronization Technique for Array-based LDPC Codes in Channels With Varying Sampling Rate. ISIT 2006: 2057-2061 - 2005
- [j38]Payam Pakzad, Venkat Anantharam:
Estimation and Marginalization Using the Kikuchi Approximation Methods. Neural Comput. 17(8): 1836-1873 (2005) - [j37]Venkat Anantharam, Takis Konstantopoulos:
Regulating Functions on Partially Ordered Sets. Order 22(2): 145-183 (2005) - [j36]Reza Gharavi, Venkat Anantharam:
An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. Theor. Comput. Sci. 332(1-3): 543-557 (2005) - [j35]Aaron B. Wagner, Venkat Anantharam:
Zero-rate reliability of the exponential-server timing channel. IEEE Trans. Inf. Theory 51(2): 447-465 (2005) - [c12]Aaron B. Wagner, Venkat Anantharam:
An improved outer bound for the multiterminal source-coding problem. ISIT 2005: 1406-1410 - [i1]Aaron B. Wagner, Venkat Anantharam:
An Infeasibility Result for the Multiterminal Source-Coding Problem. CoRR abs/cs/0511103 (2005) - 2004
- [j34]Venkat Anantharam:
Queuing analysis with traffic models based on deterministic dynamical systems. Comput. Sci. J. Moldova 12(2): 154-170 (2004) - [j33]Payam Pakzad, Venkat Anantharam:
A New Look at the Generalized Distributive Law. IEEE Trans. Inf. Theory 50(6): 1132-1155 (2004) - [c11]Venkat Anantharam:
On the Nash dynamics of congestion games with player-specific utility. CDC 2004: 4673-4678 - [c10]Venkat Anantharam:
Fourth order cumulant based frequency estimation. Circuits, Signals, and Systems 2004: 7-10 - [c9]Aaron B. Wagner, Venkat Anantharam:
Feedback, queueing, and the reliability of the ideal Poisson channel above capacity. ISIT 2004: 447 - 2003
- [j32]Engling Yeo, Venkat Anantharam:
Iterative decoder architectures. IEEE Commun. Mag. 41(8): 132-140 (2003) - [j31]Pablo Anigstein, Venkat Anantharam:
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum. IEEE Trans. Inf. Theory 49(4): 873-885 (2003) - [c8]Richard J. La, Venkat Anantharam:
A Game-theoretic Look at the Gaussian Multiaccess Channel. Advances in Network Information Theory 2003: 87-105 - [c7]Aaron B. Wagner, Venkat Anantharam:
A pairwise error probability bound for the exponential- server timing channel. ICC 2003: 3472-3476 - 2002
- [j30]Richard J. La, Venkat Anantharam:
Optimal routing control: repeated game approach. IEEE Trans. Autom. Control. 47(3): 437-450 (2002) - [j29]Pramod Viswanath, Venkat Anantharam:
Optimal sequences for CDMA under colored noise: A Schur-saddle function property. IEEE Trans. Inf. Theory 48(6): 1295-1318 (2002) - [j28]Richard J. La, Venkat Anantharam:
Utility-based rate control in the Internet for elastic traffic. IEEE/ACM Trans. Netw. 10(2): 272-286 (2002) - [c6]Venkat Anantharam:
Bufferless all-optical networking with erasure codes. ITW 2002: 19 - 2001
- [j27]Pramod Viswanath, David N. C. Tse, Venkat Anantharam:
Asymptotically optimal water-filling in vector multiple-access channels. IEEE Trans. Inf. Theory 47(1): 241-267 (2001) - [c5]Engling Yeo, Payam Pakzad, Borivoje Nikolic, Venkat Anantharam:
High throughput low-density parity-check decoder architectures. GLOBECOM 2001: 3019-3024 - [c4]Richard J. La, Venkat Anantharam:
Window-Based Congestion Control with Heterogeneous Users. INFOCOM 2001: 1320-1329 - 2000
- [j26]Sivarama Venkatesan, Venkat Anantharam:
The common randomness capacity of a network of discrete memoryless channels. IEEE Trans. Inf. Theory 46(2): 367-387 (2000) - [c3]Richard J. La, Venkat Anantharam:
Charge-Sensitive TCP and Rate Control in the Internet. INFOCOM 2000: 1166-1175
1990 – 1999
- 1999
- [j25]Venkat Anantharam:
Scheduling Strategies and Long-Range Dependence. Queueing Syst. Theory Appl. 33(1-3): 73-89 (1999) - [j24]Venkat Anantharam, Takis Konstantopoulos:
A methodology for the design of optimal traffic shapers in communication networks. IEEE Trans. Autom. Control. 44(3): 583-586 (1999) - [j23]Nick McKeown, Adisak Mekkittikul, Venkat Anantharam, Jean C. Walrand:
Achieving 100% throughput in an input-queued switch. IEEE Trans. Commun. 47(8): 1260-1267 (1999) - [j22]Pramod Viswanath, Venkat Anantharam, David N. C. Tse:
Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers. IEEE Trans. Inf. Theory 45(6): 1968-1983 (1999) - [j21]Pramod Viswanath, Venkat Anantharam:
Optimal sequences and sum capacity of synchronous CDMA systems. IEEE Trans. Inf. Theory 45(6): 1984-1991 (1999) - [c2]Jeonghoon Mo, Richard J. La, Venkat Anantharam, Jean C. Walrand:
Analysis and Comparison of TCP Reno and Vegas. INFOCOM 1999: 1556-1563 - 1998
- [j20]Sokratis D. Vamvakos, Venkat Anantharam:
On the departure process of a leaky bucket system with long-range dependent input traffic. Queueing Syst. Theory Appl. 28(1-3): 191-214 (1998) - [j19]Sivarama Venkatesan, Venkat Anantharam:
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels. IEEE Trans. Inf. Theory 44(1): 215-224 (1998) - [j18]Sivarama Venkatesan, Venkat Anantharam:
Identification Plus Transmission Over Channels with Perfect Feedbac. IEEE Trans. Inf. Theory 44(1): 284-290 (1998) - 1996
- [j17]Ayalvadi J. Ganesh, Venkat Anantharam:
Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals. Queueing Syst. Theory Appl. 22(3-4): 203-247 (1996) - [j16]Venkat Anantharam, Sergio Verdú:
Bits through queues. IEEE Trans. Inf. Theory 42(1): 4-18 (1996) - [c1]Nick McKeown, Venkat Anantharam, Jean C. Walrand:
Achieving 100% Throughput in an Input-Queued Switch. INFOCOM 1996: 296-302 - 1995
- [j15]Takis Konstantopoulos, Venkat Anantharam:
Optimal flow control schemes that regulate the burstiness of traffic. IEEE/ACM Trans. Netw. 3(4): 423-432 (1995) - 1994
- [j14]Venkat Anantharam, Michael L. Honig, U. Madhov, Victor K. Wei:
Optimization of a Database Hierarchy for Mobility Tracking in a Personal Communications Network. Perform. Evaluation 20(1-3): 278-300 (1994) - [j13]Venkat Anantharam, Takis Konstantopoulos:
Burst reduction properties of the leaky bucket flow control scheme in ATM networks. IEEE Trans. Commun. 42(12): 3085-3089 (1994) - [j12]Venkat Anantharam, Ayalvadi J. Ganesh:
Correctness within a constant of an optimal buffer allocation rule of thumb. IEEE Trans. Inf. Theory 40(3): 871-882 (1994) - 1993
- [j11]Venkat Anantharam, Ralph L. Disney, Jean C. Walrand:
Editorial introduction. Queueing Syst. Theory Appl. 13(1-3): 1-3 (1993) - [j10]Venkat Anantharam:
The input-output map of a monotone discrete-time quasireversible node. IEEE Trans. Inf. Theory 39(2): 543-552 (1993) - [j9]Venkat Anantharam:
Correction to 'The Input-Output Map of a Monotone Discrete-Time Quasireversible Node'. IEEE Trans. Inf. Theory 39(4): 1466- (1993) - 1992
- [j8]Reza Gharavi, Venkat Anantharam:
Effect of Noise on Long-term Memory in Cellular Automata with Asynchronous Delays between the Processors. Complex Syst. 6(3) (1992) - 1991
- [j7]Venkat Anantharam:
The stability region of the finite-user slotted ALOHA protocol. IEEE Trans. Inf. Theory 37(3): 535-540 (1991) - 1990
- [j6]Venkat Anantharam:
A large deviations approach to error exponents in source coding and hypothesis testing. IEEE Trans. Inf. Theory 36(4): 938-943 (1990)
1980 – 1989
- 1989
- [j5]Venkat Anantharam:
Threshold Phenomena in the Transient Behaviour of Markovian Models of Communication Networks and Databases. Queueing Syst. Theory Appl. 5(1-3): 77-97 (1989) - [j4]Venkat Anantharam:
How Large Delays Build Up in a GI/G/1 Queue. Queueing Syst. Theory Appl. 5(4): 345-367 (1989) - [j3]Venkat Anantharam:
The optimal buffer allocation problem. IEEE Trans. Inf. Theory 35(4): 721-724 (1989) - 1988
- [j2]Venkat Anantharam, B. Gopinath, D. Hajela:
A Generalization of the Erlang Formula of Traffic Engineering. Queueing Syst. Theory Appl. 3(3): 277-288 (1988) - 1987
- [j1]Venkat Anantharam:
Probabilistic Proof of the Interchangeability of ./M/1 Queues in Series. Queueing Syst. Theory Appl. 2(4): 387-392 (1987)
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 2024-10-12 23:02 CEST 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:
