Venkat Anantharam
Professor
Info Links
Research Areas
Research Centers
Teaching Schedule
Spring 2021
- EE 223. Stochastic Systems: Estimation and Control, TuTh 2:00PM - 3:29PM,
Fall 2021
- EE 229A. Information Theory and Coding, TuTh 5:00PM - 6:29PM, GSPP 150
Biography
He received his B.Tech in Electrical Engineering from the Indian Institute of Technology, 1980, a M.S. in EE from UC Berkeley, 1982, a M.A. in Mathematics, UC Berkeley, 1983, a C.Phil in Mathematics, UC Berkeley, 1984 and a Ph.D. in EE, UC Berkeley, 1986. Prior to joining the faculty of EECS in 1994, he was a member of the faculty at Cornell University.
Education
- 1986, Ph.D., Electrical Engineering, University of California, Berkeley
- 1984, C.Phil, Mathematics, University of California, Berkeley
- 1983, M.A., Mathematics, University of California, Berkeley
- 1982, M.S., Electrical Engineering, University of California, Berkeley
- 1980, B.Tech, Electrical Engineering, Indian Institute of Technology
Selected Publications
- 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.
- 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.
- 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.
- 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.
- 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.
- 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, "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.
- 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.