 | 2009 |
|---|
| 23 |       | Daniel Lazard,
Scott McCallum:
Iterated discriminants.
J. Symb. Comput. 44(9): 1176-1193 (2009) |
| 2008 |
|---|
| 22 | | Melanie Achatz,
Scott McCallum,
Volker Weispfenning:
Deciding polynomial-exponential problems.
ISSAC 2008: 215-222 |
| 2007 |
|---|
| 21 | | Elena Kartashova,
Scott McCallum:
Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators.
Calculemus/MKM 2007: 106-115 |
| 2005 |
|---|
| 20 | | Christopher W. Brown,
Scott McCallum:
On using bi-equational constraints in CAD construction.
ISSAC 2005: 76-83 |
| 19 | | D. Benjamin Gordon,
Lena Nekludova,
Scott McCallum,
Ernest Fraenkel:
TAMO: a flexible, object-oriented framework for analyzing transcriptional regulation using DNA-sequence motifs.
Bioinformatics 21(14): 3164-3165 (2005) |
| 2003 |
|---|
| 18 | | Scott McCallum:
On order-invariance of a binomial over a nullifying cell.
ISSAC 2003: 184-190 |
| 2002 |
|---|
| 17 | | Scott McCallum,
George E. Collins:
Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions.
J. Symb. Comput. 33(3): 321-342 (2002) |
| 2001 |
|---|
| 16 | | Scott McCallum:
On propagation of equational constraints in CAD-based quantifier elimination.
ISSAC 2001: 223-231 |
| 1999 |
|---|
| 15 | | Scott McCallum:
On Projection in CAD-Based Quantifier Elimination with Equational Constraint.
ISSAC 1999: 145-149 |
| 14 |  | Scott McCallum:
Factors of Iterated Resultants and Discriminants.
J. Symb. Comput. 27(4): 367-385 (1999) |
| 1997 |
|---|
| 13 | | Scott McCallum:
On Testing a Bivariate Polynomial for Analytic Reducibility.
J. Symb. Comput. 24(5): 509-535 (1997) |
| 1993 |
|---|
| 12 | | Scott McCallum:
Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition.
Comput. J. 36(5): 432-438 (1993) |
| 1989 |
|---|
| 11 | | Lars Langemyr,
Scott McCallum:
The Computation of Polynomial Greatest Common Divisors Over an Algebraic Number Field.
J. Symb. Comput. 8(5): 429-448 (1989) |
| 1988 |
|---|
| 10 | | Scott McCallum:
An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space.
J. Symb. Comput. 5(1/2): 141-161 (1988) |
| 9 | | Dennis S. Arnon,
George E. Collins,
Scott McCallum:
An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space.
J. Symb. Comput. 5(1/2): 163-187 (1988) |
| 8 | | Dennis S. Arnon,
Scott McCallum:
A Polynomial-Time Algorithm for the Topological Type of a Real Algebraic Curve.
J. Symb. Comput. 5(1/2): 213-236 (1988) |
| 1987 |
|---|
| 7 | | Lars Langemyr,
Scott McCallum:
The computation of polynomial greatest common divisors over an algebraic number field.
EUROCAL 1987: 298-299 |
| 1985 |
|---|
| 6 | | Dennis S. Arnon,
George E. Collins,
Scott McCallum:
An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space.
European Conference on Computer Algebra (2) 1985: 246-261 |
| 5 | | Dennis S. Arnon,
Scott McCallum:
A Polynominal Time Algorithm for the Topological Type of a Real Algebraic Curve.
European Conference on Computer Algebra (2) 1985: 275-276 |
| 4 | | Scott McCallum:
An Improved Projection Operation for Cylindrical Algebraic Decomposition.
European Conference on Computer Algebra (2) 1985: 277-278 |
| 1984 |
|---|
| 3 | | Dennis S. Arnon,
George E. Collins,
Scott McCallum:
Cylindrical Algebraic Decomposition I: The Basic Algorithm.
SIAM J. Comput. 13(4): 865-877 (1984) |
| 2 | | Dennis S. Arnon,
George E. Collins,
Scott McCallum:
Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane.
SIAM J. Comput. 13(4): 878-889 (1984) |
| 1982 |
|---|
| 1 | | Dennis S. Arnon,
Scott McCallum:
Cylindrical Algebraic Decomposition by Quantifier Elimination.
EUROCAM 1982: 215-222 |
