Pramod Viswanath

28.1k total citations · 5 hit papers
156 papers, 18.5k citations indexed

About

Pramod Viswanath is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, Pramod Viswanath has authored 156 papers receiving a total of 18.5k indexed citations (citations by other indexed papers that have themselves been cited), including 101 papers in Computer Networks and Communications, 84 papers in Electrical and Electronic Engineering and 55 papers in Artificial Intelligence. Recurrent topics in Pramod Viswanath's work include Cooperative Communication and Network Coding (53 papers), Advanced MIMO Systems Optimization (38 papers) and Wireless Communication Security Techniques (36 papers). Pramod Viswanath is often cited by papers focused on Cooperative Communication and Network Coding (53 papers), Advanced MIMO Systems Optimization (38 papers) and Wireless Communication Security Techniques (36 papers). Pramod Viswanath collaborates with scholars based in United States, India and United Kingdom. Pramod Viswanath's co-authors include David Tse, Rajiv Laroia, Aleksandar Jovičić, Venkat Anantharam, Sanjeev R. Kulkarni, Saurabha Tavildar, Sewoong Oh, Quan Geng, L. Zheng and Aaron B. Wagner and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Journal on Selected Areas in Communications and IEEE Transactions on Wireless Communications.

In The Last Decade

Pramod Viswanath

146 papers receiving 17.8k citations

Hit Papers

Fundamentals of Wireless Communication 2002 2026 2010 2018 2005 2003 2002 2003 2009 2.5k 5.0k 7.5k

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Pramod Viswanath United States 35 15.7k 12.3k 1.9k 1.6k 543 156 18.5k
Branka Vucetic Australia 66 13.4k 0.9× 10.6k 0.9× 2.2k 1.2× 1.6k 1.0× 385 0.7× 642 16.2k
Giuseppe Caire Germany 58 14.3k 0.9× 12.1k 1.0× 2.2k 1.2× 909 0.6× 528 1.0× 550 18.1k
Xiaohu You China 56 14.9k 0.9× 7.4k 0.6× 3.9k 2.1× 1.4k 0.9× 510 0.9× 1.0k 18.0k
Pingzhi Fan China 59 13.2k 0.8× 6.1k 0.5× 3.0k 1.6× 2.2k 1.4× 551 1.0× 563 16.1k
Vincent K. N. Lau Hong Kong 49 9.9k 0.6× 6.3k 0.5× 1.5k 0.8× 961 0.6× 438 0.8× 524 11.6k
George K. Karagiannidis Greece 76 22.3k 1.4× 10.4k 0.8× 5.4k 2.9× 1.4k 0.9× 416 0.8× 687 25.6k
Jinhong Yuan Australia 64 16.8k 1.1× 8.4k 0.7× 5.4k 2.9× 1.6k 1.0× 460 0.8× 600 19.2k
Kai‐Kit Wong United Kingdom 68 14.9k 0.9× 8.0k 0.7× 5.8k 3.1× 1.5k 0.9× 315 0.6× 699 18.4k
Naofal Al‐Dhahir United States 58 13.2k 0.8× 5.9k 0.5× 4.2k 2.3× 1.1k 0.7× 755 1.4× 589 15.2k
Jeffrey H. Reed United States 48 7.6k 0.5× 6.6k 0.5× 2.1k 1.1× 1.3k 0.8× 1.4k 2.6× 371 10.8k

Countries citing papers authored by Pramod Viswanath

Since Specialization
Citations

This map shows the geographic impact of Pramod Viswanath's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pramod Viswanath with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pramod Viswanath more than expected).

Fields of papers citing papers by Pramod Viswanath

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pramod Viswanath. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pramod Viswanath. The network helps show where Pramod Viswanath may publish in the future.

Co-authorship network of co-authors of Pramod Viswanath

