Venkat Anantharam's Home Page

Research Interests

• Under construction
  

Message for prospective interns/graduate students/postdoctoral fellows

• Like many others, I receive hundreds of inquiries every semester from prospective interns, graduate students, and postdoctoral fellows. It is in general not possible for me to read through the CV and/or reply to such messages because of their sheer volume. If you send me such a message, please do not be offended if I do not reply.

Teaching Spring 2008

• Introduction to Microelectronic Circuits.
  

Current graduate Students

• Amin Aminzadeh Gohari
  

• Libin Jiang
  

Current postdoctoral fellows

• Parvathinathan Venkitasubramaniam
  

Doctoral degrees supervised

• Lara Dolecek
  

• Aaron Wagner
  

• Payam Pakzad
  

• Pramod Viswanath
  

• Richard J. La
  

• Sivarama Venkatesan
  

• Reza Gharavi
  

• Ayalvadi Ganesh
  

• Mohammed Benchekroun
  

Masters degrees supervised

• Pablo Anigstein
  

• Richard Wheeler
  

• Alex Leung
  

• Said Mokbel
  

Long term postdoctoral fellows hosted

• Charles Bordenave
  

Publications

Copyright notice

• Copyright belongs to the publisher in most cases. The author/authors assert copyright in all other cases.
  

Current Preprints

• Design of LDPC Decoders for Low Error Rate Performance.
  Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam and Martin J. Wainwright.
  Submitted to ``IEEE Transactions on Communications".
  
• Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes.
  Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright and Borivoje Nikolic.
  Submitted to ``IEEE Transactions on Information Theory".
  
• Information-Theoretic Key Agreement of Multiple Terminals - Part II: Channel Model.
  Amin Aminzadeh Gohari and Venkat Anantharam.
  Submitted to ``IEEE Transactions on Information Theory".
  
• Information-Theoretic Key Agreement of Multiple Terminals - Part I: Source Model.
  Amin Aminzadeh Gohari and Venkat Anantharam.
  Submitted to ``IEEE Transactions on Information Theory".
  
• Information theory of covert timing channels.
  Aaron B. Wagner and Venkat Anantharam.
  Proceedings of the 2005 NATO/ASI Workshop on Network Security and Intrusion Detection (to appear).
  
• An infeasibility result for the multiterminal source-coding problem.
  Aaron B. Wagner and Venkat Anantharam.
  To appear in ``IEEE Transactions on Information Theory".
  
• A technique to study the correlation measures of binary sequences.
  Venkat Anantharam.
  To appear in ``Discrete Mathematics".
  

2008 +

Conference Proceeding Papers

• Efficiency of Selfish Investments in Network Security.
  Libin Jiang, Venkat Anantharam and Jean Walrand.
  To appear in ``Proceedings of the ACM NetEcon 2008 Workshop", August 22, 2008, Seattle, Washington, U.S.A.
  
• Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation.
  Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic and Martin J. Wainwright.
  To appear in ``Proceedings of the IEEE International Symposium on Information Theory", Toronto, Canada, 2008.
  
• Prefixing Method for Correcting Repetition Errors.
  Lara Dolecek and Venkat Anantharam.
  To appear in ``Proceedings of the IEEE International Symposium on Information Theory", Toronto, Canada, 2008.
  
• On the Anonymity of Chaum Mixes.
  Parvathinathan Venkitasubramaniam and Venkat Anantharam.
  To appear in ``Proceedings of the IEEE International Symposium on Information Theory", Toronto, Canada, 2008.
  
• A Palm theory approach to error exponents.
  Venkat Anantharam and Francois Baccelli.
  To appear in ``Proceedings of the IEEE International Symposium on Information Theory", Toronto, Canada, 2008.
  
• New Bounds on the Information-Theoretic Key Agreement of Multiple Terminals.
  Amin Aminzadeh Gohari and Venkat Anantharam.
  To appear in ``Proceedings of the IEEE International Symposium on Information Theory", Toronto, Canada, 2008.
  

2005-2007

Journal Papers

• Common randomness and distributed control : a counterexample.
  Venkat Anantharam and Vivek Borkar.
  ``Systems and Control Letters", Vol. 56, No. 7-8, July 2007, pp. 568 -572.
  
• Using Reed-Muller RM(1,m) codes over channels with synchronization and substitution errors.
  Lara Dolecek and Venkat Anantharam.
  Report No. EECS-2006-44, EECS Department, University of California, Berkeley, 2006. To appear in ``IEEE Transactions on Information Theory".
  
• Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels.
  Payam Pakzad and Venkat Anantharam.
  IEEE Transactions on Communications. Vol. 54, No. 7, pp. 1149 -1153, July 2006.
  
• Exact emulation of a priority queue with a switch and delay lines.
  Anand Sarwate and Venkat Anantharam.
  Queueing Systems : Theory and Applications, Vol. 53, No. 3, pp. 115 -125, July 2006.
  
• On the rod placement theorem of Rybko and Shlosman.
  Venkat Anantharam.
  Queueing Systems : Theory and Applications, Vol. 52, No. 3, pp. 185 -188, March 2006.
  
• Bufferless all-optical networking with erasure codes.
  Sagnik Ghosh and Venkat Anantharam.
  Berkeley Scientific Journal, Vol. 9, No. 2, pp. 115 -118, Fall 2005.
  
• Estimation and Marginalization using Kikuchi Approximation Methods.
  Payam Pakzad and Venkat Anantharam.
  Neural Computation, Vol. 17, No. 8, pp. 1836 -1873, August 2005.
  
