The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

George E. Collins: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Tsu-Wu J. Chou, George E. Collins
    Algorithms for the Solution of Systems of Linear Diophantine Equations. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:687-708 [Journal]
  3. George E. Collins
    The Euclidean Algorithm for Gaussian Integers (Abstract). [Citation Graph (0, 0)][DBLP]
    Accurate Scientific Computations, 1985, pp:182- [Conf]
  4. George E. Collins
    Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:134-183 [Conf]
  5. George E. Collins, Jeremy R. Johnson, Wolfgang Küchlin
    Parallel Real Root Isolation Using the Coefficient Sign Variation Method. [Citation Graph (0, 0)][DBLP]
    CAP, 1990, pp:71-87 [Conf]
  6. 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]
  7. George E. Collins
    Factorization in Cylindrical Algebraic Decomposition. [Citation Graph (0, 0)][DBLP]
    EUROCAM, 1982, pp:212-214 [Conf]
  8. George E. Collins
    The SAC-2 Computer Algebra System. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:34-35 [Conf]
  9. George E. Collins
    Factoring univariate integral polynomial in polynomial average time. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1979, pp:317-329 [Conf]
  10. George E. Collins, Jeremy R. Johnson
    The Probability of Relative Primality of Gaussian Integers. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:252-258 [Conf]
  11. George E. Collins, Jeremy R. Johnson
    Quantifier Elimination and the Sign Variation Method for Real Root Isolation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:264-271 [Conf]
  12. George E. Collins, Werner Krandick
    Multiprecision floating point addition. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2000, pp:71-77 [Conf]
  13. George E. Collins, Werner Krandick
    An Efficient Algorithm for Infallible Polynomial Complex Root Isolation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1992, pp:189-194 [Conf]
  14. George E. Collins, Werner Krandick
    A Hybrid Method for High Precision Calculation of Polynomial Real Roots. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1993, pp:47-52 [Conf]
  15. George E. Collins, Werner Krandick
    A Tangent-Secant Method for Polynomial Complex Root Calculation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:137-141 [Conf]
  16. George E. Collins
    A method for overlapping and erasure of lists. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1960, v:3, n:12, pp:655-657 [Journal]
  17. George E. Collins
    PM, a system for polynomial manipulation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1966, v:9, n:8, pp:578-589 [Journal]
  18. George E. Collins
    Letters to the editor: comment on a paper by Ku and Adler. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:6, pp:302-303 [Journal]
  19. Gene Raichelson, George E. Collins
    A method for comparing the internal operating speeds of computers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1964, v:7, n:5, pp:309-310 [Journal]
  20. George E. Collins, David R. Musser
    Analysis of the Pope-Stein Division Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:5, pp:151-155 [Journal]
  21. George E. Collins
    Subresultants and Reduced Polynomial Remainder Sequences. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1967, v:14, n:1, pp:128-142 [Journal]
  22. George E. Collins
    The Calculation of Multivariate Polynomial Resultants. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1971, v:18, n:4, pp:515-532 [Journal]
  23. 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]
  24. George E. Collins
    Polynomial Minimum Root Separation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:32, n:5, pp:467-473 [Journal]
  25. George E. Collins
    A Fast Euclidean Algorithm for Gaussian Integers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:33, n:4, pp:385-392 [Journal]
  26. George E. Collins
    Single-factor coefficient bounds. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:38, n:6, pp:1507-1521 [Journal]
  27. George E. Collins, Mark J. Encarnación
    Efficient Rational Number Reconstruction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:3, pp:287-297 [Journal]
  28. George E. Collins, Mark J. Encarnación
    Improved Techniques for Factoring Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:21, n:3, pp:313-327 [Journal]
  29. George E. Collins, H. Hong
    Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:3, pp:299-328 [Journal]
  30. George E. Collins, Jeremy R. Johnson, Werner Krandick
    Interval Arithmetic in Cylindrical Algebraic Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:34, n:2, pp:145-157 [Journal]
  31. 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]
  32. George E. Collins
    Distributivity and An Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1954, v:19, n:4, pp:275-277 [Journal]
  33. 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]
  34. George E. Collins
    The Computing Time of the Euclidean Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:1, pp:1-10 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002