This figure shows the co-authorship network connecting the top 25 collaborators of Pramod Viswanath. A scholar is included among the top collaborators of Pramod Viswanath based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pramod Viswanath. Pramod Viswanath is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kannan, Sreeram, et al.. (2023). TrustBoost: Boosting Trust among Interoperable Blockchains. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 1571–1584. 4 indexed citations
2.
Jamali, Mohammad Vahid, et al.. (2023). Machine Learning-Aided Efficient Decoding of Reed–Muller Subcodes. IEEE Journal on Selected Areas in Information Theory. 4. 260–275.
3.
Kim, Hyeji, et al.. (2022). TinyTurbo: Efficient Turbo Decoders on Edge. 2022 IEEE International Symposium on Information Theory (ISIT). 2797–2802. 9 indexed citations
4.
Gao, Weihao, et al.. (2019). Learning one-hidden-layer neural networks under general input distributions. International Conference on Artificial Intelligence and Statistics. 1950–1959. 2 indexed citations
5.
Asnani, Himanshu, et al.. (2018). Estimators for Multivariate Information Measures in General Probability Spaces. Neural Information Processing Systems. 31. 8664–8675.
6.
Viswanath, Pramod, et al.. (2017). Deanonymization in the Bitcoin P2P Network. Neural Information Processing Systems. 30. 1364–1373. 20 indexed citations
7.
Venkatakrishnan, Shaileshh Bojja, Mohammad Alizadeh, & Pramod Viswanath. (2017). Costly circuits, submodular schedules and approximate Carathéodory Theorems. Queueing Systems. 88(3-4). 311–347. 13 indexed citations
8.
Gao, Weihao, Sreeram Kannan, Sewoong Oh, & Pramod Viswanath. (2017). Estimating Mutual Information for Discrete-Continuous Mixtures. arXiv (Cornell University). 30. 5986–5997. 20 indexed citations
9.
Tyagi, Himanshu, Pramod Viswanath, & Shun Watanabe. (2017). Interactive Communication for Data Exchange. IEEE Transactions on Information Theory. 64(1). 26–37. 4 indexed citations
10.
Gao, Weihao, Sewoong Oh, & Pramod Viswanath. (2017). Demystifying fixed k-nearest neighbor information estimators. 1267–1271. 23 indexed citations
11.
Bhat, Suma, et al.. (2017). MORSE: Semantic-ally Drive-n MORpheme SEgment-er. 552–561.
12.
Kairouz, Peter, et al.. (2016). Rumor Source Obfuscation on Irregular Trees. ACM SIGMETRICS Performance Evaluation Review. 44(1). 153–164. 7 indexed citations
13.
Kairouz, Peter, Sewoong Oh, & Pramod Viswanath. (2015). Secure multi-party differential privacy. Neural Information Processing Systems. 28. 2008–2016. 15 indexed citations
14.
Kairouz, Peter, Sewoong Oh, & Pramod Viswanath. (2014). Optimality of Non-Interactive Randomized Response.. arXiv (Cornell University). 2 indexed citations
15.
Geng, Quan & Pramod Viswanath. (2014). The optimal mechanism in differential privacy. 2371–2375. 55 indexed citations
16.
Geng, Quan & Pramod Viswanath. (2013). The Optimal Mechanism in $(\epsilon,\delta)$-Differential Privacy. arXiv (Cornell University). 1 indexed citations
17.
Geng, Quan & Pramod Viswanath. (2012). Optimal Noise-Adding Mechanism in Differential Privacy. arXiv (Cornell University). 3 indexed citations
18.
Viswanath, Pramod, et al.. (2010). Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows. arXiv (Cornell University). 2 indexed citations
19.
Viswanath, Pramod & Venkat Anantharam. (2002). Optimal sequences for CDMA under colored noise: a Schur-saddle function property. IEEE Transactions on Information Theory. 48(6). 1295–1318. 78 indexed citations
20.
Viswanath, Pramod, David Tse, & Venkat Anantharam. (2001). Asymptotically optimal water-filling in vector multiple-access channels. IEEE Transactions on Information Theory. 47(1). 241–267. 132 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026