Amir Hashemi

Matthias Orth

J. Symb. Comput., September, 2023

A new algorithm for computing staggered linear bases.

[BibT_eX]

[DOI]

H. Michael Möller

J. Symb. Comput., July, 2023

On the Complexity of Linear Algebra Operations over Algebraic Extension Fields.

[BibT_eX]

[DOI]

Daniel Lichtblau

Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022

Computation of Macaulay constants and degree bounds for Gröbner bases.

[BibT_eX]

[DOI]

Hossein Parnian

J. Symb. Comput., 2022

Complementary decompositions of monomial ideals and involutive bases.

[BibT_eX]

[DOI]

Matthias Orth

Appl. Algebra Eng. Commun. Comput., 2022

2021

Degree Upper Bounds for Involutive Bases.

[BibT_eX]

[DOI]

Hossein Parnian

Math. Comput. Sci., 2021

Relative Gröbner and Involutive Bases for Ideals in Quotient Rings.

[BibT_eX]

[DOI]

Matthias Orth

Math. Comput. Sci., 2021

An Involutive GVW Algorithm and the Computation of Pommaret Bases.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

On Bézout inequalities for non-homogeneous polynomial ideals.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Computing the resolution regularity of bi-homogeneous ideals.

[BibT_eX]

[DOI]

Nasibeh Aramideh

J. Symb. Comput., 2021

Compact Packings of the Plane with Three Sizes of Discs.

[BibT_eX]

[DOI]

Thomas Fernique

Olga Sizova

Discret. Comput. Geom., 2021

2020

Deterministic normal position transformation and its applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Computing Coupled Border Bases.

[BibT_eX]

[DOI]

Martin Kreuzer

Samira Pourkhajouei

Math. Comput. Sci., 2020

Dimension and depth dependent upper bounds in polynomial ideal theory.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019

Parametric Standard Bases and Their Applications.

[BibT_eX]

[DOI]

Mahsa Kazemi

Proceedings of the Computer Algebra in Scientific Computing - 21st International Workshop, 2019

2018

Deterministic genericity for polynomial ideals.

[BibT_eX]

[DOI]

Michael Schweinfurter

J. Symb. Comput., 2018

Gröbner bases and multi-dimensional persistent bifurcation diagram classifications.

[BibT_eX]

[DOI]

Majid Gazor

Mahsa Kazemi

ACM Commun. Comput. Algebra, 2018

A Pommaret bases approach to the degree of a polynomial ideal.

[BibT_eX]

[DOI]

Bentolhoda Binaei

Appl. Algebra Eng. Commun. Comput., 2018

Universal Gröbner Basis for Parametric Polynomial Ideals.

[BibT_eX]

[DOI]

Marzieh Barkhordar

Proceedings of the Mathematical Software - ICMS 2018, 2018

Computation of Pommaret Bases Using Syzygies.

[BibT_eX]

[DOI]

Bentolhoda Binaei

Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017

Gröbner Systems Conversion.

[BibT_eX]

[DOI]

Marzieh Barkhordar

Math. Comput. Sci., 2017

Parametric FGLM algorithm.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

Computing Comprehensive Gröbner Systems: A Comparison of Two Methods.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2017

Dimension-Dependent Upper Bounds for Gröbner Bases.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

2016

A Note on Dynamic Gröbner Bases Computation.

[BibT_eX]

[DOI]

Delaram Talaashrafi

Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

Improved Computation of Involutive Bases.

[BibT_eX]

[DOI]

Bentolhoda Binaei

Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2015

Regular Chains under Linear Changes of Coordinates and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014

An Improvement of Rosenfeld-Gröbner Algorithm.

[BibT_eX]

[DOI]

Zahra Touraji

Proceedings of the Mathematical Software - ICMS 2014, 2014

Effective Computation of Radical of Ideals and Its Application to Invariant Theory.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Deterministically Computing Reduction Numbers of Polynomial Ideals.

[BibT_eX]

[DOI]

Michael Schweinfurter

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013

On the use of Buchberger criteria in G2V algorithm for calculating Gröbner bases.

[BibT_eX]

[DOI]

Program. Comput. Softw., 2013

Involutive bases algorithm incorporating F<sub>5</sub> criterion.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

Involutive Bases Algorithm Incorporating F5 Criterion.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Efficient computation of Castelnuovo-Mumford regularity.

[BibT_eX]

[DOI]

Math. Comput., 2012

Quasi-stability versus Genericity.

[BibT_eX]

[DOI]

Michael Schweinfurter

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

Comprehensive Involutive Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011

Applying IsRewritten criterion on Buchberger algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Erratum to "A new algorithm for discussing Gröbner bases with parameters" [J. Symbolic Comput. 33(1-2) (2002) 183-208].

[BibT_eX]

[DOI]

Antonio Montes

J. Symb. Comput., 2011

A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2011

Sharper Complexity Bounds for Zero-Dimensional GRöBner Bases and Polynomial System Solving.

[BibT_eX]

[DOI]

Daniel Lazard

Int. J. Algebra Comput., 2011

A Variant of Gerdt's Algorithm for Computing Involutive Bases

[BibT_eX]

[DOI]

CoRR, 2011

2010

Orientation relative à partir de 3 points homologues et de la direction verticale. Une approche directe.

[BibT_eX]

[DOI]

Traitement du Signal, 2010

Extended F<sub>5</sub> criteria.

[BibT_eX]

[DOI]

Gwénolé Ars

J. Symb. Comput., 2010

2009

Nullstellensätze for Zero-Dimensional Gröbner Bases.

[BibT_eX]

[DOI]

Comput. Complex., 2009

A Hybrid Algorithm for Solving 7 Parameters Transformation.

[BibT_eX]

[DOI]

Mahsad Kalantari

Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

2007

Polynomial-time algorithm for Hilbert series of Borel type ideals.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation, 2007

Efficient Algorithms for Computing Nöther Normalization.

[BibT_eX]

[DOI]