Articles in journals or magazines

• L. Jiang, V. Anantharam, and J. Walrand, "How bad are selfish investments in network security?," IEEE/ACM Trans. Netw., vol. 19, no. 2, pp. 549-560, April 2011.
• Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic, "An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors," Solid-State Circuits, IEEE Journal of, vol. 45, no. 4, pp. 843-855, April 2010.
• A. B. Wagner and V. Anantharam, "An improved outer bound for multiterminal source coding," IEEE Trans. Information Theory, vol. 54, no. 5, pp. 1919-1937, May 2008.
• V. Anantharam and V. Borkar, "Common randomness and distributed control: A counterexample," Systems and Control Letters, vol. 56, no. 7-8, pp. 568-572, July 2007.
• L. Dolecek and V. Anantharam, "Using Reed-Muller RM(1,m) codes over channels with synchronization and substitution errors," IEEE Trans. Information Theory, vol. 53, no. 4, pp. 1430-1443, April 2007.
• A. D. Sarwate and V. Anantharam, "Exact emulation of a priority queue with a switch and delay lines," Queueing Systems: Theory and Applications, vol. 53, no. 3, pp. 115-125, July 2006.
• P. Pakzad and V. Anantharam, "Estimation and marginalization using the Kikuchi approximation methods," Neural Computation, vol. 17, no. 8, pp. 1836-1873, Aug. 2005.
• V. Anantharam and T. Konstantopoulos, "Regulating functions on partially ordered sets," Order, vol. 22, no. 2, pp. 145-183, May 2005.
• R. Gharavi and V. Anantharam, "An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices," Theoretical Computer Science, vol. 332, no. 1-3, pp. 543-557, Feb. 2005.
• A. B. Wagner and V. Anantharam, "Zero-rate reliability of the exponential-server timing channel," IEEE Trans. Information Theory, vol. 51, no. 2, pp. 447-465, Feb. 2005.
• P. Pakzad and V. Anantharam, "A new look at the generalized distributive law," IEEE Trans. Information Theory, vol. 50, no. 6, pp. 1132-1155, June 2004.
• E. Yeo, B. Nikolic, and V. Anantharam, "Iterative decoder architectures," IEEE Communications Magazine, vol. 41, no. 8, pp. 132-140, Aug. 2003.
• P. Anigstein and V. Anantharam, "Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum," IEEE Trans. Information Theory, vol. 49, no. 4, pp. 873-885, April 2003.
• P. Viswanath and V. Anantharam, "Optimal sequences for CDMA under colored noise: A Schur-saddle function property," IEEE Trans. Information Theory, vol. 48, no. 6, pp. 1295-1318, June 2002.
• R. J. La and V. Anantharam, "Utility-based rate control in the Internet for elastic traffic," IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 272-286, April 2002.
• E. Yeo, P. Pakzad, B. Nikolic, and V. Anantharam, "VLSI architectures for iterative decoders in magnetic recording channels," IEEE Trans. Magnetics, vol. 37, no. 2, pt. 1, pp. 748-755, March 2001.
• P. Viswanath, D. Tse, and V. Anantharam, "Asymptotically optimal water-filling in vector multiple-access channels," IEEE Trans. Information Theory, vol. 47, no. 1, pp. 241-267, Jan. 2001.
• N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch (Stephen O. Rice Prize Paper Award)," IEEE Trans. on Communications, vol. 47, no. 8, pp. 1260-1267, Aug. 1999.
• S. Venkatesan and V. Anantharam, "The common randomness capacity of a network of discrete memoryless channels," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 215-224, Jan. 1998.
• V. Anantharam and S. Verdu, "1998 Information Theory Society Paper Award: Bits through queues," IEEE Trans. Information Theory, vol. 42, no. 1, pp. 4-18, Jan. 1996.
• R. Agrawal, D. Teneketzis, and V. Anantharam, "Asymptotically efficient adaptive allocation schemes for controlled Markov chains: Finite parameter space," IEEE Trans. Automatic Control, vol. 34, no. 12, pp. 1249-1259, Dec. 1989.

Articles in conference proceedings

