Sekhar Tatikonda

4.6k total citations · 1 hit paper
74 papers, 2.8k citations indexed

About

Sekhar Tatikonda is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, Sekhar Tatikonda has authored 74 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Computer Networks and Communications, 35 papers in Electrical and Electronic Engineering and 18 papers in Artificial Intelligence. Recurrent topics in Sekhar Tatikonda's work include Wireless Communication Security Techniques (25 papers), Error Correcting Code Techniques (20 papers) and Cooperative Communication and Network Coding (14 papers). Sekhar Tatikonda is often cited by papers focused on Wireless Communication Security Techniques (25 papers), Error Correcting Code Techniques (20 papers) and Cooperative Communication and Network Coding (14 papers). Sekhar Tatikonda collaborates with scholars based in United States, United Kingdom and Canada. Sekhar Tatikonda's co-authors include Sanjoy K. Mitter, Anant Sahai, Michael I. Jordan, A. Kavcic, Jian Ni, Vivek S. Borkar, Jian Ni, Ramji Venkataramanan, Shihao Yang and Haiyong Xie and has published in prestigious journals such as IEEE Transactions on Automatic Control, IEEE Transactions on Information Theory and Automatica.

In The Last Decade

Sekhar Tatikonda

68 papers receiving 2.6k citations

Hit Papers

Control Under Communication Constraints 2004 2026 2011 2018 2004 250 500 750 1000

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Sekhar Tatikonda United States 18 1.6k 1.4k 699 395 299 74 2.8k
Fabio Fagnani Italy 23 1.1k 0.7× 1.8k 1.3× 338 0.5× 345 0.9× 221 0.7× 125 3.0k
Harry L. Trentelman Netherlands 26 2.3k 1.4× 926 0.6× 171 0.2× 192 0.5× 428 1.4× 130 3.0k
Guisheng Zhai Japan 30 3.9k 2.4× 1.6k 1.1× 220 0.3× 205 0.5× 466 1.6× 221 4.5k
Wenying Xu China 24 1.1k 0.7× 1.9k 1.3× 498 0.7× 229 0.6× 156 0.5× 65 2.5k
Charalambos D. Charalambous Cyprus 21 485 0.3× 541 0.4× 533 0.8× 270 0.7× 72 0.2× 211 1.4k
Wenbing Zhang China 32 1.6k 1.0× 3.0k 2.1× 482 0.7× 490 1.2× 243 0.8× 89 3.8k
Jun‐e Feng China 24 1.1k 0.7× 750 0.5× 193 0.3× 221 0.6× 644 2.2× 180 2.4k
A. Nedić United States 15 384 0.2× 2.6k 1.8× 466 0.7× 883 2.2× 310 1.0× 20 3.3k
Serdar Yüksel Canada 17 933 0.6× 785 0.5× 326 0.5× 236 0.6× 170 0.6× 158 1.6k
Lulu Li China 22 578 0.4× 1.6k 1.1× 373 0.5× 175 0.4× 129 0.4× 112 2.2k

Countries citing papers authored by Sekhar Tatikonda

Since Specialization
Citations

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

Fields of papers citing papers by Sekhar Tatikonda

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Sekhar Tatikonda

This figure shows the co-authorship network connecting the top 25 collaborators of Sekhar Tatikonda. A scholar is included among the top collaborators of Sekhar Tatikonda 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 Sekhar Tatikonda. Sekhar Tatikonda 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.
Zhuang, Juntang, Nicha C. Dvornek, Sekhar Tatikonda, & James S. Duncan. (2021). MALI: A memory efficient and reverse accurate integrator for Neural ODEs. arXiv (Cornell University). 1 indexed citations
2.
Zhuang, Juntang, et al.. (2020). Adaptive Checkpoint Adjoint Method for Gradient Estimation in Neural ODE.. PubMed. 119. 11639–11649. 6 indexed citations
3.
Tatikonda, Sekhar, et al.. (2019). Learning Unfaithful $K$-separable Gaussian Graphical Models. Journal of Machine Learning Research. 20(109). 1–30. 1 indexed citations
4.
Tatikonda, Sekhar, et al.. (2019). Sparse Regression Codes. arXiv (Cornell University). 15(1-2). 1–195. 24 indexed citations
5.
Mahajan, Aditya & Sekhar Tatikonda. (2015). An algorithmic approach to identify irrelevant information in sequential teams. Automatica. 61. 178–191.
6.
Venkataramanan, Ramji, Tuhin Subhra Sarkar, & Sekhar Tatikonda. (2013). Lossy compression via sparse linear regression: Computationally efficient encoding and decoding. 58. 1182–1186. 9 indexed citations
7.
Venkataramanan, Ramji, Antony Joseph, & Sekhar Tatikonda. (2012). Gaussian Rate-Distortion via Sparse Regression over Compact Dictionaries. arXiv (Cornell University). 1 indexed citations
8.
Tatikonda, Sekhar, et al.. (2010). Convergent and correct message passing schemes for optimization problems over graphical models. Uncertainty in Artificial Intelligence. 500–500. 7 indexed citations
9.
Mahajan, Aditya & Sekhar Tatikonda. (2009). A training-based scheme for communicating over unknown channels with feedback. arXiv (Cornell University). 1 indexed citations
10.
Ni, Jian, Haiyong Xie, Sekhar Tatikonda, & Yi Yang. (2009). Efficient and Dynamic Routing Topology Inference From End-to-End Measurements. IEEE/ACM Transactions on Networking. 18(1). 123–135. 62 indexed citations
11.
Como, Giacomo, Serdar Yüksel, & Sekhar Tatikonda. (2009). The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback. IEEE Transactions on Information Theory. 55(5). 2139–2160. 10 indexed citations
12.
Mahajan, Aditya & Sekhar Tatikonda. (2009). A Graphical modeling approach to simplifying sequential teams. 20. 1–8. 1 indexed citations
13.
Ni, Jian, Sekhar Tatikonda, & Edmund Yeh. (2006). A Large-Scale Distributed Traffic Matrix Estimation Algorithm. Global Communications Conference. 3 indexed citations
14.
Yang, Shaohua, A. Kavcic, & Sekhar Tatikonda. (2006). GEN03-1: Feedback Capacity of Stationary Sources over Gaussian Intersymbol Interference Channels. Globecom. 4. 1–6. 2 indexed citations
15.
Tatikonda, Sekhar. (2004). Convergence of the sum-product algorithm. 222–225. 16 indexed citations
16.
Yang, Shaohua, A. Kavcic, & Sekhar Tatikonda. (2004). Linear gaussian channels: feedback capacity under power constraints. 73–73. 7 indexed citations
17.
Tatikonda, Sekhar & Michael I. Jordan. (2002). Loopy Belief Propogation and Gibbs Measures.. Uncertainty in Artificial Intelligence. 493–500. 7 indexed citations
18.
Tatikonda, Sekhar & Michael I. Jordan. (2002). Loopy belief propagation and Gibbs measures. Uncertainty in Artificial Intelligence. 493–500. 102 indexed citations
19.
Borkar, Vivek S., Sanjoy K. Mitter, & Sekhar Tatikonda. (2001). Markov control problems under communication constraints. Communications in Information and Systems. 1(1). 15–32. 20 indexed citations
20.
Borkar, Vivek S., Sanjoy K. Mitter, & Sekhar Tatikonda. (2001). Optimal Sequential Vector Quantization of Markov Sources. SIAM Journal on Control and Optimization. 40(1). 135–148. 61 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