John Abbott

Orcid: 0000-0001-5608-3835

Affiliations:
  • University of Genoa, Italy
  • University of Bath, UK (1984-1987)


According to our database1, John Abbott authored at least 42 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing the Determinant of a Dense Matrix over ℤ.
Proceedings of the Mathematical Software - ICMS 2024, 2024

2020
Computing and using minimal polynomials.
J. Symb. Comput., 2020

Certifying Irreducibility in ℤ[x].
Proceedings of the Mathematical Software - ICMS 2020, 2020

2018
New in CoCoA-5.2.4 and CoCoALib-0.99600 for SC-Square.
Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

2017
Implicitization of hypersurfaces.
J. Symb. Comput., 2017

Fault-tolerant modular reconstruction of rational numbers.
J. Symb. Comput., 2017

CoCoA-5.2.2 and CoCoALib.
ACM Commun. Comput. Algebra, 2017

Social dilemma of autonomous cars a critical analysis.
Proceedings of the 2017 IEEE SmartWorld, 2017

New in CoCoA-5.2.2 and CoCoALib-0.99560 for SC-Square.
Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), 2017


2016
Satisfiability Checking meets Symbolic Computation (Project Paper).
CoRR, 2016

Groebner Bases for Everyone with CoCoA-5 and CoCoALib.
CoRR, 2016

Satisfiability checking and symbolic computation.
ACM Commun. Comput. Algebra, 2016

CoCoA and CoCoALib: Fast Prototyping and Flexible C++ Library for Computations in Commutative Algebra.
Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), 2016

SC<sup>2</sup>: Satisfiability Checking Meets Symbolic Computation - (Project Paper).
Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

2015
What is new in CoCoALib and CoCoA-5?
ACM Commun. Comput. Algebra, 2015

2014
Quadratic interval refinement for real roots.
ACM Commun. Comput. Algebra, 2014

Integration of Libnormaliz in CoCoALib and CoCoA 5.
Proceedings of the Mathematical Software - ICMS 2014, 2014

What Is New in CoCoA?
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Bounds on factors in <i>Z</i>[<i>x</i>].
J. Symb. Comput., 2013

2012
Twin-float arithmetic.
J. Symb. Comput., 2012

2010
CoCoALib: A C++ Library for Computations in Commutative Algebra... and Beyond.
Proceedings of the Mathematical Software, 2010

2008
Stable border bases for ideals of points.
J. Symb. Comput., 2008

2007
Thinning Out Redundant Empirical Data.
Math. Comput. Sci., 2007

CoCoA: computations in commutative algebra.
ACM Commun. Comput. Algebra, 2007

2006
The Design of CoCoALib.
Proceedings of the Mathematical Software, 2006

Challenges in Computational Commutative Algebra.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005
Computing zero-dimensional schemes.
J. Symb. Comput., 2005

2004
CoCoA: a laboratory for computations in commutative algebra.
SIGSAM Bull., 2004

2002
Sparse squares of polynomials.
Math. Comput., 2002

2001
How Tight is Hadamard's Bound?
Exp. Math., 2001

2000
Computing Ideals of Points.
J. Symb. Comput., 2000

Factorization in ***[<i>x</i>]: the searching phase.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999
Fast Deterministic Computation of Determinants of Dense Matrices.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1996
A report on OpenMath: a protocol for the exchange of mathematical information.
SIGSAM Bull., 1996

1990
Some Ideas about Fault-Tolerant Chinese Remaindering.
Proceedings of the Applied Algebra, 1990

1989
Recovery of Algebraic Numbers from Their <i>p</i>-adic Approximations.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1987
Factorisation of Polynominals: Old Ideas and Recent Results.
Proceedings of the Trends in Computer Algebra, 1987

Polynomial factorization: An exploration of Lenstra's algorithm.
Proceedings of the EUROCAL '87, 1987

Integration: Solving the Risch differential equation.
Proceedings of the EUROCAL '87, 1987

1986
The Bath algebraic number package.
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

1985
A remark on factorisation.
SIGSAM Bull., 1985


  Loading...