Amir Hashemi

Orcid: 0000-0002-0440-8623

According to our database1, Amir Hashemi authored at least 51 papers between 2007 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Machine learning parameter systems, Noether normalisations and quasi-stable positions.
J. Symb. Comput., 2025

A new algorithm for Gröbner bases conversion.
J. Symb. Comput., 2025

2023
Recursive structures in involutive bases theory.
J. Symb. Comput., September, 2023

A new algorithm for computing staggered linear bases.
J. Symb. Comput., July, 2023

On the Complexity of Linear Algebra Operations over Algebraic Extension Fields.
Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022
Computation of Macaulay constants and degree bounds for Gröbner bases.
J. Symb. Comput., 2022

Complementary decompositions of monomial ideals and involutive bases.
Appl. Algebra Eng. Commun. Comput., 2022

2021
Degree Upper Bounds for Involutive Bases.
Math. Comput. Sci., 2021

Relative Gröbner and Involutive Bases for Ideals in Quotient Rings.
Math. Comput. Sci., 2021

An Involutive GVW Algorithm and the Computation of Pommaret Bases.
Math. Comput. Sci., 2021

On Bézout inequalities for non-homogeneous polynomial ideals.
J. Symb. Comput., 2021

Computing the resolution regularity of bi-homogeneous ideals.
J. Symb. Comput., 2021

Compact Packings of the Plane with Three Sizes of Discs.
Discret. Comput. Geom., 2021

2020
Deterministic normal position transformation and its applications.
Theor. Comput. Sci., 2020

Computing Coupled Border Bases.
Math. Comput. Sci., 2020

Dimension and depth dependent upper bounds in polynomial ideal theory.
J. Symb. Comput., 2020

Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases.
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019
Parametric Standard Bases and Their Applications.
Proceedings of the Computer Algebra in Scientific Computing - 21st International Workshop, 2019

2018
Deterministic genericity for polynomial ideals.
J. Symb. Comput., 2018

Gröbner bases and multi-dimensional persistent bifurcation diagram classifications.
ACM Commun. Comput. Algebra, 2018

A Pommaret bases approach to the degree of a polynomial ideal.
Appl. Algebra Eng. Commun. Comput., 2018

Universal Gröbner Basis for Parametric Polynomial Ideals.
Proceedings of the Mathematical Software - ICMS 2018, 2018

Computation of Pommaret Bases Using Syzygies.
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017
Gröbner Systems Conversion.
Math. Comput. Sci., 2017

Parametric FGLM algorithm.
J. Symb. Comput., 2017

Computing Comprehensive Gröbner Systems: A Comparison of Two Methods.
Comput. Sci. J. Moldova, 2017

Dimension-Dependent Upper Bounds for Gröbner Bases.
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.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

2016
A Note on Dynamic Gröbner Bases Computation.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

Improved Computation of Involutive Bases.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2015
Regular Chains under Linear Changes of Coordinates and Applications.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
An Improvement of Rosenfeld-Gröbner Algorithm.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Effective Computation of Radical of Ideals and Its Application to Invariant Theory.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Deterministically Computing Reduction Numbers of Polynomial Ideals.
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.
Program. Comput. Softw., 2013

Involutive bases algorithm incorporating F<sub>5</sub> criterion.
J. Symb. Comput., 2013

Involutive Bases Algorithm Incorporating F5 Criterion.
CoRR, 2013

2012
Efficient computation of Castelnuovo-Mumford regularity.
Math. Comput., 2012

Quasi-stability versus Genericity.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

Comprehensive Involutive Systems.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011
Applying IsRewritten criterion on Buchberger algorithm.
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].
J. Symb. Comput., 2011

A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction.
J. Math. Imaging Vis., 2011

Sharper Complexity Bounds for Zero-Dimensional GRöBner Bases and Polynomial System Solving.
Int. J. Algebra Comput., 2011

A Variant of Gerdt's Algorithm for Computing Involutive Bases
CoRR, 2011

2010
Orientation relative à partir de 3 points homologues et de la direction verticale. Une approche directe.
Traitement du Signal, 2010

Extended F<sub>5</sub> criteria.
J. Symb. Comput., 2010

2009
Nullstellensätze for Zero-Dimensional Gröbner Bases.
Comput. Complex., 2009

A Hybrid Algorithm for Solving 7 Parameters Transformation.
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.
Proceedings of the Symbolic-Numeric Computation, 2007

Efficient Algorithms for Computing Nöther Normalization.
Proceedings of the Computer Mathematics, 8th Asian Symposium, 2007


  Loading...