default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScott McCallum
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Michael S. Harré
, Adam Harris, Scott McCallum:
Mathematica code for the topological analysis of Thom's Catastrophes in 2 × 2 economic games. Softw. Impacts 20: 100652 (2024)- 2023
- [i3]James H. Davenport, Matthew England, Scott McCallum, Ali Kemal Uncu:
Iterated Resultants and Rational Functions in Real Quantifier Elimination. CoRR abs/2312.16210 (2023) - 2020
- [c17]Christopher W. Brown, Scott McCallum:
Enhancements to Lazard's Method for Cylindrical Algebraic Decomposition. CASC 2020: 129-149 - [c16]Scott McCallum, Akshar Nair, James H. Davenport, Gregory Sankaran:
The CAD Conundrum: Lex-Least vs Order. SYNASC 2020: 32-35
2010 – 2019
- 2019
- [j20]Akshar Nair, James H. Davenport, Gregory Sankaran, Scott McCallum:
Lazard's CAD exploiting equality constraints. ACM Commun. Comput. Algebra 53(3): 138-141 (2019) - [j19]Scott McCallum, Adam Parusinski, Laurentiu Paunescu:
Validity proof of Lazard's method for CAD construction. J. Symb. Comput. 92: 52-69 (2019) - 2017
- [c15]Charles Z. Liu, Manolya Kavakli, Scott McCallum, Len Hamey:
Motion-keying Based Dynamical Scene Layering with Adaptive Learning. ICCAE 2017: 111-115 - 2016
- [j18]Scott McCallum, Hoon Hong:
On using Lazard's projection in CAD construction. J. Symb. Comput. 72: 65-81 (2016) - [j17]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Truth table invariant cylindrical algebraic decomposition. J. Symb. Comput. 76: 1-35 (2016) - [j16]Yoav D. Shaul, Bingbing Yuan, Prathapan Thiru, Andy Nutter-Upham, Scott McCallum, Carolyn Lanzkron, George W. Bell, David M. Sabatini:
MERAV: a tool for comparing gene expression across human tissues and cell types. Nucleic Acids Res. 44(Database-Issue): 560-566 (2016) - 2014
- [i2]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Truth Table Invariant Cylindrical Algebraic Decomposition. CoRR abs/1401.0645 (2014) - 2013
- [c14]Tara S. Behrend, Alexander E. Gloss, Garett Howardson, Lori Foster Thompson, Scott McCallum:
Psychological dynamics in ICTD projects. ICTD (2) 2013: 9-12 - [c13]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Cylindrical algebraic decompositions for boolean combinations. ISSAC 2013: 125-132 - [i1]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Cylindrical Algebraic Decompositions for Boolean Combinations. CoRR abs/1304.7603 (2013) - 2012
- [j15]Scott McCallum, Volker Weispfenning:
Deciding polynomial-transcendental problems. J. Symb. Comput. 47(1): 16-31 (2012) - [j14]Nurcan Tuncbag, Scott McCallum, Shao-Shan Carol Huang, Ernest Fraenkel:
SteinerNet: a web server for integrating 'omic' data to discover hidden components of response pathways. Nucleic Acids Res. 40(Web-Server-Issue): 505-509 (2012)
2000 – 2009
- 2009
- [j13]Daniel Lazard, Scott McCallum:
Iterated discriminants. J. Symb. Comput. 44(9): 1176-1193 (2009) - [c12]Scott McCallum, Christopher W. Brown:
On delineability of varieties in CAD-based quantifier elimination with two equational constraints. ISSAC 2009: 71-78 - 2008
- [c11]Melanie Achatz, Scott McCallum, Volker Weispfenning:
Deciding polynomial-exponential problems. ISSAC 2008: 215-222 - 2007
- [c10]Elena Kartashova, Scott McCallum:
Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators. Calculemus/MKM 2007: 106-115 - 2005
- [j12]D. Benjamin Gordon, Lena Nekludova, Scott McCallum, Ernest Fraenkel:
TAMO: a flexible, object-oriented framework for analyzing transcriptional regulation using DNA-sequence motifs. Bioinform. 21(14): 3164-3165 (2005) - [c9]Christopher W. Brown, Scott McCallum:
On using bi-equational constraints in CAD construction. ISSAC 2005: 76-83 - 2003
- [c8]Scott McCallum:
On order-invariance of a binomial over a nullifying cell. ISSAC 2003: 184-190 - 2002
- [j11]Scott McCallum, George E. Collins:
Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions. J. Symb. Comput. 33(3): 321-342 (2002) - 2001
- [c7]Scott McCallum:
On propagation of equational constraints in CAD-based quantifier elimination. ISSAC 2001: 223-231
1990 – 1999
- 1999
- [j10]Scott McCallum:
Factors of Iterated Resultants and Discriminants. J. Symb. Comput. 27(4): 367-385 (1999) - [c6]Scott McCallum:
On Projection in CAD-Based Quantifier Elimination with Equational Constraint. ISSAC 1999: 145-149 - 1997
- [j9]Scott McCallum:
Factors of iterated resultants and discriminants. SIGSAM Bull. 31(3): 33-34 (1997) - [j8]Scott McCallum:
On Testing a Bivariate Polynomial for Analytic Reducibility. J. Symb. Comput. 24(5): 509-535 (1997) - 1993
- [j7]Scott McCallum:
Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition. Comput. J. 36(5): 432-438 (1993)
1980 – 1989
- 1989
- [j6]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
- [j5]Scott McCallum:
An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space. J. Symb. Comput. 5(1/2): 141-161 (1988) - [j4]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) - [j3]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
- [c5]Lars Langemyr, Scott McCallum:
The computation of polynomial greatest common divisors over an algebraic number field. EUROCAL 1987: 298-299 - 1985
- [c4]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 - [c3]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 - [c2]Scott McCallum:
An Improved Projection Operation for Cylindrical Algebraic Decomposition. European Conference on Computer Algebra (2) 1985: 277-278 - 1984
- [j2]Dennis S. Arnon, George E. Collins, Scott McCallum:
Cylindrical Algebraic Decomposition I: The Basic Algorithm. SIAM J. Comput. 13(4): 865-877 (1984) - [j1]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
- [c1]Dennis S. Arnon, Scott McCallum:
Cylindrical Algebraic Decomposition by Quantifier Elimination. EUROCAM 1982: 215-222
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