• Regulating functions on partially ordered sets.
  Venkat Anantharam and Takis Konstantopoulos.
  Order, Vol. 22, No. 2, pp. 145 -183, May 2005.
  
• An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices.
  Reza Gharavi and Venkat Anantharam.
  Theoretical Computer Science, Vol. 332, Nos. 1-3, pp. 543 -557, February 2005.
  
• Zero-Rate Reliability of the Exponential-Server Timing Channel.
  Aaron Wagner and Venkat Anantharam.
  IEEE Transactions on Information Theory, Vol. 51, No. 2, pp. 447 -466, February 2005.
  
• Designing a Contact Process : The Piecewise-Homogeneous Process on a Finite Set with Applications.
  Aaron Wagner and Venkat Anantharam.
  Stochastic Processes and their Applications, Vol. 115, No. 1, pp. 117 -153, January 2005.
  

Conference Proceedings Papers

• Evaluation of the Low Frame Error Rate Performance of LDPC Codes Using Importance Sampling.
  Lara Dolecek, Zhengya Zhang, Martin Wainwright, Venkat Anantharam and Borivoje Nikolic.
  ``Proceedings of the IEEE ITW 2007, Lake Tahoe, California, pp. 202 -207.
  
• Quantization Effects in Low-Density Parity-Check Decoders.
  Zhengya Zhang, Lara Dolecek, Martin Wainwright, Venkat Anantharam and Borivoje Nikolic.
  ``Proceedings of the IEEE ICC 2007, Glasgow, Scotland, pp. 6231 -6237.
  
• Analysis of Absorbing Sets for Array-Based LDPC Codes.
  Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin Wainwright and Borivoje Nikolic.
  ``Proceedings of the IEEE ICC 2007, Glasgow, Scotland, pp. 6261 -6268.
  
• Communication for Omniscience by a Neutral Observer and Information-Theoretic Key Agreement by Multiple Terminals.
  Amin Aminzadeh Gohari and Venkat Anantharam
  ``Proceedings of the IEEE International Symposium on Information Theory, Nice, France, June 2007.
  
• On Subsets of Binary Strings Immune to Multiple Repetition Errors.
  Lara Dolecek and Venkat Anantharam
  ``Proceedings of the IEEE International Symposium on Information Theory, Nice, France, June 2007.
  
• An Information Theoretic View of Stochastic Resonance.
  Venkat Anantharam and Vivek Borkar
  ``Proceedings of the IEEE International Symposium on Information Theory, Nice, France, June 2007.
  
• Investigation of error floors of structured low-density parity-check codes by hardware emulation.
  Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, and Martin Wainwright.
  To appear in ``Proceedings of the IEEE Globecom 2006, San Francisco, CA, U.S.A., 27 Nov. -01 Dec. 2006".
  
• On array-based LDPC codes in channels with varying sampling rate.
  Lara Dolecek and Venkat Anantharam.
  Report No. EECS-2006-7, EECS Department, University of California, Berkeley, 2006. Revised version to appear in ``Proceedings of the IEEE Internation Symposium on Information Theory, Seattle, WA, 09 July -14 July, 2006".
  
• An Improved Outer Bound for the Multiterminal Source-coding Problem.
  Aaron Wagner and Venkat Anantharam.
  Proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia 4 -9 September 2005, pp. 1406 -1410.
  

2002-2004

Journal Papers

• A New Look at the Generalized Distributive Law.
  Payam Pakzad and Venkat Anantharam.
  IEEE Transactions on Information Theory, Vol. 50, No. 6, pp. 1132 -1155, June 2004.
  
• Iterative decoder architectures.
  Engling Yeo, Borivoje Nikolic, and Venkat Anantharam.
  IEEE Communications Magazine, Vol. 41, No. 8, pp. 132 -140, August 2003.
  
• Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum.
  Pablo Anigstein and Venkat Anantharam
  IEEE Transactions on Information Theory, Vol. 49, No. 4, pp. 873 -885, April 2003.
  
• Optimal Sequences for CDMA Under Colored Noise : A Schur-Saddle Function Property.
  Pramod Viswanath and Venkat Anantharam.
  IEEE Transactions on Information Theory, Vol. 48, No. 6, pp. 1295 -1318, June 2002.
  
• Utility Based Rate Control in the Internet for Elastic Traffic.
  Richard La and Venkat Anantharam.
  IEEE/ACM Transactions on Networking, Vol 10, No. 2, pp. 272 -286, April 2002.
  
• Optimal Routing Control : Repeated Game Approach.
  Richard La and Venkat Anantharam.
  IEEE Transactions on Automatic Control, Vol. 47, No. 3, pp. 437 -450, March 2002.
  

Conference Proceedings Papers

• On the Nash dynamics of congestion games with player-specific utility.
  Venkat Anantharam.
  Proceedings of the 43rd IEEE Conference on Decision and Control, Atlantis, Paradise Island, Bahamas, December 14 -17, 2004, pp. 4673 -4678.
  
• Run-length properties of a Red-Muller RM(1,m) code with applications in channels with at most one synchronization error.
  Lara Dolecek and Venkat Anantharam.
  Proceedings of the 42nd Allerton Conference on Communications, Control, and Computing, Champaign, Illinois, 29 Sep - 01 Oct. 2004, pp. 270 -279.
  
• Feedback, Queueing, and the Reliability of the Ideal Poisson Chanel above Capacity.
  Aaron Wagner and Venkat Anantharam.
  Proceedings of the 2004 International Symposium on Information Theory, ISIT 2004, Jun. 27 - Jul. 2, 2004, pg. 445.
  
