Rahul Santhanam

1.3k total citations
72 papers, 563 citations indexed

About

Rahul Santhanam is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Rahul Santhanam has authored 72 papers receiving a total of 563 indexed citations (citations by other indexed papers that have themselves been cited), including 60 papers in Computational Theory and Mathematics, 56 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Rahul Santhanam's work include Complexity and Algorithms in Graphs (54 papers), Machine Learning and Algorithms (26 papers) and Cryptography and Data Security (26 papers). Rahul Santhanam is often cited by papers focused on Complexity and Algorithms in Graphs (54 papers), Machine Learning and Algorithms (26 papers) and Cryptography and Data Security (26 papers). Rahul Santhanam collaborates with scholars based in United Kingdom, United States and Canada. Rahul Santhanam's co-authors include Lance Fortnow, Ryan Williams, Adam Tauman Kalai, Hanlin Ren, Ivona Bezáková, Toniann Pitassi, Dieter van Melkebeek, Zhikun Wang, Arkadev Chattopadhyay and Luca Trevisan and has published in prestigious journals such as Journal of the ACM, Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences and SIAM Journal on Computing.

In The Last Decade

Rahul Santhanam

66 papers receiving 508 citations

Peers

Rahul Santhanam

CTM

AI

CNC

EEE

MB

Stephan Kreutzer Germany

Neil J. Calkin United States

Vincent Vajnovszki France

Dieter van Melkebeek United States

Sylvain Gravier France

Michal Koucký Czechia

Yngve Villanger Norway

Hartmut Klauck Singapore

Mauricio Karchmer Israel

Anuj Dawar United Kingdom

Stephan Kreutzer Germany

Rahul Santhanam

489 ×1.0

CTM

155 ×0.5

AI

139 ×1.5

CNC

28 ×0.7

EEE

19 ×0.9

MB

Citations per year, relative to Rahul Santhanam Rahul Santhanam (= 1×) peers Stephan Kreutzer

Countries citing papers authored by Rahul Santhanam

Since Specialization

Citations

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

Fields of papers citing papers by Rahul Santhanam

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rahul Santhanam

This figure shows the co-authorship network connecting the top 25 collaborators of Rahul Santhanam. A scholar is included among the top collaborators of Rahul Santhanam 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 Rahul Santhanam. Rahul Santhanam is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Chen, Lijie, et al.. (2022). Beyond Natural Proofs: Hardness Magnification and Locality. Journal of the ACM. 69(4). 1–49. 4 indexed citations

2.

Goldwasser, Shafi, Russell Impagliazzo, Toniann Pitassi, & Rahul Santhanam. (2021). On the Pseudo-Deterministic Query Complexity of NP Search Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

3.

Santhanam, Rahul, et al.. (2021). Pseudodeterministic algorithms and the structure of probabilistic time. Warwick Research Archive Portal (University of Warwick). 4 indexed citations

4.

Ren, Hanlin, et al.. (2021). Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity.. 28. 82. 1 indexed citations

5.

Santhanam, Rahul, et al.. (2021). . Theory of Computing. 17(1). 1–38.

6.

Saks, Michael & Rahul Santhanam. (2020). Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations

7.

Santhanam, Rahul. (2019). Pseudorandomness and the Minimum Circuit Size Problem.. Oxford University Research Archive (ORA) (University of Oxford). 26. 155. 6 indexed citations

8.

Santhanam, Rahul, et al.. (2018). NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits.. Oxford University Research Archive (ORA) (University of Oxford). 25. 30. 7 indexed citations

9.

Chen, Ruiwen, et al.. (2017). An Average-Case Lower Bound against ACC^0.. 24. 173. 4 indexed citations

10.

Fortnow, Lance & Rahul Santhanam. (2017). Robust simulations and significant separations. Information and Computation. 256. 149–159. 5 indexed citations

11.

Santhanam, Rahul, et al.. (2015). Majority is Incompressible by AC⁰[p] Circuits. Edinburgh Research Explorer (University of Edinburgh). 7 indexed citations

12.

Santhanam, Rahul & Ryan Williams. (2015). Beating exhaustive search for quantified boolean formulas and connections to circuit complexity. Symposium on Discrete Algorithms. 231–241. 2 indexed citations

13.

Santhanam, Rahul & Ryan Williams. (2012). Uniform Circuits, Lower Bounds, and QBF Algorithms. Electronic colloquium on computational complexity. 19. 59. 3 indexed citations

14.

Santhanam, Rahul, et al.. (2012). Permanent does not have succinct polynomial size arithmetic circuits of constant depth. Information and Computation. 222. 195–207. 3 indexed citations

15.

Santhanam, Rahul. (2012). Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds. Bulletin of the European Association for Theoretical Computer Science. 106(106). 31–52. 8 indexed citations

16.

Pitassi, Toniann & Rahul Santhanam. (2010). Effectively Polynomial Simulations. 370–382. 9 indexed citations

17.

Fortnow, Lance & Rahul Santhanam. (2007). Time Hierarchies: A Survey. Electronic colloquium on computational complexity. 14(4). 1 indexed citations

18.

Fortnow, Lance & Rahul Santhanam. (2007). Infeasibility of Instance Compression and Succinct PCPs for NP. Electronic colloquium on computational complexity. 14(96). 2 indexed citations

19.

Kabanets, Valentine, et al.. (2006). Uniform Hardness Amplification in NP via Monotone Codes. Electronic colloquium on computational complexity. 13(154). 10 indexed citations

20.

Santhanam, Rahul & Kamala Krithivasan. (2006). Graph splicing systems. Discrete Applied Mathematics. 154(8). 1264–1278. 2 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