Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Hashemi, Amir"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deterministically computing reduction numbers of polynomial ideals
Amir Hashemi
,
Michael Schweinfurter
,
Werner M. Seiler
Lecture Notes in Computer Science
8660
, 2014, pp. 186-201
Involutive bases algorithm incorporating
F_5
criterion
Vladimir P. Gerdt
,
Amir Hashemi
,
Benyamin M.-Alizadeh
Journal Symbolic Computation
59
, 2013, pp. 1-20
Comprehensive involutive systems
Vladimir Gerdt
,
Amir Hashemi
Lecture Notes in Computer Science
7442
, 2012, pp. 98-116
Quasi-stability versus genericity
Amir Hashemi
,
Michael Schweinfurter
,
Werner M. Seiler
Lecture Notes in Computer Science
7442
, 2012, pp. 172-184
Erratum to ``A new algorithm for discussing Gröbner bases with parameters''
Mahdi Dehghani Darmian
,
Amir Hashemi
,
Antonio Montes
Journal Symbolic Computation
46
(10), 2011, pp. 1187-1188
Applying IsRewritten criterion on Buchberger algorithm
Amir Hashemi
,
Benyamin M.-Alizadeh
Theoretical Computer Science
412
(35), 2011, pp. 4592-4603
Extended F
_5
criteria
Amir Hashemi
,
Gwénolé Ars
Journal Symbolic Computation
45
(12), 2010, pp. 1330-1340
Polynomial-time algorithm for Hilbert series of Borel type ideals
Amir Hashemi
Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation, SNC'2007 (London, Ontario, Canada, July 25-27, 2007)
, 2007, pp. 97-102