World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
55
Citations
12295
World Ranking
4307
National Ranking
2025

Research.com Recognitions

  • 1998 - IEEE Fellow For contributions to the analysis and control of communication networks.

Overview

Venkat Anantharam is affiliated with the University of California, Berkeley in the United States. Their research spans multiple fields and subfields within computer science, with a focus on areas such as artificial intelligence, computational theory and mathematics, management science and operations research, molecular biology, and economics and econometrics.

The main topics of their work include:

  • Wireless Communication Security Techniques
  • DNA and Biological Computing
  • Cellular Automata and Applications
  • Game Theory and Applications
  • Algorithms and Data Compression
  • Game Theory and Voting Systems
  • Markov Chains and Monte Carlo Methods

Frequent publication venues for their work are:

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • 2022 IEEE International Symposium on Information Theory (ISIT)
  • Systems & Control Letters
  • Dynamic Games and Applications

Recent papers authored or co-authored by Venkat Anantharam include:

  • A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma, 2021, IEEE Transactions on Information Theory
  • Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality, 2022, IEEE Transactions on Information Theory
  • One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information, 2021, IEEE Transactions on Information Theory
  • Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity, 2021, arXiv (Cornell University)
  • Sequential Channel Synthesis, 2022, 2022 IEEE International Symposium on Information Theory (ISIT)

Venkat Anantharam has worked with several frequent co-authors, including Soham R. Phade, Payam Delgosha, Lei Yu, Cheuk Ting Li, and Jun Chen. These collaborations reflect a pattern of interconnected research efforts across information theory and related topics.

Their academic contributions have been recognized through professional acknowledgments such as being named an IEEE Fellow in 1998, awarded for contributions to the analysis and control of communication networks.

Best Publications

  • Achieving 100% throughput in an input-queued switch

    N. McKeown;A. Mekkittikul;V. Anantharam;J. Walrand

  • Achieving 100% throughput in an input-queued switch

    N. McKeown;V. Anantharam;J. Walrand

  • Analysis and comparison of TCP Reno and Vegas

    J. Mo;R.J. La;V. Anantharam;J. Walrand

  • Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards

    V. Anantharam;P. Varaiya;J. Walrand

  • Bits through queues

    V. Anantharam;S. Verdu

  • Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers

    P. Viswanath;V. Anantharam;D.N.C. Tse

  • Optimal sequences and sum capacity of synchronous CDMA systems

    P. Viswanath;V. Anantharam

  • Utility-based rate control in the Internet for elastic traffic

    Richard J. La;Venkat Anantharam

  • Asymptotically optimal water-filling in vector multiple-access channels

    P. Viswanath;D.N.C. Tse;V. Anantharam

  • VLSI architectures for iterative decoders in magnetic recording channels

    Engling Yeo;P. Pakzad;B. Nikolic;V. Anantharam

  • An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors

    Zhengya Zhang;V. Anantharam;M.J. Wainwright;B. Nikolic

  • Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes

    L. Dolecek;Zhengya Zhang;V. Anantharam;M.J. Wainwright

  • High throughput low-density parity-check decoder architectures

    E. Yeo;P. Pakzad;B. Nikolic;V. Anantharam

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

    Venkat Anantharam;Amin Aminzadeh Gohari;Sudeep Kamath;Chandra Nair

  • The stability region of the finite-user slotted ALOHA protocol

    V. Anantharam

  • Charge-sensitive TCP and rate control in the Internet

    R.J. La;V. Anantharam

  • Information-Theoretic Key Agreement of Multiple Terminals—Part I

    Amin Aminzadeh Gohari;Venkat Anantharam

  • Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices

    Zhengya Zhang;L. Dolecek;B. Nikolic;V. Anantharam

  • Optimal sequences for CDMA under colored noise: a Schur-saddle function property

    P. Viswanath;V. Anantharam

  • GEN03-6: Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation

    Zhengya Zhang;Lara Dolecek;Borivoje Nikolic;Venkat Anantharam

Frequent Co-Authors

Lara Dolecek
Lara Dolecek University of California, Los Angeles
Borivoje Nikolic
Borivoje Nikolic University of California, Berkeley
Zhengya Zhang
Zhengya Zhang University of Michigan–Ann Arbor
Pramod Viswanath
Pramod Viswanath Princeton University
David Tse
David Tse Stanford University
François Baccelli
François Baccelli French Institute for Research in Computer Science and Automation - INRIA
Jean Walrand
Jean Walrand University of California, Berkeley
Pravin Varaiya
Pravin Varaiya University of California, Berkeley
Vivek S. Borkar
Vivek S. Borkar Indian Institute of Technology Bombay

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of flexible online degree options and specialized career trajectories. For students seeking cost-effective education, there are several programs offering cheapest masters degrees in technology and related fields. These affordable online master's programs are ideal for advancing technical expertise without extensive financial burden.

Those aiming for leadership or academic roles might consider an online phd in organizational leadership. Such programs can complement a Computer Science background by focusing on advanced management and organizational strategy. For students at the beginning of their academic journey, easiest associate degree options provide a quick entry point to start learning core concepts and building foundational skills.

Additionally, educators or professionals interested in higher-level administration may pursue the cheapest online edd programs. These degrees support those looking to influence educational policy or leadership in tech-oriented academic settings. Each of these flexible pathways presents unique opportunities to tailor your learning and accelerate your career in fields connected to Computer Science.

Best Scientists Citing Venkat Anantharam

Trending Scientists

Recently Published Articles