default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge E. Collins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j31]George E. Collins:
On the maximum computing time of the bisection method for real root isolation. J. Symb. Comput. 79: 444-456 (2017)- 2016
- [j30]George E. Collins:
Continued fraction real root isolation using the Hong root bound. J. Symb. Comput. 72: 21-54 (2016) - 2015
- [j29]George E. Collins:
Krandick's proof of Lagrange's real root bound claim. J. Symb. Comput. 70: 106-111 (2015) - 2012
- [j28]George E. Collins, Werner Krandick:
On the computing time of the continued fractions method. J. Symb. Comput. 47(11): 1372-1412 (2012)
2000 – 2009
- 2004
- [j27]George E. Collins:
Single-factor coefficient bounds. J. Symb. Comput. 38(6): 1507-1521 (2004) - 2002
- [j26]Scott McCallum
, George E. Collins:
Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions. J. Symb. Comput. 33(3): 321-342 (2002) - [j25]George E. Collins:
A Fast Euclidean Algorithm for Gaussian Integers. J. Symb. Comput. 33(4): 385-392 (2002) - [j24]George E. Collins, Jeremy R. Johnson, Werner Krandick:
Interval Arithmetic in Cylindrical Algebraic Decomposition. J. Symb. Comput. 34(2): 145-157 (2002) - 2001
- [j23]George E. Collins:
Polynomial Minimum Root Separation. J. Symb. Comput. 32(5): 467-473 (2001) - 2000
- [c22]George E. Collins, Werner Krandick:
Multiprecision floating point addition. ISSAC 2000: 71-77
1990 – 1999
- 1996
- [j22]George E. Collins, Mark J. Encarnación:
Improved Techniques for Factoring Univariate Polynomials. J. Symb. Comput. 21(3): 313-327 (1996) - [c21]George E. Collins, Werner Krandick:
A Tangent-Secant Method for Polynomial Complex Root Calculation. ISSAC 1996: 137-141 - 1995
- [j21]George E. Collins, Mark J. Encarnación:
Efficient Rational Number Reconstruction. J. Symb. Comput. 20(3): 287-297 (1995) - 1993
- [c20]George E. Collins, Werner Krandick:
A Hybrid Method for High Precision Calculation of Polynomial Real Roots. ISSAC 1993: 47-52 - 1992
- [c19]George E. Collins, Werner Krandick:
An Efficient Algorithm for Infallible Polynomial Complex Root Isolation. ISSAC 1992: 189-194 - 1991
- [j20]George E. Collins, Hoon Hong:
Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. J. Symb. Comput. 12(3): 299-328 (1991) - 1990
- [c18]George E. Collins, Jeremy R. Johnson, Wolfgang Küchlin:
Parallel Real Root Isolation Using the Coefficient Sign Variation Method. CAP 1990: 71-87
1980 – 1989
- 1989
- [c17]George E. Collins, Jeremy R. Johnson:
Quantifier Elimination and the Sign Variation Method for Real Root Isolation. ISSAC 1989: 264-271 - 1988
- [j19]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) - [c16]George E. Collins, Jeremy R. Johnson:
The Probability of Relative Primality of Gaussian Integers. ISSAC 1988: 252-258 - 1985
- [c15]George E. Collins:
The Euclidean Algorithm for Gaussian Integers (Abstract). Accurate Scientific Computations 1985: 182 - [c14]George E. Collins:
The SAC-2 Computer Algebra System. European Conference on Computer Algebra (2) 1985: 34-35 - [c13]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 - 1984
- [j18]Dennis S. Arnon, George E. Collins, Scott McCallum:
Cylindrical Algebraic Decomposition I: The Basic Algorithm. SIAM J. Comput. 13(4): 865-877 (1984) - [j17]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
- [j16]George E. Collins, Rüdiger G. K. Loos:
The Jacobi symbol algorithm. SIGSAM Bull. 16(1): 12-16 (1982) - [j15]Bruno Buchberger, George E. Collins, Rüdiger Loos, R. Albrecht:
Computer algebra symbolic and algebraic computation. SIGSAM Bull. 16(4): 5 (1982) - [j14]Tsu-Wu J. Chou, George E. Collins:
Algorithms for the Solution of Systems of Linear Diophantine Equations. SIAM J. Comput. 11(4): 687-708 (1982) - [c12]George E. Collins:
Factorization in Cylindrical Algebraic Decomposition. EUROCAM 1982: 212-214
1970 – 1979
- 1979
- [c11]George E. Collins:
Factoring univariate integral polynomial in polynomial average time. EUROSAM 1979: 317-329 - 1977
- [j13]George E. Collins, David R. Musser:
Analysis of the Pope-Stein Division Algorithm. Inf. Process. Lett. 6(5): 151-155 (1977) - 1976
- [j12]George E. Collins:
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis. SIGSAM Bull. 10(1): 10-12 (1976) - [c10]Joel Moses, Martin L. Griss, George E. Collins:
SIGSAM (Paper Session). ACM Annual Conference 1976: 424 - [c9]George E. Collins, Rüdiger Loos:
Polynomial real root isolation by differentiation. SYMSACC 1976: 15-25 - [c8]Bob F. Caviness, George E. Collins:
Algorithms for Gaussian integer arithmetic. SYMSACC 1976: 36-45 - [c7]George E. Collins, Alkiviadis G. Akritas:
Polynomial real root isolation using Descarte's rule of signs. SYMSACC 1976: 272-275 - 1975
- [c6]George E. Collins:
SIGSAM 2-Symbolic mathematical systems (Part II) and methods for symbolic and algebraic computation (Tutorial and papers). ACM Annual Conference 1975: 265 - [c5]George E. Collins:
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Automata Theory and Formal Languages 1975: 134-183 - 1974
- [j11]George E. Collins, David R. Musser, Michael Rothstein:
SAC-1 solution of problem #7. SIGSAM Bull. 8(2): 17-19 (1974) - [j10]George E. Collins:
Quantifier elimination for real closed fields by cylindrical algebraic decomposition-preliminary report. SIGSAM Bull. 8(3): 80-90 (1974) - [j9]George E. Collins:
The Computing Time of the Euclidean Algorithm. SIAM J. Comput. 3(1): 1-10 (1974) - 1972
- [c4]Bob F. Caviness, George E. Collins:
Symbolic mathematical computation in a Ph.D. computer science program. SIGCSE 1972: 19-23 - 1971
- [j8]George E. Collins:
The Calculation of Multivariate Polynomial Resultants. J. ACM 18(4): 515-532 (1971) - [c3]George E. Collins:
The SAC-1 system: An introduction and survey. SYMSAC 1971: 144-152 - [c2]George E. Collins:
The calculation of multivariate polynomial resultants. SYMSAC 1971: 212-222 - 1970
- [j7]George E. Collins, J. D. Halpern:
On the interpretability of arithmetic in set theory. Notre Dame J. Formal Log. 11(4): 477-483 (1970)
1960 – 1969
- 1969
- [j6]George E. Collins:
Letters to the editor: comment on a paper by Ku and Adler. Commun. ACM 12(6): 302-303 (1969) - 1967
- [j5]George E. Collins:
Subresultants and Reduced Polynomial Remainder Sequences. J. ACM 14(1): 128-142 (1967) - 1966
- [j4]George E. Collins:
PM, a system for polynomial manipulation. Commun. ACM 9(8): 578-589 (1966) - 1964
- [j3]Gene Raichelson, George E. Collins:
A method for comparing the internal operating speeds of computers. Commun. ACM 7(5): 309-310 (1964) - 1960
- [j2]George E. Collins:
A method for overlapping and erasure of lists. Commun. ACM 3(12): 655-657 (1960)
1950 – 1959
- 1956
- [c1]George E. Collins:
The Tarski decision procedure. ACM National Meeting 1956: 162-164 - 1954
- [j1]George E. Collins:
Distributivity and An Axiom of Choice. J. Symb. Log. 19(4): 275-277 (1954)
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-04-24 22:45 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:
