The SCEAS System
| |||||||

## Search the dblp DataBase
Scott McCallum:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Dennis S. Arnon, George E. Collins, Scott McCallum
**Cylindrical Algebraic Decomposition I: The Basic Algorithm.**[Citation Graph (1, 0)][DBLP] SIAM J. Comput., 1984, v:13, n:4, pp:865-877 [Journal] - Dennis S. Arnon, George E. Collins, Scott McCallum
**An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space.**[Citation Graph (0, 0)][DBLP] European Conference on Computer Algebra (2), 1985, pp:246-261 [Conf] - Dennis S. Arnon, Scott McCallum
**Cylindrical Algebraic Decomposition by Quantifier Elimination.**[Citation Graph (0, 0)][DBLP] EUROCAM, 1982, pp:215-222 [Conf] - Dennis S. Arnon, Scott McCallum
**A Polynominal Time Algorithm for the Topological Type of a Real Algebraic Curve.**[Citation Graph (0, 0)][DBLP] European Conference on Computer Algebra (2), 1985, pp:275-276 [Conf] - Lars Langemyr, Scott McCallum
**The computation of polynomial greatest common divisors over an algebraic number field.**[Citation Graph (0, 0)][DBLP] EUROCAL, 1987, pp:298-299 [Conf] - Scott McCallum
**An Improved Projection Operation for Cylindrical Algebraic Decomposition.**[Citation Graph (0, 0)][DBLP] European Conference on Computer Algebra (2), 1985, pp:277-278 [Conf] - Christopher W. Brown, Scott McCallum
**On using bi-equational constraints in CAD construction.**[Citation Graph (0, 0)][DBLP] ISSAC, 2005, pp:76-83 [Conf] - Scott McCallum
**On propagation of equational constraints in CAD-based quantifier elimination.**[Citation Graph (0, 0)][DBLP] ISSAC, 2001, pp:223-231 [Conf] - Scott McCallum
**On order-invariance of a binomial over a nullifying cell.**[Citation Graph (0, 0)][DBLP] ISSAC, 2003, pp:184-190 [Conf] - Scott McCallum
**On Projection in CAD-Based Quantifier Elimination with Equational Constraint.**[Citation Graph (0, 0)][DBLP] ISSAC, 1999, pp:145-149 [Conf] - D. Benjamin Gordon, Lena Nekludova, Scott McCallum, Ernest Fraenkel
**TAMO: a flexible, object-oriented framework for analyzing transcriptional regulation using DNA-sequence motifs.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2005, v:21, n:14, pp:3164-3165 [Journal] - Scott McCallum
**Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition.**[Citation Graph (0, 0)][DBLP] Comput. J., 1993, v:36, n:5, pp:432-438 [Journal] - Dennis S. Arnon, George E. Collins, Scott McCallum
**An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1988, v:5, n:1/2, pp:163-187 [Journal] - Dennis S. Arnon, Scott McCallum
**A Polynomial-Time Algorithm for the Topological Type of a Real Algebraic Curve.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1988, v:5, n:1/2, pp:213-236 [Journal] - Lars Langemyr, Scott McCallum
**The Computation of Polynomial Greatest Common Divisors Over an Algebraic Number Field.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:8, n:5, pp:429-448 [Journal] - Scott McCallum
**An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1988, v:5, n:1/2, pp:141-161 [Journal] - Scott McCallum
**On Testing a Bivariate Polynomial for Analytic Reducibility.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1997, v:24, n:5, pp:509-535 [Journal] - Scott McCallum
**Factors of Iterated Resultants and Discriminants.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1999, v:27, n:4, pp:367-385 [Journal] - Scott McCallum, George E. Collins
**Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2002, v:33, n:3, pp:321-342 [Journal] - Dennis S. Arnon, George E. Collins, Scott McCallum
**Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1984, v:13, n:4, pp:878-889 [Journal] - Elena Kartashova, Scott McCallum
**Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators.**[Citation Graph (0, 0)][DBLP] Calculemus/MKM, 2007, pp:106-115 [Conf] **Deciding polynomial-exponential problems.**[Citation Graph (, )][DBLP]**On delineability of varieties in CAD-based quantifier elimination with two equational constraints.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |