Infeasibility of instance compression and succinct PCPs for NP L Fortnow, R Santhanam Journal of Computer and System Sciences 77 (1), 91-106, 2011 | 344 | 2011 |

Infeasibility of instance compression and succinct PCPs for NP L Fortnow, R Santhanam Journal of Computer and System Sciences 77 (1), 91-106, 2011 | 344 | 2011 |

Fighting perebor: New and improved algorithms for formula and QBF satisfiability R Santhanam 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 183-192, 2010 | 87 | 2010 |

Circuit lower bounds for Merlin–Arthur classes R Santhanam SIAM Journal on Computing 39 (3), 1038-1061, 2009 | 74 | 2009 |

Hierarchy theorems for probabilistic polynomial time L Fortnow, R Santhanam 45th Annual IEEE Symposium on Foundations of Computer Science, 316-324, 2004 | 66 | 2004 |

Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness IC Oliveira, R Santhanam arXiv preprint arXiv:1611.01190, 2016 | 52 | 2016 |

Graph model selection using maximum likelihood I Bezáková, A Kalai, R Santhanam Proceedings of the 23rd international conference on Machine learning, 105-112, 2006 | 45 | 2006 |

Graph model selection using maximum likelihood I Bezáková, A Kalai, R Santhanam Proceedings of the 23rd international conference on Machine learning, 105-112, 2006 | 45 | 2006 |

On the average-case complexity of MCSP and its variants S Hirahara, R Santhanam 32nd Computational Complexity Conference (CCC 2017), 2017 | 38 | 2017 |

Average-case lower bounds and satisfiability algorithms for small threshold circuits R Chen, R Santhanam, S Srinivasan arXiv preprint arXiv:1806.06290, 2018 | 35 | 2018 |

Hardness magnification for natural problems IC Oliveira, R Santhanam 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 65-76, 2018 | 34 | 2018 |

Improved algorithms for sparse MAX-SAT and MAX-k-CSP R Chen, R Santhanam International Conference on Theory and Applications of Satisfiability …, 2015 | 33 | 2015 |

Hierarchies for semantic classes L Fortnow, R Santhanam, L Trevisan Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of …, 2005 | 33 | 2005 |

Robust simulations and significant separations L Fortnow, R Santhanam International Colloquium on Automata, Languages, and Programming, 569-580, 2011 | 32* | 2011 |

Hardness magnification near state-of-the-art lower bounds IC Oliveira, J Pich, R Santhanam Theory of Computing 17 (1), 1-38, 2021 | 29 | 2021 |

Effectively Polynomial Simulations. T Pitassi, R Santhanam ICS, 370-382, 2010 | 27 | 2010 |

Fixed-polynomial size circuit bounds L Fortnow, R Santhanam, R Williams 2009 24th Annual IEEE Conference on Computational Complexity, 19-26, 2009 | 25 | 2009 |

Pseudodeterministic constructions in subexponential time IC Oliveira, R Santhanam Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 24 | 2017 |

NP-hardness of minimum circuit size problem for OR-AND-MOD circuits S Hirahara, IC Oliveira, R Santhanam 33rd Computational Complexity Conference (CCC 2018), 2018 | 22 | 2018 |

Pebbles and branching programs for tree evaluation S Cook, P McKenzie, D Wehr, M Braverman, R Santhanam ACM Transactions on Computation Theory (TOCT) 3 (2), 1-43, 2012 | 22 | 2012 |