Approaching the chasm at depth four A Gupta, P Kamath, N Kayal, R Saptharishi Journal of the ACM (JACM) 61 (6), 1-16, 2014 | 131 | 2014 |

Arithmetic circuits: A chasm at depth three A Gupta, P Kamath, N Kayal, R Saptharishi 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 578-587, 2013 | 121 | 2013 |

Fast integer multiplication using modular arithmetic A De, PP Kurur, C Saha, R Saptharishi Proceedings of the fortieth annual ACM symposium on Theory of computing, 499-506, 2008 | 119 | 2008 |

A survey of lower bounds in arithmetic circuit complexity R Saptharishi Github survey 95, 2015 | 110 | 2015 |

A super-polynomial lower bound for regular arithmetic formulas N Kayal, C Saha, R Saptharishi Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 87 | 2014 |

Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth- Occur- Formulas and Depth-3 Transcendence Degree- Circuits M Agrawal, C Saha, R Saptharishi, N Saxena SIAM Journal on Computing 45 (4), 1533-1562, 2016 | 84 | 2016 |

Hitting sets for multilinear read-once algebraic branching programs, in any order MA Forbes, R Saptharishi, A Shpilka Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 73 | 2014 |

Arithmetic circuits: A chasm at depth 3 A Gupta, P Kamath, N Kayal, R Saptharishi SIAM Journal on Computing 45 (3), 1064-1079, 2016 | 60 | 2016 |

City-scale agent-based simulators for the study of non-pharmaceutical interventions in the context of the COVID-19 epidemic: IISc-TIFR COVID-19 city-scale simulation team S Agrawal, S Bhandari, A Bhattacharjee, A Deo, NM Dixit, P Harsha, ... Journal of the Indian Institute of Science 100, 809-847, 2020 | 38 | 2020 |

A case of depth-3 identity testing, sparse factorization and duality C Saha, R Saptharishi, N Saxena Computational Complexity 22, 39-69, 2013 | 37 | 2013 |

Identity Testing and Lower Bounds for Read-*k* Oblivious Algebraic Branching ProgramsM Anderson, MA Forbes, R Saptharishi, A Shpilka, BL Volk ACM Transactions on Computation Theory (TOCT) 10 (1), 1-30, 2018 | 32 | 2018 |

Efficiently decoding Reed-Muller codes from random errors R Saptharishi, A Shpilka, BL Volk Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 32 | 2016 |

Derandomization from algebraic hardness: Treading the borders Z Guo, M Kumar, R Saptharishi, N Solomon 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 30* | 2019 |

Classifying polynomials and identity testing M Agrawal, R SaptharishiI Indian Academy of Sciences, 2009 | 26 | 2009 |

Near-optimal bootstrapping of hitting sets for algebraic circuits M Kumar, R Saptharishi, A Tengse Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 24 | 2019 |

An exponential lower bound for homogeneous depth-5 circuits over finite fields M Kumar, R Saptharishi arXiv preprint arXiv:1507.00177, 2015 | 24 | 2015 |

The power of depth 2 circuits over algebras C Saha, R Saptharishi, N Saxena arXiv preprint arXiv:0904.2058, 2009 | 22 | 2009 |

A selection of lower bounds for arithmetic circuits N Kayal, R Saptharishi Perspectives in Computational Complexity: The Somenath Biswas Anniversary …, 2014 | 20 | 2014 |

Hardness-randomness tradeoffs for algebraic computation M Kumar, R Saptharishi Bulletin of EATCS 3 (129), 2019 | 17 | 2019 |

The chasm at depth four, and tensor rank: Old results, new insights S Chillara, M Kumar, R Saptharishi, V Vinay arXiv preprint arXiv:1606.04200, 2016 | 16 | 2016 |