• A. Gueye, J. Walrand, and V. Anantharam, "Design of Network Topology in an Adversarial Environment," in GameSec, Lecture Notes in Computer Science, Vol. 6442, Springer, 2010, pp. 1-20.
• L. Jiang, V. Anantharam, and J. Walrand, "Efficiency of selfish investments in network security," in Proc. 3rd Intl. Workshop on Economics of Networked Systems (NetEcon '08), New York, NY: The Association for Computing Machinery, Inc., 2008, pp. 31-36.
• V. Anantharam and F. Baccelli, "A Palm theory approach to error exponents," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT '08), Piscataway, NJ: IEEE Press, 2008, pp. 1768-1772.
• P. Venkitasubramaniam and V. Anantharam, "On the anonymity of Chaum mixes," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT '08), Piscataway, NJ: IEEE Press, 2008, pp. 534-538.
• A. A. Gohari and V. Anantharam, "New bounds on the information-theoretic key agreement of multiple terminals," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT '08), Piscataway, NJ: IEEE Press, 2008, pp. 742-746.
• L. Dolecek and V. Anantharam, "Prefixing method for correcting repetition errors," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT '08), Piscataway, NJ: IEEE Press, 2008, pp. 965-969.
• P. Lee, L. Dolecek, Z. Zhang, V. Anantharam, B. Nikolic, and M. Wainwright, "Error floors in LDPC codes: Fast simulation, bounds and hardware emulation," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT 2008), Piscataway, NJ: IEEE Press, 2008, pp. 444-448.
• L. Dolecek, Z. Zhang, M. Wainwright, V. Anantharam, and B. Nikolic, "Evaluation of the low frame error rate performance of LDPC codes using importance sampling," in Proc. 2007 IEEE Information Theory Workshop (ITW '07), Piscataway, NJ: IEEE Press, 2007, pp. 202-207.
• L. Dolecek and V. Anantharam, "On subsets of binary strings immune to multiple repetition errors," in Proc. 2007 IEEE Intl. Symp. on Information Theory (ISIT '07), Piscataway, NJ: IEEE Press, 2007, pp. 1691-1695.
• A. A. Gohari and V. Anantharam, "Communication for omniscience by a neutral observer and information-theoretic key agreement of multiple terminals," in Proc. 2007 IEEE Intl. Symp. on Information Theory (ISIT '07), Piscataway, NJ: IEEE Press, 2007, pp. 2056-2060.
• V. Anantharam and V. S. Borkar, "An information-theoretic view of stochastic resonance," in Proc. 2007 IEEE Intl. Symp. on Information Theory (ISIT '07), Piscataway, NJ: IEEE Press, 2007, pp. 966-970.
• Z. Zhang, L. Dolecek, M. Wainwright, V. Anantharam, and B. Nikolic, "Quantization effects in low-density parity-check decoders," in Proc. 2007 IEEE Intl. Conf. on Communications (ICC '07), Piscataway, NJ: IEEE Press, 2007, pp. 6231-6237.
• L. Dolecek, Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic, "Analysis of absorbing sets for array-based LDPC codes," in Proc. IEEE International Conference on Communications (ICC '07), Piscataway, NJ: IEEE Press, 2007, pp. 6261-6268.
• Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam, and M. Wainwright, "Investigation of error floors of structured low-density parity-check codes by hardware emulation," in Proc. IEEE Global Telecommunications Conference (GLOBECOM '06), Piscataway, NJ: IEEE Press, 2006, pp. 1-6.
• A. B. Wagner and V. Anantharam, "An improved outer bound for the multiterminal source-coding problem," in Proc. 2005 IEEE Intl. Symp. on Information Theory (ISIT '05), Piscataway, NJ: IEEE Press, 2005, pp. 1406-1410.
• V. Anantharam, "On the Nash dynamics of congestion games with player-specific utility," in Proc. 2004 43rd IEEE Conf. on Decision and Control (CDC '04), Vol. 5, Piscataway, NJ: IEEE Press, 2004, pp. 4673-4678.
• E. Yeo, P. Pakzad, B. Nikolic, and V. Anantharam, "High throughput low-density parity-check decoder architectures," in Proc. 2001 IEEE Global Telecommunications Conf. (GLOBECOM '01), Vol. 5, Piscataway, NJ: IEEE Press, 2001, pp. 3019-3024.

Technical Reports

• L. Jiang, V. Anantharam, and J. Walrand, "How Bad are Selfish Investments in Network Security?," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2008-183, Dec. 2008.
• A. Aminzadeh Gohari and V. Anantharam, "A New Outer Bound to the Capacity Region of Deterministic-Code Discrete Memoryless Arbitrary Varying General Broadcast Channel," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2008-81, June 2008.
• L. Jiang, V. Anantharam, and J. Walrand, "Efficiency of Selfish Investments in Network Security," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2008-77, June 2008.
• L. Dolecek and V. Anantharam, "Using Reed-Muller RM(1,m) Codes over Channels with Synchronization and Substitution Errors," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-44, April 2006.
• L. Dolecek and V. Anantharam, "On Array-based LDPC Codes in Channels With Varying Sampling Rate," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-7, Jan. 2006.
• A. Sarwate and V. Anantharam, "Exact Emulation of a Priority Queue with Switch and Delay Lines," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M04/47, April 2004.
• P. Pakzad and V. Anantharam, "Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M04/25, April 2004.
• P. Pakzad and V. Anantharam, "Estimation and Marginalization Using Kikuchi Approximation Methods," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M04/21, Dec. 2003.
• A. B. Wagner and V. Anantharam, "Zero-rate Reliability of the Exponential- Server Timing Channel," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M04/5, Nov. 2003.
• R. J. La and V. Anantharam, "A Game-Theoretic Look at the Gaussian Multiaccess Channel," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M03/17, March 2003.
• A. B. Wagner and V. Anantharam, "Designing a Contact Process: The Piecewise-Homogeneous Process on a Finite Set with Applications," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M02/10, Sep. 2002.
• J. A. Cataldo, E. A. Lee, X. Liu, A. B. Wagner, and V. Anantharam, "Preliminary Version of a Two-Dimensional Technical Specification for Softwalls. Designing a Contact Process: The Piecewise-Homogeneous Process on a Finite Set with Applications," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M02/9, April 2002.
• P. Pakzad and V. Anantharam, "A new look at the generalized distributive law," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M01/32, June 2001.
• P. Anigstein and V. Anantharam, "Iterative construction of optimal signature sequences for CDMA," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M01/24, Feb. 2001.
• R. La and V. Anantharam, "Charge-Sensitive TCP and Rate Control in the Internet," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M00/13, March 2000.
• Y. Xia, H. W. So, V. Anantharam, S. McCanne, D. Tse, J. Walrand, and P. Varaiya, "The WebTP Architecture and Algorithms," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M00/53, Jan. 2000.
• Y. Xia, H. W. So, R. H. La, V. Anantharam, S. McCanne, D. Tse, J. Walrand, and P. Varaiya, "The Framework of User-Centric Optimization in Web-Based Applications," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M00/52, Jan. 2000.
• P. Viswanath, D. Tse, and V. Anantharam, "Asymptotically Optimal Water Filling in Vector Multiple Access Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M99/54, Nov. 1999.
• P. Viswanath and V. Anantharam, "Total Capacity of Multi-Access Vector Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M99/47, May 1999.
• R. La, J. Walrand, and V. Anantharam, "Issues in TCP Vegas," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M99/3, Feb. 1999.
• R. La and V. Anantharam, "Optimal Routing Control: Game Theoretic Approach," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M98/35, June 1998.
• P. Viswanath and V. Anantharam, "Optimal Sequences and Sum Capacity of Synchronous CDMA Systems," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M98/12, Feb. 1998.
• P. Viswanath, V. Anantharam, and D. Tse, "Optimal Sequences, Power Control and Capacity of Spread-Spectrum Systems with Multiuser Linear Receivers," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M98/6, Jan. 1998.
• S. Venkatesan and V. Anantharam, "Generating Common Randomness in an Arbitrary Network of Channels: Capacity Formulas and Some Combinatorial Results," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M97/9, Jan. 1997.
• S. Vamvakos and V. Anantharam, "On the Departure Process of a Leaky Bucket System with Long-Range Dependent Input Traffic: The Finite Cell Buffer Case," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M96/70, Nov. 1996.
• S. Vamvakos and V. Anantharam, "On the Departure Process of a Leaky Bucket System with Long-Range Dependent Input Traffic," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M96/51, Oct. 1996.
• S. Venkatesan and V. Anantharam, "Deterministic Simulation of Randomized Protocols Over Arbitrary Networks of Noisy Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M96/65, Aug. 1996.
• S. Venkatesan and V. Anantharam, "Identification Plus Transmission over Channels with Perfect Feedback," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M96/34, May 1996.
• V. Anantharam, "Networks of Queues with Long-Range Dependent Traffic Streams," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M96/24, April 1996.
• S. Venkatesan and V. Anantharam, "The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M95/85, Sep. 1995.
• S. Venkatesan and V. Anantharam, "The Common Randomness Capacity of a Pair of Independent Binary Symmetric Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M95/68, Aug. 1995.
• V. Anantharam, "Mathematical Theory of Communication Networks," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M95/22, March 1995.
• S. Venkatesan and V. Anantharam, "Deterministic Simulation of Randomized Protocols Over Noisy Channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M94/102, Dec. 1994.
• R. Gharavi and V. Anantharam, "A Structure Theorem for Partially Asynchronous Relaxations - Summary of Results," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M92/143, Dec. 1992.
• A. Ganesh and V. Anantharam, "Optimal Buffer Allocation in Tandems of Last Come First Served Queues," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M92/142, Dec. 1992.
• V. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays Part I: I.I.D. Rewards, Part II: Markovian Rewards," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M86/62, Aug. 1986.
• V. Anantharam, "On Stabilization and the Existence of Coprime Factorizations," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M82/61, Aug. 1982.
• V. Anantharam and C. Desoer, "On the Stabilization of Nonlinear Systems," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M82/49, May 1982.