Distributivity and An Axiom of Choice. - George E. Collins (J. Symb. Log., 1954)

The Tarski decision procedure. - George E. Collins (ACM National Meeting, 1956)

A method for overlapping and erasure of lists. - George E. Collins (Commun. ACM, 1960)

A method for comparing the internal operating speeds of computers. - Gene Raichelson; George E. Collins (Commun. ACM, 1964)

PM, a system for polynomial manipulation. - George E. Collins (Commun. ACM, 1966)

Subresultants and Reduced Polynomial Remainder Sequences. - George E. Collins (J. ACM, 1967)

Letters to the editor: comment on a paper by Ku and Adler. - George E. Collins (Commun. ACM, 1969)

On the interpretability of arithmetic in set theory. - George E. Collins; J. D. Halpern (Notre Dame J. Formal Log., 1970)

The SAC-1 system: An introduction and survey. - George E. Collins (SYMSAC, 1971)

The calculation of multivariate polynomial resultants. - George E. Collins (SYMSAC, 1971)

Symbolic mathematical computation in a Ph.D. computer science program. - Bob F. Caviness; George E. Collins (SIGCSE, 1972)

Quantifier elimination for real closed fields by cylindrical algebraic decomposition-preliminary report. - George E. Collins (SIGSAM Bull., 1974)

SAC-1 solution of problem #7. - George E. Collins; David R. Musser; Michael Rothstein (SIGSAM Bull., 1974)

The Computing Time of the Euclidean Algorithm. - George E. Collins (SIAM J. Comput., 1974)

SIGSAM 2-Symbolic mathematical systems (Part II) and methods for symbolic and algebraic computation (Tutorial and papers). - George E. Collins (ACM Annual Conference, 1975)

Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. - George E. Collins (Automata Theory and Formal Languages, 1975)

SIGSAM (Paper Session). - Joel Moses; Martin L. Griss; George Collins 001 (ACM Annual Conference, 1976)

Algorithms for Gaussian integer arithmetic. - Bob F. Caviness; George E. Collins (SYMSACC, 1976)

Polynomial real root isolation using Descarte's rule of signs. - George E. Collins; Alkiviadis G. Akritas (SYMSACC, 1976)

Polynomial real root isolation by differentiation. - George E. Collins; Rüdiger Loos (SYMSACC, 1976)

Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis. - George E. Collins (SIGSAM Bull., 1976)

Analysis of the Pope-Stein Division Algorithm. - George E. Collins; David R. Musser (Inf. Process. Lett., 1977)

Factoring univariate integral polynomial in polynomial average time. - George E. Collins (EUROSAM, 1979)

Factorization in Cylindrical Algebraic Decomposition. - George E. Collins (EUROCAM, 1982)

Computer algebra symbolic and algebraic computation. - Bruno Buchberger; George E. Collins; Rüdiger Loos; R. Albrecht (SIGSAM Bull., 1982)

The Jacobi symbol algorithm. - George E. Collins; Rüdiger G. K. Loos (SIGSAM Bull., 1982)

Algorithms for the Solution of Systems of Linear Diophantine Equations. - Tsu-Wu J. Chou; George E. Collins (SIAM J. Comput., 1982)

Cylindrical Algebraic Decomposition I: The Basic Algorithm. - Dennis S. Arnon; George E. Collins; Scott McCallum (SIAM J. Comput., 1984)

Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane. - Dennis S. Arnon; George E. Collins; Scott McCallum (SIAM J. Comput., 1984)

The Euclidean Algorithm for Gaussian Integers (Abstract). - George E. Collins (Accurate Scientific Computations, 1985)

An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space. - Dennis S. Arnon; George E. Collins; Scott McCallum (European Conference on Computer Algebra (2), 1985)

The SAC-2 Computer Algebra System. - George E. Collins (European Conference on Computer Algebra (2), 1985)

The Probability of Relative Primality of Gaussian Integers. - George E. Collins; Jeremy R. Johnson (ISSAC, 1988)

Quantifier Elimination and the Sign Variation Method for Real Root Isolation. - George E. Collins; Jeremy R. Johnson (ISSAC, 1989)

Parallel Real Root Isolation Using the Coefficient Sign Variation Method. - George E. Collins; Jeremy R. Johnson; Wolfgang Küchlin (CAP, 1990)

Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. - George E. Collins; Hoon Hong (J. Symb. Comput., 1991)

An Efficient Algorithm for Infallible Polynomial Complex Root Isolation. - George E. Collins; Werner Krandick (ISSAC, 1992)

A Hybrid Method for High Precision Calculation of Polynomial Real Roots. - George E. Collins; Werner Krandick (ISSAC, 1993)

Efficient Rational Number Reconstruction. - George E. Collins; Mark J. Encarnación (J. Symb. Comput., 1995)

A Tangent-Secant Method for Polynomial Complex Root Calculation. - George E. Collins; Werner Krandick (ISSAC, 1996)

Improved Techniques for Factoring Univariate Polynomials. - George E. Collins; Mark J. Encarnación (J. Symb. Comput., 1996)

Multiprecision floating point addition. - George E. Collins; Werner Krandick (ISSAC, 2000)

Polynomial Minimum Root Separation. - George E. Collins (J. Symb. Comput., 2001)

A Fast Euclidean Algorithm for Gaussian Integers. - George E. Collins (J. Symb. Comput., 2002)

Interval Arithmetic in Cylindrical Algebraic Decomposition. - George E. Collins; Jeremy R. Johnson; Werner Krandick (J. Symb. Comput., 2002)

Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions. - Scott McCallum; George E. Collins (J. Symb. Comput., 2002)

Single-factor coefficient bounds. - George E. Collins (J. Symb. Comput., 2004)

On the computing time of the continued fractions method. - George E. Collins; Werner Krandick (J. Symb. Comput., 2012)

Krandick's proof of Lagrange's real root bound claim. - George E. Collins (J. Symb. Comput., 2015)

Continued fraction real root isolation using the Hong root bound. - George E. Collins (J. Symb. Comput., 2016)

On the maximum computing time of the bisection method for real root isolation. - George E. Collins (J. Symb. Comput., 2017)