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).
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
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
Coppersmith, Don & Atri Rudra. (2005). On the Robust Testability of Product of Codes. Electronic colloquium on computational complexity.9 indexed citations
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.