Sidharth Jaggi

4.3k total citations · 1 hit paper
114 papers, 2.6k citations indexed

About

Sidharth Jaggi is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, Sidharth Jaggi has authored 114 papers receiving a total of 2.6k indexed citations (citations by other indexed papers that have themselves been cited), including 79 papers in Computer Networks and Communications, 79 papers in Electrical and Electronic Engineering and 27 papers in Artificial Intelligence. Recurrent topics in Sidharth Jaggi's work include Wireless Communication Security Techniques (61 papers), Cooperative Communication and Network Coding (60 papers) and Error Correcting Code Techniques (16 papers). Sidharth Jaggi is often cited by papers focused on Wireless Communication Security Techniques (61 papers), Cooperative Communication and Network Coding (60 papers) and Error Correcting Code Techniques (16 papers). Sidharth Jaggi collaborates with scholars based in Hong Kong, United States and India. Sidharth Jaggi's co-authors include Michelle Effros, Michael Langberg, Mayank Bakshi, Philip A. Chou, Kamal Jain, Pak Hou, Ludo Tolhuizen, Peter Sanders, Sebastian Egner and Muriel Médard and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Medical Imaging and IEEE Transactions on Communications.

In The Last Decade

Sidharth Jaggi

111 papers receiving 2.5k citations

Hit Papers

Polynomial Time Algorithms for Multicast Network Code Con... 2005 2026 2012 2019 2005 200 400 600

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Sidharth Jaggi Hong Kong 21 1.9k 1.8k 664 284 200 114 2.6k
Khaled Abdel-Ghaffar United States 29 2.4k 1.2× 2.1k 1.2× 725 1.1× 343 1.2× 43 0.2× 159 2.9k
Christina Fragouli United States 35 4.3k 2.2× 3.3k 1.9× 425 0.6× 99 0.3× 48 0.2× 236 4.7k
Ugo Vaccaro Italy 24 683 0.4× 335 0.2× 847 1.3× 210 0.7× 102 0.5× 84 1.6k
Sergey Yekhanin United States 23 1.6k 0.9× 270 0.2× 1.1k 1.7× 344 1.2× 30 0.1× 50 2.6k
Gianluigi Liva Germany 23 2.1k 1.1× 2.4k 1.3× 277 0.4× 139 0.5× 11 0.1× 157 2.8k
G. Solomon United States 8 1.7k 0.9× 1.0k 0.6× 1.3k 2.0× 135 0.5× 13 0.1× 26 2.7k
Soheil Mohajer United States 15 568 0.3× 587 0.3× 200 0.3× 65 0.2× 45 0.2× 96 957
Mayank Bakshi Hong Kong 13 236 0.1× 444 0.3× 291 0.4× 78 0.3× 52 0.3× 42 595
Nicholas J. A. Harvey United States 18 1.0k 0.5× 357 0.2× 302 0.5× 37 0.1× 21 0.1× 52 1.5k
Ruizhong Wei Canada 18 185 0.1× 620 0.3× 653 1.0× 125 0.4× 27 0.1× 72 1.0k

Countries citing papers authored by Sidharth Jaggi

Since Specialization
Citations

This map shows the geographic impact of Sidharth Jaggi'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 Sidharth Jaggi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sidharth Jaggi more than expected).

Fields of papers citing papers by Sidharth Jaggi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sidharth Jaggi. 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 Sidharth Jaggi. The network helps show where Sidharth Jaggi may publish in the future.

Co-authorship network of co-authors of Sidharth Jaggi

This figure shows the co-authorship network connecting the top 25 collaborators of Sidharth Jaggi. A scholar is included among the top collaborators of Sidharth Jaggi 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 Sidharth Jaggi. Sidharth Jaggi 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.
Dey, Bikash Kumar, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, & Yang Zhang. (2024). Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs. Explore Bristol Research. 1586–1591. 1 indexed citations
2.
Dey, Bikash Kumar, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, & Yihan Zhang. (2024). Codes for Adversaries: Between Worst-Case and Average-Case Jamming. Explore Bristol Research. 21(3-4). 300–588. 1 indexed citations
3.
Jaggi, Sidharth, et al.. (2024). Design and implementation of VGD6-NET framework for waste segregation using 3-tier convolutional neural networks. Journal of Material Cycles and Waste Management. 27(1). 223–240. 1 indexed citations
4.
Zhang, Qiaosheng, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, & Alex Sprintson. (2023). Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes. IEEE Transactions on Communications. 71(12). 7206–7217.
5.
Zhang, Qiaosheng, Mayank Bakshi, & Sidharth Jaggi. (2021). Covert Communication Over Adversarially Jammed Channels. IEEE Transactions on Information Theory. 67(9). 6096–6121. 16 indexed citations
6.
Zhang, Qiaosheng, et al.. (2020). Stealthy Communication Over Adversarially Jammed Multipath Networks. IEEE Transactions on Communications. 68(12). 7473–7484. 7 indexed citations
7.
Jaggi, Sidharth, et al.. (2020). Empirical Properties of Good Channel Codes. Bristol Research (University of Bristol). 2337–2342. 2 indexed citations
8.
Dey, Bikash Kumar, et al.. (2020). Symmetrizability for Myopic AVCs. Bristol Research (University of Bristol). 2103–2107. 6 indexed citations
9.
Zhang, Qiaosheng, Mayank Bakshi, & Sidharth Jaggi. (2019). Covert Communication With Polynomial Computational Complexity. IEEE Transactions on Information Theory. 66(3). 1354–1384. 14 indexed citations
10.
Bogdanov, Andrej, et al.. (2019). When are large codes possible for AVCs?. 632–636. 15 indexed citations
11.
Jaggi, Sidharth, et al.. (2017). Learning Immune-Defectives Graph through Group Tests. IEEE Transactions on Information Theory. 1–1. 5 indexed citations
12.
Grigorescu, Elena, et al.. (2016). Nearly optimal sparse group testing. 401–408. 8 indexed citations
13.
Bakshi, Mayank, Sidharth Jaggi, Sheng Cai, & Minghua Chen. (2015). SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits. IEEE Transactions on Information Theory. 62(12). 7419–7444. 3 indexed citations
14.
Jaggi, Sidharth, et al.. (2015). Learning immune-defectives graph through group tests. Explore Bristol Research. 66–70. 2 indexed citations
15.
Dey, Bikash Kumar, Sidharth Jaggi, Michael Langberg, & Anand D. Sarwate. (2012). Improved upper bounds on the capacity of binary channels with causal adversaries. 681–685. 11 indexed citations
16.
Langberg, Michael, Sidharth Jaggi, & Bikash Kumar Dey. (2009). Binary causal-adversary channels. 2723–2727. 21 indexed citations
17.
Dey, Bikash Kumar, Sidharth Jaggi, & Michael Langberg. (2009). Codes against online adversaries. DSpace (IIT Bombay). ii. 1169–1176. 8 indexed citations
18.
Ephremides, Anthony, et al.. (2008). Network coding. Journal of Communications and Networks. 5 indexed citations
19.
Jaggi, Sidharth, Peter Sanders, Philip A. Chou, et al.. (2005). Polynomial time algorithms for network code construction. IEEE Transactions on Information Theory. 21 indexed citations
20.
Jaggi, Sidharth & Amitabh Joshi. (2001). Incorporating Spatial Variation in Density Enhances the Stability of Simple Population Dynamics Models. Journal of Theoretical Biology. 209(2). 249–255. 8 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