default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Abbott
Person information
- affiliation: University of Genoa, Italy
- affiliation (1984-1987): University of Bath, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]John Abbott
, Claus Fieker:
Computing the Determinant of a Dense Matrix over ℤ. ICMS 2024: 29-35- 2020
- [j19]John Abbott, Anna Maria Bigatti, Elisa Palezzato, Lorenzo Robbiano:
Computing and using minimal polynomials. J. Symb. Comput. 100: 137-163 (2020) - [c19]John Abbott:
Certifying Irreducibility in ℤ[x]. ICMS 2020: 462-472
2010 – 2019
- 2019
- [e1]John Abbott, Alberto Griggio:
Proceedings of the 4th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, SC-square@SIAM AG 2019, Bern, Switzerland, 10th July 2019. CEUR Workshop Proceedings 2460, CEUR-WS.org 2019 [contents] - 2018
- [c18]John Abbott, Anna Maria Bigatti, Elisa Palezzato:
New in CoCoA-5.2.4 and CoCoALib-0.99600 for SC-Square. SC-Square@FLOC 2018: 88 - 2017
- [j18]John Abbott, Anna Maria Bigatti:
CoCoA-5.2.2 and CoCoALib. ACM Commun. Comput. Algebra 51(3): 95-97 (2017) - [j17]John Abbott:
Fault-tolerant modular reconstruction of rational numbers. J. Symb. Comput. 80: 707-718 (2017) - [j16]John Abbott, Anna Maria Bigatti, Lorenzo Robbiano:
Implicitization of hypersurfaces. J. Symb. Comput. 81: 20-40 (2017) - [c17]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Vijay Ganesh, Alberto Griggio, Daniel Kroening, Werner M. Seiler:
SC-square: when Satisfiability Checking and Symbolic Computation join forces. ARCADE@CADE 2017: 6-10 - [c16]John Abbott, Anna Maria Bigatti:
New in CoCoA-5.2.2 and CoCoALib-0.99560 for SC-Square. SC²@ISSAC 2017 - [c15]Manju Bisht, John Abbott, Ashraf Gaffar:
Social dilemma of autonomous cars a critical analysis. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2017: 1-3 - [i5]John Abbott, Anna Maria Bigatti, Elisa Palezzato, Lorenzo Robbiano:
Computing and Using Minimal Polynomials. CoRR abs/1702.07262 (2017) - 2016
- [j15]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
Satisfiability checking and symbolic computation. ACM Commun. Comput. Algebra 50(4): 145-147 (2016) - [c14]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper). CICM 2016: 28-43 - [c13]John Abbott, Anna Maria Bigatti:
CoCoA and CoCoALib: Fast Prototyping and Flexible C++ Library for Computations in Commutative Algebra. SC²@SYNASC 2016: 1-3 - [i4]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
Satisfiability Checking and Symbolic Computation. CoRR abs/1607.06945 (2016) - [i3]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
Satisfiability Checking meets Symbolic Computation (Project Paper). CoRR abs/1607.08028 (2016) - [i2]John Abbott, Anna Maria Bigatti:
Groebner Bases for Everyone with CoCoA-5 and CoCoALib. CoRR abs/1611.07306 (2016) - 2015
- [j14]John Abbott, Anna Maria Bigatti:
What is new in CoCoALib and CoCoA-5? ACM Commun. Comput. Algebra 49(4): 113-116 (2015) - 2014
- [j13]John Abbott:
Quadratic interval refinement for real roots. ACM Commun. Comput. Algebra 48(1/2): 3-12 (2014) - [c12]John Abbott, Anna Maria Bigatti:
What Is New in CoCoA? ICMS 2014: 352-358 - [c11]John Abbott, Anna Maria Bigatti, Christof Söger:
Integration of Libnormaliz in CoCoALib and CoCoA 5. ICMS 2014: 647-653 - 2013
- [j12]John Abbott:
Bounds on factors in Z[x]. J. Symb. Comput. 50: 532-563 (2013) - 2012
- [j11]John Abbott:
Twin-float arithmetic. J. Symb. Comput. 47(5): 536-551 (2012) - 2010
- [c10]John Abbott, Anna Maria Bigatti:
CoCoALib: A C++ Library for Computations in Commutative Algebra... and Beyond. ICMS 2010: 73-76
2000 – 2009
- 2008
- [j10]John Abbott, Claudia Fassino, Maria-Laura Torrente:
Stable border bases for ideals of points. J. Symb. Comput. 43(12): 883-894 (2008) - 2007
- [j9]John Abbott, Anna Maria Bigatti, Massimo Caboara, Lorenzo Robbiano:
CoCoA: computations in commutative algebra. ACM Commun. Comput. Algebra 41(3): 111-112 (2007) - [j8]John Abbott, Claudia Fassino, Maria-Laura Torrente:
Thinning Out Redundant Empirical Data. Math. Comput. Sci. 1(2): 375-392 (2007) - 2006
- [c9]John Abbott:
The Design of CoCoALib. ICMS 2006: 205-215 - [i1]John Abbott:
Challenges in Computational Commutative Algebra. Challenges in Symbolic Computation Software 2006 - 2005
- [j7]John Abbott, Martin Kreuzer, Lorenzo Robbiano:
Computing zero-dimensional schemes. J. Symb. Comput. 39(1): 31-49 (2005) - 2004
- [j6]John Abbott:
CoCoA: a laboratory for computations in commutative algebra. SIGSAM Bull. 38(1): 18-19 (2004) - 2002
- [j5]John Abbott:
Sparse squares of polynomials. Math. Comput. 71(237): 407-413 (2002) - 2001
- [j4]John Abbott, Thom Mulders:
How Tight is Hadamard's Bound? Exp. Math. 10(3): 331-336 (2001) - 2000
- [j3]John Abbott, Anna Maria Bigatti, Martin Kreuzer, Lorenzo Robbiano:
Computing Ideals of Points. J. Symb. Comput. 30(4): 341-356 (2000) - [c8]John Abbott, Victor Shoup, Paul Zimmermann:
Factorization in ***[x]: the searching phase. ISSAC 2000: 1-7
1990 – 1999
- 1999
- [c7]John Abbott, Manuel Bronstein, Thom Mulders:
Fast Deterministic Computation of Determinants of Dense Matrices. ISSAC 1999: 197-204 - 1996
- [j2]John Abbott, Angel Díaz, Robert S. Sutor:
A report on OpenMath: a protocol for the exchange of mathematical information. SIGSAM Bull. 30(1): 21-24 (1996) - 1990
- [c6]John Abbott:
Some Ideas about Fault-Tolerant Chinese Remaindering. AAECC 1990: 155-163
1980 – 1989
- 1989
- [c5]John Abbott:
Recovery of Algebraic Numbers from Their p-adic Approximations. ISSAC 1989: 112-120 - 1987
- [c4]John A. Abbott, James H. Davenport:
Polynomial factorization: An exploration of Lenstra's algorithm. EUROCAL 1987: 391-402 - [c3]John A. Abbott:
Integration: Solving the Risch differential equation. EUROCAL 1987: 465-467 - [c2]John A. Abbott, Russell J. Bradford, James H. Davenport:
Factorisation of Polynominals: Old Ideas and Recent Results. Trends in Computer Algebra 1987: 81-91 - 1986
- [c1]John A. Abbott, Russell J. Bradford, James H. Davenport:
The Bath algebraic number package. SYMSAC 1986: 250-253 - 1985
- [j1]John A. Abbott, Russell J. Bradford, James H. Davenport:
A remark on factorisation. SIGSAM Bull. 19(2): 31-33 (1985)
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-12 23:00 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:
