Cylindrical algebraic decomposition I: The basic algorithm DS Arnon, GE Collins, S McCallum SIAM Journal on Computing 13 (4), 865-877, 1984 | 511 | 1984 |

Cylindrical algebraic decomposition II: An adjacency algorithm for the plane DS Arnon, GE Collins, S McCallum SIAM Journal on Computing 13 (4), 878-889, 1984 | 156 | 1984 |

An improved projection operation for cylindrical algebraic decomposition S McCallum Quantifier Elimination and Cylindrical Algebraic Decomposition, 242-268, 1998 | 150 | 1998 |

An improved projection operation for cylindrical algebraic decomposition of three-dimensional space S McCallum Journal of Symbolic Computation 5 (1-2), 141-161, 1988 | 140 | 1988 |

On projection in CAD-based quantifier elimination with equational constraint S McCallum Proceedings of the 1999 international symposium on Symbolic and algebraic …, 1999 | 107 | 1999 |

An improved projection operation for cylindrical algebraic decomposition S McCallum EUROCAL'85: European Conference on Computer Algebra Linz, Austria, April 1–3 …, 1985 | 104 | 1985 |

A polynomial-time algorithm for the topological type of a real algebraic curve DS Arnon, S McCallum Journal of Symbolic Computation 5 (1-2), 213-236, 1988 | 100 | 1988 |

Solving polynomial strict inequalities using cylindrical algebraic decomposition S McCallum The Computer Journal 36 (5), 432-438, 1993 | 85 | 1993 |

On propagation of equational constraints in CAD-based quantifier elimination S McCallum Proceedings of the 2001 international symposium on Symbolic and algebraic …, 2001 | 70 | 2001 |

Truth table invariant cylindrical algebraic decomposition R Bradford, JH Davenport, M England, S McCallum, D Wilson Journal of Symbolic Computation 76, 1-35, 2016 | 65 | 2016 |

The computation of polynomial greatest common divisors over an algebraic number field L Langemyr, S McCallum Journal of symbolic computation 8 (5), 429-448, 1989 | 57 | 1989 |

An adjacency algorithm for cylindrical algebraic decompositions of three-dimenslonal space DS Arnon, GE Collins, S McCallum Journal of Symbolic Computation 5 (1-2), 163-187, 1988 | 45 | 1988 |

Cylindrical algebraic decompositions for boolean combinations R Bradford, JH Davenport, M England, S McCallum, D Wilson Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013 | 42 | 2013 |

Deciding polynomial-exponential problems M Achatz, S McCallum, V Weispfenning Proceedings of the twenty-first international symposium on Symbolic and …, 2008 | 39 | 2008 |

Validity proof of Lazard's method for CAD construction S McCallum, A Parusiński, L Paunescu Journal of Symbolic Computation 92, 52-69, 2019 | 37 | 2019 |

Deciding polynomial-transcendental problems S McCallum, V Weispfenning Journal of Symbolic Computation 47 (1), 16-31, 2012 | 37 | 2012 |

On using bi-equational constraints in CAD construction CW Brown, S McCallum Proceedings of the 2005 international symposium on Symbolic and algebraic …, 2005 | 36 | 2005 |

Iterated discriminants D Lazard, S McCallum Journal of Symbolic Computation 44 (9), 1176-1193, 2009 | 26 | 2009 |

Factors of iterated resultants and discriminants S McCallum Journal of Symbolic Computation 27 (4), 367-385, 1999 | 23 | 1999 |

Local box adjacency algorithms for cylindrical algebraic decompositions SM c Callum, GE Collins Journal of Symbolic Computation 33 (3), 321-342, 2002 | 20 | 2002 |