Atri Rudra

3.9k total citations
64 papers, 1.1k citations indexed

About

Atri Rudra is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Atri Rudra has authored 64 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computer Networks and Communications, 25 papers in Artificial Intelligence and 19 papers in Computational Theory and Mathematics. Recurrent topics in Atri Rudra's work include Coding theory and cryptography (14 papers), Advanced Database Systems and Queries (11 papers) and Complexity and Algorithms in Graphs (10 papers). Atri Rudra is often cited by papers focused on Coding theory and cryptography (14 papers), Advanced Database Systems and Queries (11 papers) and Complexity and Algorithms in Graphs (10 papers). Atri Rudra collaborates with scholars based in United States, India and Israel. Atri Rudra's co-authors include Hung Q. Ngo, Venkatesan Guruswami, Christopher Ré, Mahmoud Abo Khamis, Avrim Blum, Don Coppersmith, Lisa Fleischer, Vijay Kumar, Akshat Verma and Swapnoneel Roy and has published in prestigious journals such as IEEE Transactions on Information Theory, Communications of the ACM and Journal of Network and Computer Applications.

In The Last Decade

Atri Rudra

61 papers receiving 1.0k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Atri Rudra United States 18 531 488 227 225 193 64 1.1k
Jeff Edmonds Canada 17 195 0.4× 659 1.4× 230 1.0× 211 0.9× 152 0.8× 55 1.1k
Nina Mishra United States 18 839 1.6× 233 0.5× 134 0.6× 147 0.7× 74 0.4× 37 1.2k
Kazuhisa Makino Japan 18 362 0.7× 329 0.7× 587 2.6× 85 0.4× 116 0.6× 146 1.1k
Panagiotis Karras Denmark 21 1.0k 2.0× 539 1.1× 51 0.2× 463 2.1× 121 0.6× 87 1.6k
Csaba D. Tóth United States 15 167 0.3× 154 0.3× 268 1.2× 99 0.4× 126 0.7× 140 848
Chris Giannella United States 14 786 1.5× 571 1.2× 117 0.5× 352 1.6× 55 0.3× 35 1.2k
Liam Roditty Israel 19 199 0.4× 471 1.0× 533 2.3× 127 0.6× 101 0.5× 68 942
Barna Saha United States 13 401 0.8× 316 0.6× 132 0.6× 200 0.9× 267 1.4× 50 821
Yahiko Kambayashi Japan 14 394 0.7× 366 0.8× 184 0.8× 228 1.0× 36 0.2× 105 764
Sheng Ma United States 21 695 1.3× 445 0.9× 94 0.4× 273 1.2× 34 0.2× 56 1.3k

Countries citing papers authored by Atri Rudra

Since Specialization
Citations

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

Fields of papers citing papers by Atri Rudra

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Atri Rudra

This figure shows the co-authorship network connecting the top 25 collaborators of Atri Rudra. A scholar is included among the top collaborators of Atri Rudra 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 Atri Rudra. Atri Rudra 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.
Chen, Beidi, et al.. (2021). Scatterbrain: Unifying Sparse and Low-rank Attention. neural information processing systems. 34. 14 indexed citations
2.
Rudra, Atri & Mary Wootters. (2015). It'll Probably Work Out. 287–296. 2 indexed citations
3.
Chattopadhyay, Arkadev, Jaikumar Radhakrishnan, & Atri Rudra. (2014). Topology matters in communication.. Electronic colloquium on computational complexity. 21. 74.
4.
Khamis, Mahmoud Abo, Hung Q. Ngo, Christopher Ré, & Atri Rudra. (2014). A Resolution-based Framework for Joins: Worst-case and Beyond. arXiv (Cornell University). 1 indexed citations
5.
Tulyakov, Sergey, et al.. (2014). Secure Fingerprint Matching with Generic Local Structures. 3. 84–89. 1 indexed citations
6.
Glasgow, Mark, Carole B. Rudra, Murat Demirbaş, et al.. (2014). Using smartphones to collect time–activity data for long-term personal-level air pollution exposure assessment. Journal of Exposure Science & Environmental Epidemiology. 26(4). 356–364. 56 indexed citations
7.
Ngo, Hung Q., Dung T. Nguyen, Christopher Ré, & Atri Rudra. (2013). Removing the Haystack to Find the Needle(s): Minesweeper, an adaptive join algorithm. arXiv (Cornell University). 1 indexed citations
8.
Ngo, Hung Q., Dung T. Nguyen, Christopher Ré, & Atri Rudra. (2013). Towards Instance Optimal Join Algorithms for Data in Indexes. arXiv (Cornell University). 1 indexed citations
9.
Ngo, Hung Q., Ely Porat, & Atri Rudra. (2011). Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract).. International Colloquium on Automata, Languages and Programming. 557–568. 3 indexed citations
10.
Indyk, Piotr, Hung Q. Ngo, & Atri Rudra. (2010). Efficiently Decodable Non-adaptive Group Testing. 1126–1142. 43 indexed citations
11.
Krauthgamer, Robert, Aranyak Mehta, & Atri Rudra. (2009). Pricing commodities. Theoretical Computer Science. 412(7). 602–613. 3 indexed citations
12.
Cary, Matthew, Atri Rudra, Ashish Sabharwal, & Erik Vee. (2009). Floodlight illumination of infinite wedges. Computational Geometry. 43(1). 23–34. 3 indexed citations
13.
Guruswami, Venkatesan & Atri Rudra. (2008). Soft decoding, dual BCH codes, and better list-decodable eps-biased codes.. Electronic colloquium on computational complexity. 15. 1 indexed citations
14.
Coppersmith, Don, Lisa Fleischer, & Atri Rudra. (2006). Ordering by weighted number of wins gives a good ranking for weighted tournaments. Symposium on Discrete Algorithms. 776–782. 74 indexed citations
15.
Coppersmith, Don & Atri Rudra. (2005). On the Robust Testability of Product of Codes. Electronic colloquium on computational complexity. 9 indexed citations
16.
Guruswami, Venkatesan & Atri Rudra. (2005). Tolerant Locally Testable Codes. Lecture notes in computer science. 306–317. 1 indexed citations
17.
Blum, Avrim, et al.. (2004). Online learning in online auctions. Theoretical Computer Science. 324(2-3). 137–146. 88 indexed citations
18.
Blum, Avrim, et al.. (2003). Online learning in online auctions. Symposium on Discrete Algorithms. 202–204. 26 indexed citations
19.
Bhaskar, Raghav, et al.. (2003). Efficient galois field arithmetic on SIMD architectures. 256–257. 15 indexed citations
20.
Rudra, Atri, et al.. (2001). Efficient Rijndael Encryption Implementation with Composite Field Arithmetic. 6 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