Extensions to the method of multiplicities, with applications to Kakeya sets and mergers Z Dvir, S Kopparty, S Saraf, M Sudan SIAM Journal on Computing 42 (6), 2305-2328, 2013 | 158 | 2013 |

High-rate codes with sublinear-time decoding S Kopparty, S Saraf, S Yekhanin Journal of the ACM (JACM) 61 (5), 1-20, 2014 | 118 | 2014 |

Blackbox polynomial identity testing for depth 3 circuits N Kayal, S Saraf 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 198-207, 2009 | 87 | 2009 |

On the power of homogeneous depth 4 arithmetic circuits M Kumar, S Saraf SIAM Journal on Computing 46 (1), 336-387, 2017 | 72 | 2017 |

An improved lower bound on the size of Kakeya sets over finite fields S Saraf, M Sudan Analysis & PDE 1 (3), 375-379, 2008 | 54 | 2008 |

High-rate locally correctable and locally testable codes with sub-polynomial query complexity S Kopparty, O Meir, N Ron-Zewi, S Saraf Journal of the ACM (JACM) 64 (2), 1-42, 2017 | 52 | 2017 |

Black-box identity testing of depth-4 multilinear circuits S Saraf, I Volkovich Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 49 | 2011 |

The limits of depth reduction for arithmetic formulas: It's all about the top fan-in M Kumar, S Saraf SIAM Journal on Computing 44 (6), 1601-1625, 2015 | 39 | 2015 |

Local list-decoding and testing of random linear codes from high error S Kopparty, S Saraf SIAM Journal on Computing 42 (3), 1302-1326, 2013 | 39 | 2013 |

Maximally recoverable codes for grid-like topologies P Gopalan, G Hu, S Kopparty, S Saraf, C Wang, S Yekhanin Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 37 | 2017 |

Improved rank bounds for design matrices and a new proof of Kelly’s theorem Z Dvir, S Saraf, A Wigderson Forum of Mathematics, Sigma 2, 2014 | 33 | 2014 |

Acute and nonobtuse triangulations of polyhedral surfaces S Saraf European Journal of Combinatorics 30 (4), 833-840, 2009 | 30 | 2009 |

Tolerant linearity testing and locally testable codes S Kopparty, S Saraf Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 28 | 2009 |

Arithmetic circuits with locally low algebraic rank M Kumar, S Saraf arXiv preprint arXiv:1806.06097, 2018 | 25 | 2018 |

Equivalence of polynomial identity testing and deterministic multivariate polynomial factorization S Kopparty, S Saraf, A Shpilka 2014 IEEE 29th Conference on Computational Complexity (CCC), 169-180, 2014 | 24 | 2014 |

Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits M Kumar, S Saraf International Colloquium on Automata, Languages, and Programming, 751-762, 2014 | 22 | 2014 |

Towards an algebraic natural proofs barrier via polynomial identity testing JA Grochow, M Kumar, M Saks, S Saraf arXiv preprint arXiv:1701.01717, 2017 | 21 | 2017 |

Sums of products of polynomials in few variables: lower bounds and polynomial identity testing M Kumar, S Saraf arXiv preprint arXiv:1504.06213, 2015 | 20 | 2015 |

Breaking the quadratic barrier for 3-LCC's over the reals Z Dvir, S Saraf, A Wigderson Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 20 | 2014 |

Tight lower bounds for 2-query LCCs over finite fields A Bhattacharyya, Z Dvir, A Shpilka, S Saraf 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 638-647, 2011 | 20 | 2011 |