For Better Performance Please Use Chrome or Firefox Web Browser

Publications

Journal Papers
sort descending
پایه های تودرتو و کاربردهای آنها Winter 1399
A General Model for I/O System Theory January 2000
A Note on the Fitting Ideals in Free Resolutions January 2001
Almost polynomial Complexity for Zero-dimensional Grobner Bases January 2005
Fuzzy Sets From a Meta-System-Theoretic Point of View January 2006
Strong Noether Position January 2006
Structure and Complexity of Grobner Bases January 2006
Polynomial Complexity for Hilbert Series of Borel Type Ideals January 2007
Efficient Computation of Syzygies by Faugere's F5 Algorithm January 2007
Polynomial-Time Algorithm for Hilbert Series of Borel Type Ideals January 2007
Efficient Algorithms for Computing Noether Normalization January 2008
A Hybrid Algorithm for Solving 7 Parameters Transformation January 2009
Nullstellensatze for Zero-dimensional Grobner Bases January 2009
Extended F5 Criteria January 2010
Orientation Relative a Partir de 3 Points Homologues et de la Direction Verticale January 2010
Strong Noether Position and Stabilized Regularities January 2010
Erratum to "A New Algorithm for Discussing Grobner Bases with Parameters" [J.S.C. 33(1-2)(2002) 183-208] January 2011
A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction January 2011
Computing Syzygies by Faugère’s F5 Algorithm January 2011
Sharper Complexity Bounds for Zero-dimensional Grobner Bases and Polynomial System Solving January 2011
Applying IsRewritten Criterion on Buchberger Algorithm January 2011
A Variant of Gerdt's Algorithm for Computing Involutive Bases January 2012
Using Grobner Bases for Factoring Polynomials over Algebraic Extension Fields January 2012
Efficient Computation of Castelnuovo-Mumford Regularit January 2012
Applying Buchberger's Criteria on Montes DISPGB Algorithm January 2012
Quasi-Stability Versus Genericity February 2012
Comprehensive Involutive Systems January 2012
Direct Calculation of the 7 Parameters Transformation Problem January 2013
Involutive Bases Algorithm Incorporating F5 Criterion January 2013
On Application of Buchberger's Criteria in G2V Algorithm for Computing Grobner Bases January 2013
Invariant G2V Algorithm for Computing SAGBI-Grobner Bases January 2013
Minimal Polynomial Systems for Parametric Matrices January 2013
A Note on Grobner Bases and Graph Colorings January 2013
Applying Buchberger’s Criteria for Computing Grobner Basis over Finite Chain Rings January 2013
Classification of Finite Rings: Theory and Algorithm January 2013
Computing Minimal Polynomial of Matrices over Algebraic Extension Fields January 2013
Applications of Differential Algebra for Computing Lie Algebras of Infnitesimal CR-automorphisms January 2013
Deterministically Computing Reduction Numbers of Polynomial Ideals September 2014
Solving Linear System of Equations over Integers with Groebner Bases January 2014
Effective Computation of Radical of Ideals and Its Application to Invariant Theory August 2014
An Improvement of Rosenfeld-Grobner Algorithm August 2014
Simple Proofs of Some ‎Theorems ‎in ‎‎Resultant ‎Theory September 2015
Regular Chains under Linear Changes of Coordinates and Applications September 2015
Lie Algebras of Infinitesimal CR Automorphisms of Weighted Homogeneous and Homogeneous CR-Generic Submanifolds of C^N Summer 2016
Improved Computation of Involutive Bases Summer 2016
A Note on Dynamic Grobner Bases Computation Summer 2016
Parametric FGLM algorithm September 2017
Grobner Systems Conversion March 2017
Dimension-Dependent Upper Bounds for Grobner Bases July 2017
Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units July 2017
A Pommaret bases approach to the degree of a polynomial ideal Summer 2018
Degree upper bounds for H-bases January 2018
Universal Grobner Basis for Parametric Polynomial Ideals Summer 2018
Computation of Pommaret Bases Using Syzygies Summer 2018
Deterministic genericity for polynomial ideals. June 2018
Computing all border bases for ideals of points May 2019
Refined algorithm to compute minimal H-bases October 2019
Noether Bases and Their Applications Fall 2019
Compact Packings of the Plane with Three Sizes of Discs Spring 2019
Intrinsic complexity for constructing zero-Dimensional Grobner bases October 2020
Dimension and Depth Dependent Upper Bounds in Polynomial Ideal Theory Spring 2020
Computing H-bases via minimal bases for syzygy modules Summer 2020
Computing the resolution regularity of bi-homogeneous ideals March 2021
An involutive GVW algorithm and the computation of Pommaret bases Summer 2021
Relative Grobner and involutive bases for ideals in quotient rings Summer 2021
On Bezout inequalities for non-homogeneous polynomial ideals Summer 2021
Compact packings of the plane with three sizes of discs Summer 2021
Degree upper bounds for involutive bases Spring 2021
On the construction of staggered linear bases Summer 2021
پایه های تودرتو و کاربردهای آنها Winter 2021
Computation of Macaulay constants and degree bounds for Grobner bases August 2022
Une generalisation du critere de Boulier--Buchberger pour le calcul des ensembles caracteristiques d’ideaux differentiels Spring 2022
Complementary decompositions of monomial ideals and involutive bases Fall 2022
A new algorithm for computing staggered linear bases Summer 2023
Recursive structures in involutive bases theory Summer 2023
On the complexity of linear algebra operations over algebraic extension fields August 2023
Conference Papers
sort descending
Grobner bases and multi-dimensional persistent bifurcation diagram classifications December 2018

تحت نظارت وف ایرانی