default search action
Amir Hashemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j31]Amir Hashemi, Mahshid Mirhashemi, Werner M. Seiler
:
Machine learning parameter systems, Noether normalisations and quasi-stable positions. J. Symb. Comput. 126: 102345 (2025) - [j30]Amir Hashemi, Deepak Kapur:
A new algorithm for Gröbner bases conversion. J. Symb. Comput. 128: 102391 (2025) - 2023
- [j29]Amir Hashemi
A new algorithm for computing staggered linear bases. J. Symb. Comput. 117: 1-14 (2023) - [j28]Amir Hashemi
Recursive structures in involutive bases theory. J. Symb. Comput. 118: 32-68 (2023) - [c19]Amir Hashemi, Daniel Lichtblau:
On the Complexity of Linear Algebra Operations over Algebraic Extension Fields. CASC 2023: 141-161 - 2022
- [j27]Amir Hashemi, Matthias Orth, Werner M. Seiler:
Complementary decompositions of monomial ideals and involutive bases. Appl. Algebra Eng. Commun. Comput. 33(6): 791-821 (2022) - [j26]Amir Hashemi, Hossein Parnian, Werner M. Seiler:
Computation of Macaulay constants and degree bounds for Gröbner bases. J. Symb. Comput. 111: 44-60 (2022) - 2021
- [j25]Thomas Fernique, Amir Hashemi, Olga Sizova:
Compact Packings of the Plane with Three Sizes of Discs. Discret. Comput. Geom. 66(2): 613-635 (2021) - [j24]Nasibeh Aramideh, Amir Hashemi, Werner M. Seiler:
Computing the resolution regularity of bi-homogeneous ideals. J. Symb. Comput. 103: 141-156 (2021) - [j23]Amir Hashemi, Joos Heintz, Luis M. Pardo
On Bézout inequalities for non-homogeneous polynomial ideals. J. Symb. Comput. 106: 1-22 (2021) - [j22]Amir Hashemi, Hossein Parnian, Werner M. Seiler:
Degree Upper Bounds for Involutive Bases. Math. Comput. Sci. 15(2): 233-254 (2021) - [j21]Amir Hashemi, Thomas Izgin, Daniel Robertz, Werner M. Seiler:
An Involutive GVW Algorithm and the Computation of Pommaret Bases. Math. Comput. Sci. 15(3): 419-452 (2021) - [j20]Amir Hashemi, Matthias Orth, Werner M. Seiler:
Relative Gröbner and Involutive Bases for Ideals in Quotient Rings. Math. Comput. Sci. 15(3): 453-482 (2021) - 2020
- [j19]Amir Hashemi, Werner M. Seiler:
Dimension and depth dependent upper bounds in polynomial ideal theory. J. Symb. Comput. 98: 47-64 (2020) - [j18]Amir Hashemi, Martin Kreuzer
Computing Coupled Border Bases. Math. Comput. Sci. 14(1): 123-140 (2020) - [j17]Benyamin M.-Alizadeh, Amir Hashemi:
Deterministic normal position transformation and its applications. Theor. Comput. Sci. 842: 50-64 (2020) - [c18]Amir Hashemi, Joos Heintz, Luis M. Pardo
Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases. CASC 2020: 245-265
2010 – 2019
- 2019
- [c17]Amir Hashemi, Mahsa Kazemi:
Parametric Standard Bases and Their Applications. CASC 2019: 179-196 - [c16]Thomas Fernique, Amir Hashemi, Olga Sizova:
Compact Packings of the Plane with Three Sizes of Discs. DGCI 2019: 420-431 - 2018
- [j16]Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler
A Pommaret bases approach to the degree of a polynomial ideal. Appl. Algebra Eng. Commun. Comput. 29(4): 283-301 (2018) - [j15]Majid Gazor
Gröbner bases and multi-dimensional persistent bifurcation diagram classifications. ACM Commun. Comput. Algebra 52(4): 120-122 (2018) - [j14]Amir Hashemi, Michael Schweinfurter, Werner M. Seiler
Deterministic genericity for polynomial ideals. J. Symb. Comput. 86: 20-50 (2018) - [c15]Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler
Computation of Pommaret Bases Using Syzygies. CASC 2018: 51-66 - [c14]Amir Hashemi, Mahdi Dehghani Darmian, Marzieh Barkhordar:
Universal Gröbner Basis for Parametric Polynomial Ideals. ICMS 2018: 191-199 - [i13]Thomas Fernique, Amir Hashemi, Olga Sizova:
Compact packings of the plane with three sizes of discs. CoRR abs/1808.10677 (2018) - [i12]Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler:
A Pommaret Bases Approach to the Degree of a Polynomial Ideal. CoRR abs/1809.10964 (2018) - [i11]Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler:
Computation of Pommaret Bases Using Syzygies. CoRR abs/1809.10971 (2018) - [i10]Thomas Fernique, Amir Hashemi, Olga Sizova:
Compact packings of the plane with three sizes of discs. CoRR abs/1810.02231 (2018) - 2017
- [j13]Amir Hashemi, Benyamin M.-Alizadeh, Mahdi Dehghani Darmian:
Computing Comprehensive Gröbner Systems: A Comparison of Two Methods. Comput. Sci. J. Moldova 25(3): 278-302 (2017) - [j12]Mahdi Dehghani Darmian, Amir Hashemi:
Parametric FGLM algorithm. J. Symb. Comput. 82: 38-56 (2017) - [j11]Amir Hashemi, Mahdi Dehghani Darmian, Marzieh Barkhordar:
Gröbner Systems Conversion. Math. Comput. Sci. 11(1): 61-77 (2017) - [c13]Sardar Anisul Haque
Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units. PASCO@ISSAC 2017: 10:1-10:10 - [c12]Amir Hashemi, Werner M. Seiler
Dimension-Dependent Upper Bounds for Gröbner Bases. ISSAC 2017: 189-196 - [i9]Amir Hashemi, Joos Heintz, Luis Miguel Pardo, Pablo Solernó:
On Bezout Inequalities for non-homogeneous Polynomial Ideals. CoRR abs/1701.04341 (2017) - [i8]Amir Hashemi, Werner M. Seiler:
Dimension-Dependent Upper Bounds for Grobner Bases. CoRR abs/1705.02776 (2017) - [i7]Amir Hashemi, Michael Schweinfurter, Werner M. Seiler:
Deterministic Genericity for Polynomial Ideals. CoRR abs/1705.02797 (2017) - [i6]Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler:
Improved Computation of Involutive Bases. CoRR abs/1705.03441 (2017) - 2016
- [c11]Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler
Improved Computation of Involutive Bases. CASC 2016: 58-72 - [c10]Amir Hashemi, Delaram Talaashrafi:
A Note on Dynamic Gröbner Bases Computation. CASC 2016: 276-288 - 2015
- [c9]Parisa Alvandi, Changbo Chen, Amir Hashemi, Marc Moreno Maza:
Regular Chains under Linear Changes of Coordinates and Applications. CASC 2015: 30-44 - 2014
- [c8]Amir Hashemi, Michael Schweinfurter, Werner M. Seiler
Deterministically Computing Reduction Numbers of Polynomial Ideals. CASC 2014: 186-201 - [c7]Amir Hashemi:
Effective Computation of Radical of Ideals and Its Application to Invariant Theory. ICMS 2014: 382-389 - [c6]Amir Hashemi, Zahra Touraji:
An Improvement of Rosenfeld-Gröbner Algorithm. ICMS 2014: 466-471 - 2013
- [j10]Vladimir P. Gerdt, Amir Hashemi, Benyamin M.-Alizadeh:
Involutive bases algorithm incorporating F5 criterion. J. Symb. Comput. 59: 1-20 (2013) - [j9]Vladimir P. Gerdt, Amir Hashemi:
On the use of Buchberger criteria in G2V algorithm for calculating Gröbner bases. Program. Comput. Softw. 39(2): 81-90 (2013) - [i5]Vladimir P. Gerdt, Amir Hashemi, Benyamin M.-Alizadeh:
Involutive Bases Algorithm Incorporating F5 Criterion. CoRR abs/1306.6811 (2013) - 2012
- [j8]Amir Hashemi:
Efficient computation of Castelnuovo-Mumford regularity. Math. Comput. 81(278): 1163-1177 (2012) - [c5]Vladimir P. Gerdt, Amir Hashemi:
Comprehensive Involutive Systems. CASC 2012: 98-116 - [c4]Amir Hashemi, Michael Schweinfurter, Werner M. Seiler:
Quasi-stability versus Genericity. CASC 2012: 172-184 - [i4]Amir Hashemi, Michael Schweinfurter, Werner M. Seiler:
Quasi-Stability versus Genericity. CoRR abs/1205.6671 (2012) - [i3]Vladimir P. Gerdt, Amir Hashemi:
Comprehensive Involutive Systems. CoRR abs/1206.0181 (2012) - 2011
- [j7]Amir Hashemi, Daniel Lazard:
Sharper Complexity Bounds for Zero-Dimensional GRöBner Bases and Polynomial System Solving. Int. J. Algebra Comput. 21(5): 703-713 (2011) - [j6]Mahzad Kalantari, Amir Hashemi, Franck Jung, Jean-Pierre Guédon:
A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction. J. Math. Imaging Vis. 39(3): 259-268 (2011) - [j5]Mahdi Dehghani Darmian, Amir Hashemi, Antonio Montes:
Erratum to "A new algorithm for discussing Gröbner bases with parameters" [J. Symbolic Comput. 33(1-2) (2002) 183-208]. J. Symb. Comput. 46(10): 1187-1188 (2011) - [j4]Amir Hashemi, Benyamin M.-Alizadeh:
Applying IsRewritten criterion on Buchberger algorithm. Theor. Comput. Sci. 412(35): 4592-4603 (2011) - [i2]Vladimir P. Gerdt, Amir Hashemi, Benyamin M.-Alizadeh:
A Variant of Gerdt's Algorithm for Computing Involutive Bases. CoRR abs/1108.3261 (2011) - 2010
- [j3]Amir Hashemi, Gwénolé Ars:
Extended F5 criteria. J. Symb. Comput. 45(12): 1330-1340 (2010) - [j2]Mahsad Kalantari, Amir Hashemi, Franck Jung, Jean-Pierre Guédon:
Orientation relative à partir de 3 points homologues et de la direction verticale. Une approche directe. Traitement du Signal 27(3): 325-348 (2010)
2000 – 2009
- 2009
- [j1]Amir Hashemi:
Nullstellensätze for Zero-Dimensional Gröbner Bases. Comput. Complex. 18(1): 155-168 (2009) - [c3]Amir Hashemi, Mahsad Kalantari:
A Hybrid Algorithm for Solving 7 Parameters Transformation. SYNASC 2009: 37-44 - [i1]Mahzad Kalantari, Amir Hashemi, Franck Jung, Jean-Pierre Guédon:
A New Solution to the Relative Orientation Problem using only 3 Points and the Vertical Direction. CoRR abs/0905.3964 (2009) - 2007
- [c2]Amir Hashemi:
Efficient Algorithms for Computing Nöther Normalization. ASCM 2007: 97-107 - [c1]Amir Hashemi:
Polynomial-time algorithm for Hilbert series of Borel type ideals. SNC 2007: 97-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: