Arjeh M. Cohen Henri Cohen David Eisenbud Michael F. Singer B Sturmfels | 1925 | 2006 |

On the combinatorial and algebraic complexity of quantifier elimination S Basu, R Pollack, MF Roy Journal of the ACM (JACM) 43 (6), 1002-1045, 1996 | 378 | 1996 |

Computing roadmaps of semi-algebraic sets on a variety S Basu, R Pollack, MF Roy Journal of the American Mathematical Society 13 (1), 55-82, 2000 | 124 | 2000 |

New results on quantifier elimination over real closed fields and applications to constraint databases S Basu Journal of the ACM (JACM) 46 (4), 537-555, 1999 | 106 | 1999 |

On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets S Basu Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 103 | 1996 |

On the combinatorial and algebraic complexity of quantifier elimination S Basu, R Pollack, MF Roy Proceedings 35th Annual Symposium on Foundations of Computer Science, 632-641, 1994 | 100 | 1994 |

A new algorithm to find a point in every cell defined by a family of polynomials S Basu, R Pollack, MF Roy Quantifier elimination and cylindrical algebraic decomposition, 341-350, 1998 | 94 | 1998 |

Design of CAECC-cellular automata based error correcting code DR Chowdhury, S Basu, IS Gupta, PP Chaudhuri IEEE Transactions on Computers 43 (6), 759-764, 1994 | 91 | 1994 |

On the number of cells defined by a family of polynomials on a variety S Basu, R Pollak, MF Roy Mathematika 43 (1), 120-126, 1996 | 66 | 1996 |

Refined bounds on the number of connected components of sign conditions on a variety S Barone, S Basu Discrete & Computational Geometry 47 (3), 577-597, 2012 | 50 | 2012 |

On computing a set of points meeting every cell defined by a family of polynomials on a variety S Basu, R Pollack, MF Roy Journal of Complexity 13 (1), 28-37, 1997 | 43 | 1997 |

M.-F. Roy Algorithms in real algebraic geometry S Basu, R Pollack Algorithms and Computation in Mathematics 10, 2006 | 41 | 2006 |

Different bounds on the different Betti numbers of semi-algebraic sets S Basu Discrete and Computational Geometry 30 (1), 65-85, 2003 | 40 | 2003 |

Computing the first few Betti numbers of semi-algebraic sets in single exponential time S Basu Journal of Symbolic Computation 41 (10), 1125-1154, 2006 | 37 | 2006 |

On the Betti numbers of sign conditions S Basu, R Pollack, MF Roy Proceedings of the American Mathematical Society 133 (4), 965-974, 2005 | 36 | 2005 |

The combinatorial and topological complexity of a single cell S Basu Discrete & Computational Geometry 29 (1), 41-59, 2002 | 35* | 2002 |

Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions S Basu, M Sombra Discrete & Computational Geometry 55 (1), 158-184, 2016 | 34 | 2016 |

A baby step–giant step roadmap algorithm for general algebraic sets S Basu, MF Roy, MS El Din, É Schost Foundations of Computational Mathematics 14 (6), 1117-1172, 2014 | 34 | 2014 |

Computing roadmaps of semi-algebraic sets S Basu, R Pollack, MF Roy Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 31 | 1996 |

Nephron‐sparing surgery across a nation–outcomes from the British Association of Urological Surgeons 2012 national partial nephrectomy audit A Fernando, S Fowler, T O'Brien, ... BJU international 117 (6), 874-882, 2016 | 27 | 2016 |