• A pairwise error probability bound for the exponential-server timing channel.
  Aaron Wagner and Venkat Anantharam.
  Proceedings of the 2003 IEEE International Conference on Communications, ICC '03, Vol. 5, pp. 3472 -3476.
  
• Bufferless all-optical networking with erasure codes.
  Venkat Anantharam.
  Proceedings of the 2002 IEEE Workshop on Information Theory, pg. 19.
  
• Minimal graphical representation of Kikuchi regions.
  Payam Pakzad and Venkat Anantharam.
  Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, Urbana, Illionis, October 2 -4 2002, pp. 1585 -1594.
  
• Wireless sensor network design via interacting particles.
  Aaron Wagner and Venkat Anantharam.
  Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, Urbana, Illionis, October 2 -4 2002, pp. 1554 -1563.
  
• On the zero-rate error exponent of the exponential server timing channel.
  Aaron Wagner and Venkat Anantharam.
  Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, Urbana, Illionis, October 2 -4 2002, pp. 1279 -1287.
  
• Architectures and Implementations of Low-Density Parity Check Decoding Algorithms.
  Engling Yeo, Borivoje Nikolic, and Venkat Anantharam.
  Proceedings of the 45th IEEE Midwest Symposium on Circuits and Systems, MWSCAS 2002, Tulsa, Oklahoma, August 4 -7, 2002, Vol. III, pp. 437 -440.
  
• Designing an Interacting Particle System : Optimization of the Piecewise-Homogeneous Contact Process.
  Aaron B. Wagner and Venkat Anantharam.
  Proceedings of the Conference on Information Sciences and Systems, Princeton University, March 20 -22, 2002. Paper No. 153. 6 pages.
  
• A New Look at the Generalized Distributive Law.
  Payam Pakzad and Venkat Anantharam.
  Proceedings of the Conference on Information Sciences and Systems, Princeton University, March 20 -22, 2002. Paper No. 30. 5 pages.
  
• Belief Propagation and Statistical Physics.
  Payam Pakzad and Venkat Anantharam.
  Proceedings of the Conference on Information Sciences and Systems, Princeton University, March 20 -22, 2002. Paper No. 225. 3 pages.
  

Book articles and other articles

• A game-theoretic look at the Gaussian multiaccess channel.
  Richard J. La and Venkat Anantharam.
  Advances in Network Information Theory, P. Gupta, G. Kramer, and A. J. van Wijngaarden, eds., Proceedings of the March 2003 DIMACS workshop on Network Information Theory, DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 66, pp. 87 -106, 2004.
  

1999-2001

Journal Papers

• Structure Theorems for Partially Asynchronous Iterations of a Nonnegative Matrix with Random Delays.
  Reza Gharavi and V. Anantharam.
  SADHANA, Proceedings of the Indian Academy of Sciences, Vol. 24, Parts 4 and 5, pp. 369 -424, August and October 1999.
  
• VLSI Architectures for Iterative Decoders in Magnetic Recording Channels.
  Engling Yeo, Payam Pakzad, Borivoje Nikolic, and Venkat Anantharam.
  IEEE Transactions on Magnetics, Vol. 37, No. 2, March 2001, pp. 748 -55.
  
• Asymptotically Optimal Waterfilling in Vector Multiple Access Channels.
  Pramod Viswanath, David N.C. Tse, and Venkat Anantharam,
  IEEE Transactions on Information Theory, Vol. 47, No. 1, pp. 241 -267, January 2001.
  
• Optimal Sequences, Power Control, and User Capacity of Synchronous CDMA Systems with Linear MMSE Multiuser Receivers
  P. Viswanath, V. Anantharam, and D. Tse.
  IEEE Transactions on Information Theory, Vol. 45, No. 6, pp. 1968 -1983, Sep. 1999.
  
• Optimal Sequences and the Sum Capacity of Synchronous CDMA Systems.
  P. Viswanath and V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 45, No. 6, pp. 1984 -1991, Sep. 1999.
  
• A correction and some additional remarks on `Stationary Solutions of Stochastic Recursions describing Discrete Event Systems'.
  V. Anantharam and T. Konstantopoulos.
  Stochastic Processes and Their Applications, Vol. 80, No. 2, pp. 271-278, April 1999.
  
• The Common Randomness Capacity of a Network of Discrete Memoryless Channels.
  S. Venkatesan and V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 46, No. 2, March 2000, pp. 367 -387.
  
• Scheduling Strategies and Long-range Dependence.
  V. Anantharam.
  Queueing Systems : Theory and Applications, Vol. 33, Nos. 1-3, pp. 73 -89, December 1999.
  
• A methodology for the Design of Optimal Traffic Shapers in ATM Networks.
  V. Anantharam and T. Konstantopoulos.
  IEEE Transactions on Automatic Control, Vol. 44, No. 3, pp. 583 -586, March 1999.
  
• Achieving 100 % Throughput in an Input-Queued Switch
  N. Mckeown, A. Mekkittikul, V. Anantharam, and J. Walrand.
  IEEE Transactions on Communications, Vol. 47, No. 8, pp. 1260 -1267, August 1999.
  

Conference Proceedings Papers

• A Schur-Saddle Function Property in CDMA.
  Pramod Viswanath and Venkat Anantharam.
  Proceedings of the 2001 International Symposium on Information Theory, Washington DC, June 24 -June 29, 2001, pg. 128.
  
• High Throughput Low-Density Parity-Check Decoder Architectures.
  Engling Yeo, Payam Pakzad, Borivoje Nikolic, and Venkat Anantharam.
  Proceedings of the IEEE GLOBECOM 2001, IEEE Press, pp. 3019 -3024.
  
• Window-Based Congestion Control with Heterogeneous Users.
  Richard J. La and Venkat Anantharam.
  Proceedings of the IEEE INFOCOM 2001, Anchorage, Alaska, April 22 -26, 2001, IEEE Press, Piscataway, NJ, pp. 1320 -1329.
  
• Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum.
  Pablo Anigstein and Venkat Anantharam.
  Proceedings of the 38th Annual Allerton Conference on Communications, Control, and Computing, University of Illinois, Urbana -Champaign, Oct. 4 -6, 2000, pp. 307 -317.
  
• VLSI Architectures for Iterative Decoders in Magnetic Recording Channels.
  Engling Yeo, Payam Pakzad, Borivoje Nikolic, and Venkat Anantharam.
  Digest of the Eleventh Annual Magnetic Recording Conference, August 14 -16, 2000, Santa Clara University, page E6.
  
• Optimal Power Control and Spectral Efficiency of Multiaccess Vector Channels.
  P. Viswanath, D. Tse, and V. Anantharam.
  Proceedings of the International Conference on Stochastic Processes and their Applications, Department of Mathematics, Cochin University of Science and Technology, Dec 17 -20, 1999, (to appear).
  
• Charge-Sensitive TCP and Rate Control in the Internet.
  Richard J. La and Venkat Anantharam.
  Proceedings of the IEEE INFOCOM 2000, Tel Aviv, Israel, March 26 -30, 2000, IEEE Press, pp. 1166 -1175.
  
• Sum Capacity of DS-CDMA with Colored Noise.
  Pramod Viswanath and Venkat Anantharam.
  Proceedings of the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, 25 -30 June 2000, IEEE Press, pg. 130.
  
• Asymptotically Optimal Waterfilling in Multiple Antenna Multiple Access Channels
  P. Viswanath, D. Tse, and V. Anantharam.
  Proceedings of the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, 25 -30 June 2000, IEEE Press, pg. 466.
  
• User Capacity of a Power Controlled CDMA System with Multiple Base Stations.
  P. Viswanath and Venkat Anantharam.
  Proceedings of the 1999 IEEE Workshop on Information Theory, Kruger National Park, South Africa, June 20 -25, 1999, pp. 21 -23.
  
• Network Pricing Using a Game Theoretic Approach.
  Richard J. La and V. Anantharam,
  Proceedings of the 38rd IEEE Conference on Decision and Control, Phoenix, AZ, Dec. 1999, IEEE Press, Piscataway, NJ, pp. 4008 -4013.
  
• Analysis and Comparison of TCP Reno and TCP Vegas.
  Jeonghoon Mo, Richard J. La, V. Anantharam, and J. Walrand.
  IEEE INFOCOM 1999, Conference on Computer Communications, March 1999, New York, pp. 1556 -63.
  

Book articles and other articles

• Reflections on the 1998 Information Theory Society Paper Award : Bits through Queues.
  V. Anantharam and S. Verdu.
  IEEE Information Theory Society Newsletter, December 1999.
  

Unpublished documents and miscellania

• The WebTP Architecture and Algorithms.
  Y. Xia, H-S. W. So, R. La, V. Anantharam, S. McCanne, D. Tse, J. Walrand, and P. Varaiya.
  Memorandum No. UCB/ERL M 00/53, Electronics Research Laboratory, University of California, Berkeley, January 15, 2000.
  
• The Framework of User-Centric Optimization in Web-Based Applications.
  Y. Xia, H-S. W. So, R. La, V. Anantharam, S. McCanne, D. Tse, J. Walrand, and P. Varaiya.
  Memorandum No. UCB/ERL M 00/52, Electronics Research Laboratory, University of California, Berkeley, January 15, 2000.
  
• Issues in TCP Vegas.
  Richard J. La, J. Walrand, and V. Anantharam.
  UCB/ERL Memorandum, No. M99/3, Electronics Research Laboratory, University of California, Berkeley, January 1999.
  
• Introduction to the special issue on control methods for communication networks.
  V. Anantharam and J. Walrand.
  AUTOMATICA, Vol. 35, No. 12, Dec. 1999, pg. 1891.
  

1996-1998

Journal Papers

• Stationary Solutions of Stochastic Recursions describing Discrete Event Systems.
  V. Anantharam and T. Konstantopoulos.
  Stochastic Processes and Their Applications, Vol. 68, pp. 181 -194, 1997. See also the correction published in Vol. 80, No. 2, pp. 271-278, April 1999.
  
• Identification plus Transmission over Channels with Perfect Feedback.
  S. Venkatesan and V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 44, No. 1, pp. 284 -290, 1998.
  
• The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels.
  S. Venkatesan and V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 44, No. 1, pp. 215 -224, 1998.
  
• On the Departure Process of a Leaky Bucket System with Long-Range Dependent Input Traffic.
  S. Vamvakos and V. Anantharam.
  Queueing Systems : Theory and Applications, Vol. 28, Nos. 1-3, pp. 191 -214, May 1998.
  
• Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals.
  A. Ganesh and V. Anantharam.
  Queuing Systems : Theory and Applications, Vol. 22, Nos. 3-4, pp. 203 -248, October 1996.
  
• Bits through queues.
  V. Anantharam and S. Verdu.
  IEEE Transactions on Information Theory, Vol. 42, No. 1, pp. 4 -18, January 1996.
  

Conference Proceedings Papers

• Optimal Sequences, Power Control, and the Capacity of Spread-Spectrum Systems with Multiuser Linear Receivers
  P. Viswanath, D. Tse, and V. Anantharam.
  Proccedings of the IEEE Information Theory Workshop, Killarney, Ireland, June 22 -26, 1998, pp. 134 -135.
  
• Capacity for a Power Controlled Cellular System with Linear Receivers.
  P. Viswanath, D. Tse, and V. Anantharam.
  1998 IEEE International Symposium on Information Theory, MIT, August 16 -21, 1998, pg. 121.
  
• The Common Randomness Capacity of a Finite Network of Channels.
  S. Venkatesan and V. Anantharam.
  Proceedings of the 31st Asilomar Conference on Signals, Systems and Computers, November 2 -5 1997, Asilomar, California, pp. 1359 -1363.
  
• On the Departure Process of a Leaky Bucket System with Long-Range Dependent Input Traffic.
  S. Vamvakos and V. Anantharam.
  Proceedings of the IEEE ATM '97 Workshop, Lisboa, Portugal, May 26 -28, 1997, pp. 223 - 232.
  
• Achieving 100 % Throughput in an Input-Queued switch.
  N. Mckeown, V. Anantharam, and J. Walrand.
  Proceedings of the IEEE INFOCOM, San Francisco, March 24 -28, 1996, Volume 1, pp. 296 -302.
  
• Optimal Routing Control: Game Theoretic Approach.
  Richard J. La and V. Anantharam.
  Proceedings of the 36rd IEEE Conference on Decision and Control, San Diego, CA, Dec. 1997, pp. 2910 -2915.
  
• Queueing Analysis with Traffic Models based on Deterministic Dynamical Systems.
  V. Anantharam.
  Proceedings of the 35th Allerton Conference on Communications, Control, and Computing, Champaign, Illinois, Sep 29 - Oct 1, 1997 pp. 233 -241.
  
• The Common Randomness Capacity of a Finite Network of Processors.
  S. Venkatesan and V. Anantharam.
  Proccedings of the 36th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana -Champaign, Sep. 23 - 25, 1998, pp. 10 -14.
  
• Optimal Sequences and the Sum Capacity of Synchronous CDMA Systems.
  P. Viswanath and V. Anantharam.
  Proceedings of the 36th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana -Champaign, Sep. 23 - 25, 1998, pp. 272 -281.
  
• Identification plus Transmission over Channels with Perfect Feedback.
  S. Venkatesan and V. Anantharam.
  Proceedings of the 34th Allerton Conference on Communications, Control, and Computing, Champaign, Illinois, Oct. 2 -4, 1996, pp. 66 -73.
  
• The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels.
  S. Venkatesan and V. Anantharam.
  Proceedings of the 34th Allerton Conference on Communications, Control, and Computing, Champaign, Illinois, Oct. 2 -4, 1996, pp. 84 -91.
  

Book articles and other articles

• Networks of Queues with Long-Range Dependent Traffic Streams.
  V. Anantharam.
  Stochastic Networks: Stability and Rare Events, edited by Paul Glasserman, Karl Sigman, and David Yao, Lecture Notes in Statistics, Vol. 117, pp. 237 - 256, Springer Verlag, 1996.
  
• Mathematical Theory of Communication Networks.
  V. Anantharam.
  Stochastic Analysis and Related Topics V : The Silivri Workshop, 1994., H. Korezlioglu, B. Oksendal, and A. S. Ustunel, eds., Birkhauser, 1996, pp. 1 -39.
  

Unpublished documents and miscellania

• Adaptive Modification of Generalized Processor Sharing
  Richard La and V. Anantharam.
  August 1998.
  
• Estimation of Travel Time Distribution and Detection of Incidents based on Automatic Vehicle Classification.
  V. Anantharam.
  California PATH Working Paper UCB-ITS-PWP-98-12, June 1998.
  
• Deterministic Simulation of Randomized protocols over Arbitrary Networks of Noisy Channels.
  S. Venkatesan and V. Anantharam.
  UCB/ERL Memorandum, No. M96/65, Electronics Research Laboratory, University of California, Berkeley, 30 August 1996.
  

1993-1995

Journal Papers

• Optimal Flow Control Schemes that Regulate the Burstiness of Traffic.
  T. Konstantopoulos and V. Anantharam.
  IEEE/ACM Transactions on Networking, Vol. 3, No. 4, pp. 423 -432, August 1995.
  
• Optimization of a Database Hierarchy for Mobility Tracking in a Personal Communications Network.
  V. Anantharam, M. Honig, U. Madhow, and V. Wei.
  Performance Evaluation, Vol. 20, pp. 287 -300, 1994.
  
• A Technique for Computing Sojourn Times in Large Networks of Interacting Queues.
  V. Anantharam and M. Benchekroun.
  Probability in the Engineering and Informational Sciences, Vol. 7, pp. 441 -464, 1993.
  
• Burst reduction properties of the leaky bucket flow control scheme in ATM networks.
  V. Anantharam and T. Konstantopoulos.
  IEEE Transactions on Communications, Vol. 42, No. 12, pp. 3085 -3089, December 1994.
  
• Error Exponents in a Source Coding Problem of Korner.
  V. Anantharam.
  Journal of Combinatorics, Information and Systems Science, Vol. 20, Nos. 1-4, pp. 141 -152, 1995.
  
• Optimal Buffer Allocation in Tandems of Last Come First Served Queues.
  V. Anantharam and A. Ganesh.
  Queueing Systems : Theory and Applications, Vol. 20, Nos. 3-4, pp. 395 -408, October 1995.
  
• A functional central limit theorem for the jump processes of a uniform Markov chain.
  V. Anantharam and T. Konstantopoulos.
  Advances in Applied Probability. Vol. 27, No. 2, pp. 476 -509, June 1995.
  
• Correctness Within a Constant of an Optimal Buffer Allocation Rule of Thumb.
  V. Anantharam and A. Ganesh.
  IEEE Transactions on Information Theory, Vol. 40, No. 3, pp. 871 -882, 1994.
  
• The Input-Output Map of a Monotone Discrete time Quasireversible Node.
  V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 39, No. 2, pp. 543 -552, 1993. See also the correction published in IEEE Transactions on Information Theory, Vol. 39, No. 4, pg. 1466, 1993.
  
• Correction to ``The Input-Output Map of a Monotone Discrete time Quasireversible Node".
  V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 39, No. 4, pg. 1466, 1993.
  
• Uniqueness of stationary ergodic fixed point for a ./M/K node.
  V. Anantharam.
  Annals of Applied Probability, Vol. 3, No. 1, pp. 154 -172, 1993. See also the correction published in Vol. 4, No. 2, pg. 607, 1994.
  
• Correction to ``Uniqueness of stationary ergodic fixed point for a ./M/K node".
  V. Anantharam.
  Annals of Applied Probability, Vol. 4, No. 2, pg. 607, 1994.
  

Conference Proceedings Papers

• On the Sojourn time of Sessions at an ATM Buffer with Long-range Dependent Input Traffic.
  V. Anantharam.
  Proceedings of the 34rd IEEE Conference on Decision and Control, New Orleans, Louisiana, December 13 -15, 1995, Volume 1, pp. 859 -864.
  
• Bits through Queues.
  V. Anantharam and S. Verdu.
  Proceedings of the 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, June 27 - July 1, 1994, pg. 371.
  
• Optimal Flow Control schemes for ATM Networks.
  T. Konstantopoulos and V. Anantharam.
  Proceeding of GLOBECOM '94, San Francisco, Nov. 27 - Dec. 1, 1994, pp. 1763 -1767.
  
• Stationary Solutions of Stochastic Recursions describing Discrete Event Sytems.
  V. Anantharam and T. Konstantopoulos.
  Proceedings of the 33rd IEEE Conference on Decision and Control, Lake Buena Vista, Florida, December 14 -16, 1994, pp. 1481 -1486. See also the correction to journal paper published in Stochastic Processes and Their Applications, Vol. 80, No. 2, pp. 271-278, April 1999.
  
• An optimal flow control scheme that regulates the burstiness of traffic subject to delay constraints.
  V. Anantharam and T. Konstantopoulos.
  Proceedings of the 32nd IEEE Conference on Decision and Control, San Antonio, Texas, December 15 -17, 1993, pp. 3606 -3610.
  
• An approach to the Design of High-Speed Networks for Bursty Traffic.
  V. Anantharam.
  Proceedings of the 32nd IEEE Conference on Decision and Control}, San Antonio, Texas, December 15 -17, 1993, pp. 1678 -1679.
  
• Optimality and Interchangeability of Leaky Bucket Regulators in Tandem.
  V. Anantharam and T. Konstantopoulos.
  Proceedings of the 32nd Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana, September 28 -30, 1994, pp. 235 -244.
  
• Optimization of a signalling hierarchy for mobility tracking in personal communications.
  V. Anantharam, M. Honig, U. Madhow, and V. Wei.
  Proceedings of the International Teletraffic Congress sponsored seminar on Teletraffic Methods for Current and Future Telecom Networks, Indian Institute of Science, Bangalore, India, Nov. 15 -19, 1993, pp. 45 -52.
  
• An approach to the design of high speed networks for bursty traffic.
  V. Anantharam.
  Proceedings of the International Teletraffic Congress sponsored seminar on Teletraffic Methods for Current and Future Telecom Networks, Indian Institute of Science, Bangalore, India, Nov. 15 -19, 1993, pp. 163 -168.
  

Book articles and other articles

• Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals.
  A. Ganesh and V. Anantharam.
  Stochastic Networks, Frank P. Kelly and Ruth J. Williams, eds., Springer Verlag, 1995, (Proceedings of the Workshop on Stochastic Networks, Institute for Mathematics and its Applications, Minnesota, February 28 - March 4, 1994), pp. 367 -385.
  

Unpublished documents and miscellania

• Deterministic Simulation of Randomized protocols over noisy channels.
  S. Venkatesan and V. Anantharam.
  UCB/ERL Memorandum, No. M94/102, Electronics Research Laboratory, University of California, Berkeley, December 1994.
  
• Communication Complexity in a Multi-Processor Broadcast Network.
  S. Venkatesan and V. Anantharam.
  Unpublished document. (1993).
  

1990-1992

Journal Papers

• Effect of Noise on Long Term Memory in Cellular Automata with Asynchronous Communication Delays between the Processors.
  R. Gharavi and V. Anantharam.
  Complex Systems, Vol. 6, No. 3, pp. 287 -300, 1992.
  
• On Fast Simulation of the time to saturation of slotted ALOHA.
  V. Anantharam.
  Journal of Applied Probability, Vol. 29, pp. 682 -690, 1992.
  
• Stochastic Concavity of Throughput in Series of Queues with Finite Buffers.
  V. Anantharam and P. Tsoucas.
  Advances in Applied Probability, Vol. 22, pp. 761 -763, Sep. 1990.
  
• A Large Deviations Approach to Error Exponents in Source Coding and Hypothesis Testing.
  V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 36, No. 4, pp. 938 -943, 1990.
  
• The Stability Region of the Finite User Slotted ALOHA Protocol.
  V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 37, No. 3, pp. 535 -540, May 1991.
  
• A Mean Field Limit for a Lattice Caricature of Dynamic Routing in Circuit Switched Networks.
  V. Anantharam,
  Annals of Applied Probability Vol. 1, No. 4, pp. 481 -503, 1991.
  

Conference Proceedings Papers

• A Structure Theorem for Partially Asynchronous Relaxations.
  R. Gharavi and V. Anantharam.
  Proceedings of the 1992 Conference on Information Sciences and Systems, Princeton University, Mar. 18 -20, 1992, pp. 433 -435.
  
• A functional central limit theorem for Markov chain jumps with applications.
  V. Anantharam and P. Konstantopoulos.
  Proceedings of the 1992 Conference on Information Sciences and Systems, Princeton University, Mar. 18 -20, 1992, pp. 108 -113.
  
• Burst reduction properties of leaky bucket strategies in ATM networks.
  V. Anantharam and P. Konstantopoulos.
  Proceedings of the 29th Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana, October 2 -4, 1991, pp. 302 -309.
  
• Effect of Noise on Long Term Memory in Cellular Automata with Asynchronous Communication Delays between the Processors.
  R. Gharavi and V. Anantharam.
  Proceedings of the 1991 IEEE International Symposium on Information Theory, Budapest, Hungary, June 23 -27, 1991, pg. 332.
  
• Controlled Hydrodynamics for Distributed Trunk Reservation Control of Circuit-Switched Networks with Dynamic Routing.
  V. Anantharam.
  Proceedings of the 1990 Bilkent Conference on Communication, Control, and Signal Processing, Bilkent University, Ankara, Turkey, July 1990, pp. 128 -134.
  
• A Technique for Computing the Sojourn Time of Typical Customers in Large Networks of Interacting Queues.
  V. Anantharam and M. Benchekroun.
  Proceedings of the 24th Annual Conference on Information Sciences and Systems, Princeton University, March 21 -23 1990, pp. 491 -496.
  
• A Hydrodynamic Limit for a Lattice Caricature of Dynamic Routing in Circuit Switched Networks.
  V. Anantharam.
  Proceedings of the 9th International Conference on Analysis and Optimization of Systems, Antibes, France, June 12 -15, 1990, pp. 937 -946.
  
• Trunk Reservation Control of Circuit-Switched Networks with Dynamic Routing.
  V. Anantharam and M. Benchekroun.
  Proceedings of the 29th IEEE Conference on Decision and Control, Honolulu, Hawaii, Dec. 5-7, 1990, pp. 2102 -2105.
  
• The Input-Output Map of a Monotone Discrete Time Quasireversible Node.
  V. Anantharam.
  Proceedings of the 30th IEEE Conference on Decision and Control, Brighton, United Kingdom, Dec. 11-13, 1991, pp. 803 -808.
  

Book articles and other articles

• Asymptotically Efficient Adaptive Allocation Rules for Controlled Markov Chains : Finite Parameter Space.
  R. Agrawal, D. Teneketzis, and V. Anantharam.
  Advances in Adaptive Control, K. S. Narendra, R. Ortega, and P. Dorato, eds., paper 4.7, pp. 226 -236, IEEE Press, 1991.
  

Unpublished documents and miscellania

• Analysis of Rare Events in Continuous Time Markov Chains via Time Reversal and Fluid Approximation.
  V. Anantharam, P. Heidelberger, and P. Tsoucas.
  Research Report, RC 16280, Computer Science Division, IBM T. J. Watson Center, Yorktown Heights, New York, Nov. 1990.
  

1987-1989

Journal Papers

• A Proof of the Markov Chain Tree Theorem.
  V. Anantharam and P. Tsoucas.
  Statistics and Probability Letters, Vol. 8, pp. 189 -192, 1989.
  
• Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases.
  V. Anantharam.
  Queueing Systems : Theory and Applications, Vol. 5, pp. 77 -98, 1989.
  
• How large delays build up in a GI/G/1 queue.
  V. Anantharam.
  Queueing Systems - Theory and Applications, Vol. 5, pp. 345 -368, 1989.
  
• Modelling the flow of coalescing data streams through a processor.
  V. Anantharam.
  Journal of Applied Probability, Vol. 25, No. 1, Mar 1988. pp. 184 -193.
  
• Probabilistic proof of the interchangeability of ./M/1 queues in series.
  V. Anantharam.
  Queueing Systems - Theory and Applications, Vol. 2, No.4, Dec. 1987, pp. 387 -392.
  
• A generalization of the Erlang formula of Traffic engineering.
  V. Anantharam, B. Gopinath, and D. J. Hajela.
  Queueing Systems - Theory and Applications, Vol. 3, 1988, pp. 277 -288.
  
• Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with multiple plays, Part I : I.I.D. rewards.
  V. Anantharam, P. Varaiya, and J. Walrand.
  IEEE Transactions on Automatic Control, Vol. AC-32, No. 11, Nov. 1987, pp. 968 -976.
  
• Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with multiple plays, Part II : Markovian rewards.
  V. Anantharam, P. Varaiya, and J. Walrand.
  IEEE Transactions on Automatic Control, Vol. AC-32, No. 11, Nov. 1987, pp. 977 -982.
  
• Asymptotically Efficient Adaptive Allocation Rules for Controlled Markov Chains : Finite Parameter Space.
  R. Agrawal, D. Teneketzis, and V. Anantharam.
  IEEE Transactions on Automatic Control, Vol. 34, No. 12, pp. 1249 -1259, Dec. 1989.
  
• Asymptotically Efficient Adaptive Allocation Schemes for Controlled IID Processes : Finite parameter space.
  R. Agrawal, D. Teneketzis, and V. Anantharam.
  IEEE Transactions on Automatic Control, Vol. 34, No 3, pp 258 -267, March 1989.
  
• The Optimal Buffer Allocation Problem.
  V. Anantharam.
  IEEE Transactions on Information Theory, Vol. 35, No. 4, pp. 721 -725, 1989.
  

Conference Proceedings Papers

• Adaptive Control of I.I.D. Processes : Finite Parameter Space.
  R. Agrawal, D. Teneketzis, and V. Anantharam.
  Proceedings of the 22nd Annual Conference on Information Sciences and Systems, Princeton University, Mar. 16 -18, 1988, pp. 405 -409.
  
• The optimal buffer allocation problem.
  V. Anantharam.
  Proceedings of the 22nd Annual Conference on Information Sciences and Systems, Princeton University, Mar. 16 -18, 1988, pp. 629 -632.
  
• How large delays build up in a GI/G/1 queue.
  V. Anantharam.
  Proceedings of the 26th IEEE Conference on Decision and Control, Los Angeles, Dec. 9 -11, 1987, pp. 1871 -1872.
  
• Asymptotically Efficient Adaptive Allocation Schemes for Controlled Markov Chains : Finite Parameter Space.
  R. Agrawal, D. Teneketzis, and V. Anantharam.
  Proceedings of the 27th IEEE Conference on Decision and Control, University of Texas, Austin, Dec. 6 -9, 1988, pp. 1198 -1203.
  
• The Stability Region of the Finite User Slotted ALOHA Protocol.
  V. Anantharam.
  Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, Florida, Dec 13 -15, 1989, pp. 579 -584.
  
• Metastability and Phase Transitions Associated to Dynamic Routing in Networks.
  V. Anantharam.
  Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, Florida, Dec 13 -15, 1989, pp. 2549 -2553.
  
• The Settling Time of a Closed Jackson Network.
  V. Anantharam.
  Proceedings of the 25th Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana, Illinois, Sep. 30 -Oct. 2 1987, pp. 684 -693.
  

Book articles and other articles

• Asymptotically efficient rules in multiarmed bandit problems.
  V. Anantharam and P. Varaiya.
  Modelling and adaptive control (Sopron, 1986), Lecture Notes in Control and Information Science, Vol. 105, Springer, Berlin, 1988, pp. 1 -9.
  
• An optimal strategy for a conflict resolution problem.
  V. Anantharam and P. Varaiya.
  Specific Problems on Communication and Computation, T. Cover and B. Gopinath, eds., Springer Verlag, 1987, pp. 210 -216.
  

Unpublished documents and miscellania

• Distributed detection with a large Number of Sensors.
  V. Anantharam.
  Unpublished document (1988).
  
• The Settling Time of a Closed Jackson Network.
  V. Anantharam.
  Unpublished document (1987).
  

1981-1986

Journal Papers

• An optimal strategy for a conflict resolution problem.
  V. Anantharam and P. Varaiya.
  Systems and Control Letters, 7, July 1986, pp. 329 -332.
  
• On stabilization and the existence of Coprime factorizations.
  V. Anantharam.
  IEEE Trans. on Automatic Control, Vol AC-30, No. 10, Oct. '85, pp. 1030 -1031.
  
• On the stabilization of Nonlinear systems.
  V. Anantharam and C. A. Desoer.
  IEEE Trans. on Automatic Control, Vol AC-29, No. 6, June '84, pp. 569 -572.
  
• A Note on the Shaping of Dual Reflector Antennas.
  M.S. Narasimhan, V. Anantharam, and K.M. Prasad.
  IEEE Trans. on Antennas and Propagation, Vol AP-29, No. 3, May '81, pp. 551 -552.
  

Conference Proceedings Papers

• Asymptotically Efficient Rules in Multiarmed Bandit Problems.
  V. Anantharam and P. Varaiya.
  Proceedings of the 25th Conference on Decision and Control, Athens, Greece, Dec. 1986, pp. 251 -252.
  
• Unstable queues with arrival rate less than the rate of service.
  V. Anantharam, S. Parekh, and P. Varaiya.
  Proceedings of the 24th Conference on Decision and Control, Florida, Dec. 1985, pp. 1347 -1348.
  
• An optimal strategy for a conflict resolution problem.
  V. Anantharam and P. Varaiya.
  Proceedings of the 24th Conference on Decision and Control, Florida, Dec. 1985, pp. 1113 -1114.
  
• A generalization of the Erlang formula of Traffic engineering.
  V. Anantharam and B. Gopinath.
  Proceedings of the 24th Conference on Decision and Control, Florida, Dec. 1985. pp. 2041 -2044.
  
• Tracking and Disturbance Rejection of MIMO Nonlinear Systems with a PI or PS controller.
  V. Anantharam and C.A. Desoer.
  Proceedings of the 24th Conference on Decision and Control, Florida, Dec. 1985, pp. 1367 -1368.
  
• Modelling the flow of coalescing data streams through a processor.
  V. Anantharam.
  Proceedings of the 23rd Allerton Conference on Communication, Control and Computing, Univ. of Illinois, Urbana, Oct. 1985, pp. 693 -702.
  

up to 1980

Journal Papers

• Analytical Solutions for the Breakdown Voltages of Punched Through Diodes having Curved Junction Boundaries at the Edges.
  V. Anantharam and K. N. Bhat.
  IEEE Trans. on Electron Devices, Vol. ED-27, No. 5, May 1980, pp. 939 -945.
  
• Current Gain in Bipolar Transistors with a Field Plate over the Base Surface.
  V. Anantharam and K. N. Bhat.
  IEE Proceedings -I, Solid state and Electron devices, Vol 127, Part 1, No. 1, Feb 1980, pp. 15 -20.