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 | 125 | 2008 |

Simpler algorithm for estimating frequency moments of data streams L Bhuvanagiri, S Ganguly, D Kesh, C Saha Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 117 | 2006 |

An exponential lower bound for homogeneous depth four arithmetic formulas N Kayal, N Limaye, C Saha, S Srinivasan SIAM Journal on Computing 46 (1), 307-335, 2017 | 91 | 2017 |

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 | 90 | 2014 |

Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits M Agrawal, C Saha, R Saptharishi, N Saxena Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 87 | 2012 |

Quasi-polynomial hitting-set for set-depth-Δ formulas M Agrawal, C Saha, N Saxena Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 61 | 2013 |

Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits N Kayal, V Nair, C Saha 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016 | 38* | 2016 |

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

An almost cubic lower bound for depth three arithmetic circuits N Kayal, C Saha, S Tavenas 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 37 | 2016 |

Lower bounds for depth-three arithmetic circuits with small bottom fanin N Kayal, C Saha computational complexity 25 (2), 419-454, 2016 | 33 | 2016 |

On the size of homogeneous and of depth four formulas with low individual degree N Kayal, C Saha, S Tavenas Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 28 | 2016 |

Learning sums of powers of low-degree polynomials in the non-degenerate case A Garg, N Kayal, C Saha 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 27 | 2020 |

Reconstruction of full rank algebraic branching programs N Kayal, V Nair, C Saha, S Tavenas ACM Transactions on Computation Theory (TOCT) 11 (1), 1-56, 2018 | 27 | 2018 |

On the sum of square roots of polynomials and related problems N Kayal, C Saha ACM Transactions on Computation Theory (TOCT) 4 (4), 1-15, 2012 | 27 | 2012 |

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas N Kayal, N Limaye, C Saha, S Srinivasan Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 25 | 2014 |

Reconstruction of non-degenerate homogeneous depth three circuits N Kayal, C Saha Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 23 | 2019 |

Practical algorithms for tracking database join sizes S Ganguly, D Kesh, C Saha FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005 | 23 | 2005 |

Lower bounds for sums of powers of low degree univariates N Kayal, P Koiran, T Pecatte, C Saha Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 22 | 2015 |

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

Average-case linear matrix factorization and reconstruction of low width algebraic branching programs N Kayal, V Nair, C Saha computational complexity 28, 749-828, 2019 | 17 | 2019 |