George E. Collins

According to our database1, George E. Collins authored at least 51 papers between 1954 and 2017.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2004, "For contributions to symbolic computation.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
On the maximum computing time of the bisection method for real root isolation.
J. Symb. Comput., 2017

2016
Continued fraction real root isolation using the Hong root bound.
J. Symb. Comput., 2016

2015
Krandick's proof of Lagrange's real root bound claim.
J. Symb. Comput., 2015

2012
On the computing time of the continued fractions method.
J. Symb. Comput., 2012

2004
Single-factor coefficient bounds.
J. Symb. Comput., 2004

2002
Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions.
J. Symb. Comput., 2002

Interval Arithmetic in Cylindrical Algebraic Decomposition.
J. Symb. Comput., 2002

A Fast Euclidean Algorithm for Gaussian Integers.
J. Symb. Comput., 2002

2001
Polynomial Minimum Root Separation.
J. Symb. Comput., 2001

2000
Multiprecision floating point addition.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1996
Improved Techniques for Factoring Univariate Polynomials.
J. Symb. Comput., 1996

A Tangent-Secant Method for Polynomial Complex Root Calculation.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
Efficient Rational Number Reconstruction.
J. Symb. Comput., 1995

1993
A Hybrid Method for High Precision Calculation of Polynomial Real Roots.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992
An Efficient Algorithm for Infallible Polynomial Complex Root Isolation.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
Partial Cylindrical Algebraic Decomposition for Quantifier Elimination.
J. Symb. Comput., 1991

1990
Parallel Real Root Isolation Using the Coefficient Sign Variation Method.
Proceedings of the Computer Algebra and Parallelism, 1990

1989
Quantifier Elimination and the Sign Variation Method for Real Root Isolation.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space.
J. Symb. Comput., 1988

The Probability of Relative Primality of Gaussian Integers.
Proceedings of the Symbolic and Algebraic Computation, 1988

1985
The SAC-2 Computer Algebra System.
Proceedings of the EUROCAL '85, 1985

The Euclidean Algorithm for Gaussian Integers (Abstract).
Proceedings of the Accurate Scientific Computations, 1985

1984
Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane.
SIAM J. Comput., 1984

Cylindrical Algebraic Decomposition I: The Basic Algorithm.
SIAM J. Comput., 1984

1982
Algorithms for the Solution of Systems of Linear Diophantine Equations.
SIAM J. Comput., 1982

The Jacobi symbol algorithm.
SIGSAM Bull., 1982

Computer algebra symbolic and algebraic computation.
SIGSAM Bull., 1982

Factorization in Cylindrical Algebraic Decomposition.
Proceedings of the Computer Algebra, 1982

1979
Factoring univariate integral polynomial in polynomial average time.
Proceedings of the Symbolic and Algebraic Computation, 1979

1977
Analysis of the Pope-Stein Division Algorithm.
Inf. Process. Lett., 1977

1976
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis.
SIGSAM Bull., 1976

Polynomial real root isolation by differentiation.
Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976

Polynomial real root isolation using Descarte's rule of signs.
Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976

Algorithms for Gaussian integer arithmetic.
Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976

SIGSAM (Paper Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1975
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition.
Proceedings of the Automata Theory and Formal Languages, 1975

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

1974
The Computing Time of the Euclidean Algorithm.
SIAM J. Comput., 1974

SAC-1 solution of problem #7.
SIGSAM Bull., 1974

Quantifier elimination for real closed fields by cylindrical algebraic decomposition-preliminary report.
SIGSAM Bull., 1974

1972
Symbolic mathematical computation in a Ph.D. computer science program.
Proceedings of the 2nd SIGCSE Technical Symposium on Computer Science Education, 1972

1971
The Calculation of Multivariate Polynomial Resultants.
J. ACM, 1971

The SAC-1 system: An introduction and survey.
Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, 1971

1970
On the interpretability of arithmetic in set theory.
Notre Dame J. Formal Log., 1970

1969
Letters to the editor: comment on a paper by Ku and Adler.
Commun. ACM, 1969

1967
Subresultants and Reduced Polynomial Remainder Sequences.
J. ACM, 1967

1966
PM, a system for polynomial manipulation.
Commun. ACM, 1966

1964
A method for comparing the internal operating speeds of computers.
Commun. ACM, 1964

1960
A method for overlapping and erasure of lists.
Commun. ACM, 1960

1956
The Tarski decision procedure.
Proceedings of the 11th ACM national meeting, 1956

1954
Distributivity and An Axiom of Choice.
J. Symb. Log., 1954


  Loading...