Anna Maria Bigatti

Orcid: 0000-0002-2987-9333

According to our database1, Anna Maria Bigatti authored at least 29 papers between 1991 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Saturations of subalgebras, SAGBI bases, and U-invariants.
J. Symb. Comput., 2022

2021
A C++ class for multi-state algebraic reliability computations.
Reliab. Eng. Syst. Saf., 2021

2020
Foreword.
Math. Comput. Sci., 2020

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

2019
Monomial Resolutions for Efficient Computation of Simplicial Homology.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Linear Algebra for Zero-Dimensional Ideals.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Discovery of statistical equivalence classes using computer algebra.
Int. J. Approx. Reason., 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

CoCoA-5.2.2 and CoCoALib.
ACM Commun. Comput. Algebra, 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
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

2011
Computing inhomogeneous Gröbner bases.
J. Symb. Comput., 2011

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

2009
Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

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

2006
CoCoA: a system for computations in commutative algebra.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

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

1999
Computing Toric Ideals.
J. Symb. Comput., 1999

1993
A "Divide and Conquer" Algorithm for Hilbert-Poincaré Series, Multiplicity and Dimension of Monomial Ideals.
Proceedings of the Applied Algebra, 1993

1991
On the Computation of Hilbert-Poincaré Series.
Appl. Algebra Eng. Commun. Comput., 1991


  Loading...