Teo Mora: Difference between revisions
Content deleted Content added
Bencherlite (talk | contribs) remove material sourced only to another language version of Wikipedia, per BLP |
add publications && see also section, plus general cleanup |
||
Line 3: | Line 3: | ||
<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=Teo Mora|date=2 April 2017|result='''keep'''}} --> |
<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=Teo Mora|date=2 April 2017|result='''keep'''}} --> |
||
<!-- End of AfD message, feel free to edit beyond this point --> |
<!-- End of AfD message, feel free to edit beyond this point --> |
||
'''Ferdinando 'Teo' Mora'''{{efn|Teo Mora is his nickname, but used in most of his post-1980s publications; he has also used the [[pen name]] Theo Moriarty.<ref name=universityBio>https://fermat.dima.unige.it/didattica/matematica/new/index.php/component/anagrafica/docenti/27/MoraTeo.html</ref>}} is an Italian [[mathematician]], and since 1990,<ref name=universityBio/> a professor of [[Algebraic geometry#Computational algebraic geometry|algebra]] at the [[University of Genoa]].{{efn|Currently in the Dipartimento di Matematica,<ref name=universityBio/> formerly{{when}} in the Dipartimento di Informatica e Scienze dell'Informazione.[http://www.disi.unige.it/person/MoraF/]}} |
|||
'''Teo Mora''' is an Italian [[mathematician]], a professor of Dipartimento di Matematica at [[University of Genoa|University of Genova]]. He has contributions in [[computer algebra]]. He is an editor of ''Applicable Algebra in Engineering, Communication and Computing''.<ref>{{Cite web|url=http://www.dima.unige.it/~morafe/|title=Teo Mora Information Page|website=www.dima.unige.it|access-date=2017-04-02}}</ref> He is the author of the four-volume book ''Solving Polynomial Equation Systems''.<ref>{{Cite web|url=http://www.cambridge.org/ca/academic/subjects/mathematics/algebra/solving-polynomial-equation-systems-i-kronecker-duval-philosophy?format=HB&isbn=9780521811545|title=Solving Polynomial Equation Systems I|website=Cambridge University Press|access-date=2017-03-25}}</ref> |
|||
== Life and work == |
|||
Mora's degree is in mathematics from the [[University of Genoa]] in 1974.<ref name=universityBio/> Mora's [[#Further_reading|publications]] span forty years; his best-cited{{efn|1=https://scholar.google.com/scholar?q=%28%22Teo+Mora%22+OR+%22Ferdinando+Mora%22%29&as_sdt=1%2C44}} works thus far: |
|||
* [[#mora82|1982 paper]] on [[tangent cone]]s |
|||
* [[#mora84|1984 paper]] on [[Gröbner bases]] and bounding the degree thereof |
|||
* [[#mora85|1985 paper]] on [[Gröbner bases]] and non-commutative [[polynomial ring]]s |
|||
* [[#moellerMora86|1986 paper]] on [[ideal theory]] methods |
|||
* [[#mora88|1988 paper]] on the [[Gröbner fan]] |
|||
* [[#gianniMora89|1989 paper]] on [[Gröbner bases]] and [[systems of polynomial equations]] |
|||
* [[#gioviniMora91|1991 paper]] on [[Buchberger algorithm]] selection-strategies |
|||
* [[#moellerMora92|1992 paper]] on [[Gröbner bases]] and [[syzygies]] |
|||
* [[#marinariMoellerMora93|1993 paper]] on [[Gröbner bases]] and [[projective geometry|projective]] points |
|||
* [[#fglm93|1993 paper]] on computing [[Gröbner bases]] using the [[FGLM algorithm]] (named for Mora and his co-authors) |
|||
* [[#beckerMora94|1994 paper]] on the [[System of polynomial equations#Algebraic representation of the solutions|shape lemma]] |
|||
* [[#mora94|1994 paper]] on [[commutative]] and non-commutative [[Gröbner bases]] |
|||
* [[#maranariMoellerMora96|1996 paper]] on [[multiplicities]] in [[polynomial system]]s |
|||
* [[#salaMora09|2009 book]] (co-editor and author of four chapters) on several aspects of [[Gröbner bases]] |
|||
* ''Solving Polynomial Equation Systems'': [[#mora03|2003 book-volume]] on [[Kronecker]] and [[Duval]] |
|||
* ''Solving Polynomial Equation Systems'': [[#mora05|2005 book-volume]] on [[Francis Sowerby Macaulay|Macaulay]] and [[Gröbner bases]] |
|||
* ''Solving Polynomial Equation Systems'': [[#mora16|2016 book-volume]] on the [[Buchberger algorithm]] |
|||
Mora is on the [[scientific peer review|managing-editorial-board]] of the journal ''[[Applicable Algebra in Engineering, Communication and Computing|AAECC]]'' published by [[Springer]],<ref>http://www.springer.com/computer/theoretical+computer+science/journal/200/PS2?detailsPage=editorialBoard</ref> and was also formerly an editor of the ''Bulletin of the [[Iranian Mathematical Society]]''.{{efn|http://www.disi.unige.it/person/MoraF/}} Mora co-chaired a 2008 conference at the [[University of Catania]] on [[differential algebra]].<ref>http://www.sci.ccny.cuny.edu/~ksda/darca.pdf</ref> |
|||
== See also == |
|||
* [[FGLM algorithm]], [[Buchberger's algorithm]] |
|||
* [[Gröbner fan]], [[Gröbner basis]] |
|||
* [[Algebraic geometry#Computational algebraic geometry]], [[System of polynomial equations]] |
|||
* [[Cinema of Italy]], per Mora's [[#mora77|1977 book]]: ''{{illm|Storia del cinema dell'orrore|it|Storia del cinema dell'orrore (saggio)}}'' |
|||
== References == |
== References == |
||
{{ |
{{reflist}} |
||
== Notes == |
|||
{{notelist}} |
|||
== Further reading == |
|||
* {{anchor|mora77}}<!-- 10 cites in scholar.google.com as of 2017-->{{cite book |
|||
|title= Storia del cinema dell'orrore |
|||
|author= Teo Mora |
|||
|date= 1977 <!-- and 1978 --> |
|||
|isbn= 88-347-0800-8 |
|||
|volume= 1 |
|||
|publisher= [[Fanucci]] |
|||
}}. Second and third volumes: {{ISBN|88-347-0850-4}}, {{ISBN|88-347-0897-0}}. Reprinted 2001. |
|||
* <!-- 3 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Computation of Finite Categories |
|||
|author= F. Mora |
|||
|date= 1979 |
|||
|publisher= University of Genova: unpublished note (Neubüser) |
|||
}}. Cited in e.g. [http://link.springer.com/chapter/10.1007/978-3-7091-7551-4_15 this paper]. |
|||
* {{anchor|mora82}}<!-- 119 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= An algorithm to compute the equations of tangent cones |
|||
|author= F. Mora |
|||
|work= Proc.EUROCAM'82: [[Lecture Notes in Computer Science]] (Computer algebra) |
|||
|volume= 144 |
|||
|pages= 158-165 |
|||
|date= 1982 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.springerlink.com/index/F4R7R80301521161.pdf |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Classification of monomial curves |
|||
|author= F. Mora |
|||
|date= 1983 |
|||
|pages= 13-28 |
|||
|volume= 101 |
|||
|publisher= Rendiconti [[:it:Accademia_Nazionale_delle_Scienze_detta_dei_XL|Accademia Nazionale dei XL]] |
|||
|issn= 0370-3460 <!-- correct? --> |
|||
}} |
|||
* <!-- 12 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= A constructive characterization of standard bases |
|||
|author= F. Mora |
|||
|date= 1983 |
|||
|pages= 41-50 |
|||
|publisher= Boll. UMI sez. D |
|||
|volume= 2 |
|||
|url= http://www.ricam.oeaw.ac.at/Groebner-Bases-Bibliography/details.php?details_id=1054 |
|||
}} |
|||
* <!-- 58 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The computation of the Hilbert function |
|||
|author= F. Mora, H.M. Moeller |
|||
|date= 1983 |
|||
|work= Proc.EUROCAL'83: [[Lecture Notes in Computer Science]] (Computer Algebra) |
|||
|volume= 162 |
|||
|pages= 157-167 |
|||
|publisher= [[Springer]] |
|||
|url= https://www.researchgate.net/profile/H_Moeller/publication/221521131_The_computation_of_the_Hilbert_function/links/569501a008ae425c68980fa0.pdf |
|||
|via= [http://www.springerlink.com/index/P050G874747NR583.pdf Publisher's site] |
|||
}} |
|||
* {{anchor|mora84}}<!-- 129 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Upper and lower bounds for the degree of Gröbner bases |
|||
|author= F. Mora, H.M. Möller |
|||
|date= 1984 |
|||
|work= Proc.EUROSAM'84: [[Lecture Notes in Computer Science]] |
|||
|volume= 174 |
|||
|pages= 172-183 |
|||
|publisher= [[Springer]] |
|||
|url= http://link.springer.com/content/pdf/10.1007/BFb0032840.pdf |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Polynomials of minimal degree and fixed period |
|||
|author= M.T. De Benedetti, F. Mora, G. Ucovich |
|||
|date= 1984 |
|||
|work= Proc.MIMI'84 |
|||
|pages= 170-172 |
|||
}} |
|||
* <!-- 9 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= An algorithmic approach to local rings |
|||
|author= F. Mora |
|||
|date= 1985 |
|||
|work= Proc.EUROCAL'85: [[Lecture Notes in Computer Science]] |
|||
|volume= 204 |
|||
|pages= 518-525 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.springerlink.com/index/p403q531977l55g2.pdf |
|||
}} |
|||
* {{anchor|mora85}}<!-- 211 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner bases for non-commutative polynomial rings |
|||
|author= F. Mora |
|||
|date= 1985 or 1986 |
|||
|work= Proc.AAECC3: [[Lecture Notes in Computer Science]] |
|||
|volume= 229 |
|||
|pages= 353-362 |
|||
|publisher= [[Springer]] |
|||
|url= http://link.springer.com/content/pdf/10.1007/3-540-16776-5_740.pdf |
|||
}} |
|||
* <!-- 15 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Computational aspects of reduction strategies to construct resolutions of monomial ideals |
|||
|author= H.M. Möller, F. Mora |
|||
|date= 1986 |
|||
|work= Proc.AAECC2: [[Lecture Notes in Computer Science]] |
|||
|volume= 228 |
|||
|pages= 182-197 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.springerlink.com/index/FW26H77227L84U1G.pdf |
|||
}} |
|||
* {{anchor|moellerMora86}}<!-- 204 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= New constructive methods in classical ideal theory |
|||
|author= H.M. Möller, F. Mora |
|||
|date= 1986 |
|||
|work= [[Journal of Algebra]] |
|||
|volume= 100 |
|||
|pages= 138-178 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.sciencedirect.com/science/article/pii/0021869386900712 |
|||
}} |
|||
* <!-- 2 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Symbolic and algebraic computation research in Italy |
|||
|author= P Gianni, A Miola, T Mora |
|||
|date= 1987 |
|||
|work= SIGSAM Bulletin |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|url= http://dl.acm.org/citation.cfm?id=24556 |
|||
}} |
|||
* <!-- 79 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Seven variations on standard bases |
|||
|author= Teo Mora |
|||
|date= 1988 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/7Variations.pdf.gz |
|||
|via= [http://www.ricam.oeaw.ac.at/Groebner-Bases-Bibliography/details.php?details_id=1082 Bibliography] |
|||
}} |
|||
* {{anchor|mora88}}<!--245 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The Gröbner fan of an ideal |
|||
|author1= Teo Mora |
|||
|author2= [[Lorenzo Robbiano]] |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|date= 1988 |
|||
|publisher= [[Elsevier]] |
|||
|volume= 6 |
|||
|pages= 183-208 |
|||
|url= http://www.sciencedirect.com/science/article/pii/S0747717188800427 |
|||
}} |
|||
** also in: {{cite book |
|||
|title=Computational Aspects of Commutative Algebra |
|||
|editor= Lorenzo Robbiano |
|||
|date= 1989 |
|||
|publisher=[[Academic Press]] |
|||
|volume= 6 |
|||
|number= 2-3 |
|||
|location= [[London]] |
|||
}} |
|||
* <!-- 4 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Constructive lifting in graded structures: a unified view of Buchberger and Hensel methods |
|||
|author= A. Miola, T. Mora |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|volume= 6 |
|||
|pages= 305-322 |
|||
|date= 1988 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.sciencedirect.com/science/article/pii/S0747717188800506 |
|||
}} |
|||
* <!-- 7 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Standard bases and non-noetherianity: non-commutative polynomial rings |
|||
|author= T. Mora |
|||
|date= 1988 |
|||
|work= Proc.AAECC4: [[Lecture Notes in Computer Science]] |
|||
|volume= 307 |
|||
|pages= 98-109 |
|||
|publisher= [[Springer]] |
|||
|url= http://link.springer.com/content/pdf/10.1007/BFb0039183.pdf |
|||
}} |
|||
* <!-- 9 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Computing with Algebraic Series |
|||
|author= M.E. Alonso, T. Mora, M. Raimondo |
|||
|date= 1989 |
|||
|work= Proc.ISSAC'89 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|pages= 101-111 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Portland.ps.gz |
|||
|via= [http://dl.acm.org/citation.cfm?id=74554 Publisher's site] |
|||
}} |
|||
* <!-- 66 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner bases in non-commutative algebras |
|||
|author= T. Mora |
|||
|date= 1989 |
|||
|work= Proc.ISSAC'88: [[Lecture Notes in Computer Science]] <!-- International Symposium on Symbolic and Algebraic [Computation] --> |
|||
|volume= 358 |
|||
|pages= 150-161 |
|||
|publisher= [[Springer]] |
|||
|url= https://pdfs.semanticscholar.org/a25c/fb7042f534ebf264c5e6a9f225d454899cf4.pdf |
|||
|via= [http://link.springer.com/content/pdf/10.1007/3-540-51084-2_14.pdf Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/Roma.ps.gz Author's site]. |
|||
}} |
|||
* {{anchor|gianniMora89}}<!-- 128 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Algebraic solution of systems of polynomial equations using Groebner bases |
|||
|author= P. Gianni, T. Mora |
|||
|date= 1989 |
|||
|work= AAECC5: [[Lecture Notes in Computer Science]] |
|||
|volume= 356 |
|||
|pages= 247-257 |
|||
|publisher= [[Springer]] |
|||
|url= https://www.researchgate.net/profile/Patrizia_Gianni/publication/221420468_Algebraic_Solution_of_Systems_of_Polynomial_Equations_Using_Groebner_Bases/links/0c960523988d67a2a8000000.pdf |
|||
|via= [http://www.springerlink.com/index/p6714g8321h38113.pdf Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/Minorca.ps.gz Author's site]. |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite book |
|||
|title= Proc.AAECC6: [[Lecture Notes in Computer Science]] |
|||
|editor= T. Mora |
|||
|date= July 10, 1989 |
|||
|publisher= [[Springer]] |
|||
|volume= 356 |
|||
|isbn= 9783540510833 |
|||
|location= [[Berlin]] and [[Heidelberg]] |
|||
}} |
|||
* <!-- 11to14 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Effective Methods in Algebraic Geometry |
|||
|editor= C. Traverso, T. Mora |
|||
|date= 1991 <!-- publication date... conference was held in April 1990 --> |
|||
|work= Proc.MEGA'90: Progress in Mathematics <!-- held in Castiglioncello --> |
|||
|publisher= Birkhauser |
|||
|url= https://books.google.com/books?id=4PHxBwAAQBAJ&pg=PR11 |
|||
|via= [ftp://ftp.risc.uni-linz.ac.at/pub/techreports/Admin/Stairs/mathlib-owner Austria] |
|||
}} |
|||
* <!-- 27 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Local decomposition algorithms |
|||
|author= M.E. Alonso, T. Mora, M. Raimondo |
|||
|work= Proc.AAECC8: [[Lecture Notes in Computer Science]] |
|||
|volume= 508 |
|||
|pages= 208-221 |
|||
|date= 1990 or 1991 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Tokyo.ps.gz |
|||
|via= [http://link.springer.com/content/pdf/10.1007/3-540-54195-0_52.pdf Publisher's site] |
|||
}} |
|||
* <!-- 15 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner bases and the word problem |
|||
|author= T. Mora |
|||
|date= 1987 or 1991 |
|||
|publisher= [[University of Genoa]] (preprint) |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Groebner_Word.ps.gz |
|||
}} |
|||
* <!-- 39 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner bases of ideals given by dual bases |
|||
|author= M.G. Marinari, H.M. Möller, T. Mora |
|||
|date= 1991 |
|||
|work= Proc.ISSAC'91 |
|||
|pages= 55-63 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Bonn.pdf |
|||
|via= [http://dl.acm.org/citation.cfm?id=120702 Publisher's site] |
|||
}} |
|||
* {{anchor|gioviniMora91}}<!-- 228 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= 'One sugar cube, please'; or: Selection strategies in Buchberger algorithm |
|||
|author= Alessandro Giovini, T. Mora, Gianfranco Niesi, Lorenzo Robbiano, Carlo Traverso |
|||
|date= 1991 |
|||
|work= Proc.ISSAC'91 |
|||
|pages= 49-54 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Sugar.ps.gz |
|||
|via= [http://dl.acm.org/citation.cfm?id=120701 Publisher's site] |
|||
}} |
|||
* <!-- 2 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= On the complexity of algebraic power series |
|||
|author= M.E. Alonso, T. Mora, M. Raimondo |
|||
|date= 1991 |
|||
|work= Proc.AAECC8: [[Lecture Notes in Computer Science]] |
|||
|volume= 508 |
|||
|pages= 197-207 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.dima.unige.it/~morafe/Comp.Serie.ps.gz |
|||
|via= [http://link.springer.com/content/pdf/10.1007/3-540-54195-0_51.pdf Publisher's site]. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.9258&rep=rep1&type=pdf CiteSeerX]. |
|||
}} |
|||
* <!-- 20 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= La queste del Saint Gra (AL): a computational approach to local algebra |
|||
|author= T. Mora |
|||
|date= 1991 |
|||
|work= Proc.AAECC7: [[Discrete Applied Mathematics (journal)|Discrete Applied Mathematics]] |
|||
|volume= 33 |
|||
|pages= 161-190 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Graal.ps.gz |
|||
|via= [http://www.sciencedirect.com/science/article/pii/0166218X9190114C Publisher's site] |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Proc. AAECC 7: Applied algebra, Algebraic algorithms, and Error-Correcting Codes |
|||
|editor= H. F. Mattson, T. Mora |
|||
|date= 1991 |
|||
|work= [[Discrete Applied Mathematics (journal)|Discrete Applied Mathematics]] |
|||
|volume= 33 |
|||
|publisher= [[Elsevier]] |
|||
}} |
|||
* <!-- 4 cites in scholar.google.com as of 2017-->{{cite book |
|||
|title= Proc. AAECC 9 |
|||
|editor= H. F. Mattson, T. Mora, T.R.N. Rao |
|||
|date= 1991 |
|||
|work= [[Lecture Notes in Computer Science]] |
|||
|volume= 539 |
|||
|publisher= [[Springer]] |
|||
|url= https://books.google.com/books?id=1yu5iVXYAEAC |
|||
}} |
|||
* {{anchor|moellerMora92}}<!-- 78 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner Bases Computation Using Syzygies |
|||
|author= H. M. Möller, T. Mora, C. Traverso |
|||
|date= 1992 |
|||
|work= Proc.ISSAC'92 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|url= https://www.researchgate.net/profile/H_Moeller/publication/221563982_Grobner_Bases_Computation_Using_Syzygies/links/54b943060cf253b50e2922ef.pdf |
|||
|via= [http://dl.acm.org/citation.cfm?id=143343 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/mmt.ps.gz Author's site]. |
|||
}} |
|||
* <!-- 11 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= An Algorithm for Computing Analytic Branches of Space Curves at Singular Points |
|||
|author= M.E.Alonso, G.Niesi, T.Mora, M.Raimondo |
|||
|date= 1992 |
|||
|work= Proc. 1992 Intl. Workshop on Math. Mechanization |
|||
|pages= 135-166 |
|||
|publisher= [[International Academic Publishers]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Bejing.ps.gz |
|||
|via= [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.8531&rep=rep1&type=pdf CiteSeerX] |
|||
}} |
|||
* <!-- 15 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Local Parameterization of Space Curves at Singular Points |
|||
|author= M. E. Alonso, T. Mora, G. Niesi, M. Raimondo |
|||
|date= 1992 |
|||
|work= [[Computer Graphics and Mathematics]] |
|||
|editor= B. Falcidieno, I. Herman, C. Pienovi |
|||
|series= Eurographic Seminar Series |
|||
|pages= 61-90 |
|||
|publisher= [[Springer]] |
|||
|url= https://pdfs.semanticscholar.org/54d7/822b3f235514ce0d3e6faa1eafa6a84f245b.pdf |
|||
|via= [http://link.springer.com/chapter/10.1007/978-3-642-77586-4_5 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/AMNR.ps.gz Author's site] |
|||
}} |
|||
* <!-- 25 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= A computational model for algebraic power series |
|||
|author= M. E. Alonso, T. Mora, M. Raimondo |
|||
|date= 1992 |
|||
|work= Journal of Pure and Applied Algebra |
|||
|volume= 77 |
|||
|pages= 1-38 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/JPAA.ps.gz |
|||
|via= [http://www.sciencedirect.com/science/article/pii/002240499290029F Publisher's site] |
|||
}} |
|||
* <!-- 51 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= An introduction to the tangent cone algorithm |
|||
|author= Gerhard Pfister, T.Mora, Carlo Traverso |
|||
|date= 1992 |
|||
|editor= Christoph M Hoffmann |
|||
|work= Issues in Robotics and Nonlinear Geometry (Advances in Computing Research) |
|||
|volume= 6 |
|||
|pages= 199-270 |
|||
|publisher= [[JAI Press]] |
|||
|location= [[Greenwich, Connecticut]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/TgCone.ps.gz |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The virtues of laziness: the complexity of the tangent cone algorithm |
|||
|author= Abdallah Assi, T. Mora |
|||
|date= 1993 |
|||
|work= J.AAECC |
|||
|volume= 4 |
|||
|number= 4 |
|||
|pages= 231-238 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/CompTGC.ps.gz |
|||
|via= [http://link.springer.com/article/10.1007/BF01200147 Publisher's site] |
|||
}} |
|||
* <!-- 12 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Points in affine and projective spaces |
|||
|author= T. Mora, L. Robbiano |
|||
|editor= D. Eisenbud, L. Robbiano |
|||
|date= 1993 |
|||
|work= Computational Algebraic Geometry and Commutative Algebra |
|||
|pages= 106-150 |
|||
|publisher= [[Cambridge University Press]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Cortona.ps.gz |
|||
|via= [https://www.researchgate.net/profile/Lorenzo_Robbiano/publication/265188690_POINTS_IN_AFFINE_AND_PROJECTIVE_SPACES/links/549168050cf222ada858a3c9.pdf ResearchGate] |
|||
}} |
|||
* {{anchor|marinariMoellerMora93}}<!-- 170 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner bases of ideals defined by functionals with an application to ideals of projective points |
|||
|author= M. G. Marinari, H. M. Möller, T. Mora |
|||
|date= 1993 |
|||
|work= J.AAECC4 |
|||
|pages= 103-145 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/M%5E3.ps.gz |
|||
|via= [http://link.springer.com/article/10.1007/BF01386834 Publisher's site] |
|||
}} |
|||
* {{anchor|fglm93}}<!-- 679 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Efficient computation of zero-dimensional Gröbner bases by change of ordering |
|||
|author= J. C. Faugere, P. Gianni, D. Lazard, T. Mora |
|||
|date= 1993 |
|||
|publisher= [[Elsevier]] |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|volume= 16 |
|||
|pages= 329-344 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/FGLM.ps.gz |
|||
|via= [http://www.sciencedirect.com/science/article/pii/S0747717183710515 Publisher's site]. [http://www.sciencedirect.com/science/article/pii/S0747717183710515/pdf?md5=96c9dfd7de57f6d6dc799a0c4552192d&pid=1-s2.0-S0747717183710515-main.pdf&_valck=1 Publisher's PDF]. |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Proc.AAECC10: Applied algebra, Algebraic algorithms and Error-Correcting Codes <!-- held in Puerto Rico --> |
|||
|editor= Gérard Cohen, Teo Mora, Oscar Moreno |
|||
|date= <!--May-->1993 |
|||
|work= [[Lecture Notes in Computer Science]] |
|||
|volume= 673 |
|||
|publisher= [[Springer Verlag]] |
|||
|url= http://cat.inist.fr/?aModele=afficheN&cpsidt=33546 |
|||
|via= [https://scholar.google.com/citations?view_op=view_citation&hl=en&user=CcOwSf8AAAAJ&cstart=200&pagesize=100&citation_for_view=CcOwSf8AAAAJ:5Ul4iDaHHb8C GoogleScholar] |
|||
}} |
|||
* <!-- 23 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion |
|||
|author= S. Licciardi, T. Mora |
|||
|date= 1994 |
|||
|work= Proc.ISSAC'94 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|pages= 191-196 |
|||
|url= https://pdfs.semanticscholar.org/275f/51c96154def6d95b79a660e89cfaee182789.pdf |
|||
|via= [http://dl.acm.org/citation.cfm?id=190416 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/oxford.ps.gz Author's site]. |
|||
}} |
|||
* {{anchor|beckerMora94}}<!-- 82 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The shape of the Shape Lemma |
|||
|author= E. Becker, T. Mora, M.G. Marinari, C. Traverso |
|||
|date= 1994 |
|||
|work= Proc.ISSAC'94 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|pages= 129-133 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/shape.ps.gz |
|||
|via= [http://dl.acm.org/citation.cfm?id=190382 Publisher's site]. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.618&rep=rep1&type=pdf CiteSeerX]. |
|||
}} |
|||
* <!-- 40 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Why you cannot even hope to use Gröbner bases in public key cryptography: an open letter to a scientist who failed and a challenge to those who have not yet failed |
|||
|author= Boo Barkee, D. C. Can, J. Ecks, T. Moriarty, R.F. Ree |
|||
|date= 1994 |
|||
|publisher= [[Elsevier]] |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|volume= 18 |
|||
|number= 6 |
|||
|pages= 497-501 |
|||
|url= https://pdfs.semanticscholar.org/dcb6/96529deb7c009568cc5520116c18c6bf1294.pdf |
|||
|via= [http://www.sciencedirect.com/science/article/pii/S0747717184710613 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/Crypto_Groebner.ps.gz Author's site]. |
|||
}} |
|||
* {{anchor|mora94}}<!-- 268 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= An introduction to commutative and non-commutative Gröbner bases |
|||
|author= T. Mora |
|||
|date= 1994 |
|||
|work= [[Theoretical Computer Science (journal)]] |
|||
|volume= 134 |
|||
|pages= 131-173 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Kyoto.ps.gz |
|||
|via= [http://www.sciencedirect.com/science/article/pii/0304397594902836 Publisher's site] |
|||
}} |
|||
* <!-- ~14 cites in citeseerx.ist.psu.edu as of 2017-->{{cite journal |
|||
|title= Polynomial System Solving, a Survey: EIDMA minicourse |
|||
|author= T. Mora |
|||
|date= 1994 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Solving.ps.gz |
|||
|via= http://citeseerx.ist.psu.edu/viewdoc/download?rep=rep1&type=pdf&doi=10.1.1.27.4308 |
|||
}} |
|||
* <!-- 22 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Hilbert functions and Buchberger algorithm |
|||
|author= Patrizia M Gianni, Ferdinando (Teo) Mora, Lorenzo Robbiano, Carlo Traverso |
|||
|date= 1994 |
|||
|publisher= preprint |
|||
|url= http://ricam.oeaw.ac.at/Groebner-Bases-Bibliography/details.php?details_id=1020 |
|||
}} |
|||
* <!-- 6 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= An algorithm for the Hilbert function of a primary ideal |
|||
|author= T. Mora, M. Evelina Rossi |
|||
|date= 1995 |
|||
|work= [[Communications in Algebra]] |
|||
|volume= 23 |
|||
|pages= 1899-1911 |
|||
|publisher= [[Taylor & Francis]] |
|||
|url= https://pdfs.semanticscholar.org/efc5/f80124c1cd89e022dc6124cab750c5edb106.pdf |
|||
|via= [http://www.tandfonline.com/doi/pdf/10.1080/00927879508825316 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/Hilbert_Graal.ps.gz Author's site]. |
|||
}} |
|||
* <!-- 34 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner Duality and Multiplicities in Polynomial System Solving |
|||
|author= M.G. Marinari, T. Mora, H.M. Möller |
|||
|date= 1995 |
|||
|work= Proc.ISSAC'95 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Mult_ISSAC.ps.gz |
|||
|via= [http://dl.acm.org/citation.cfm?id=220368 Publisher's site]. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.5655&rep=rep1&type=pdf CiteSeerX]. |
|||
}} |
|||
* <!-- 4 cites in scholar.google.com as of 2017-->{{cite book |
|||
|title= Proc. AAECC 11 |
|||
|editor= G. Cohen, M. Giusti, T. Mora |
|||
|date= 1995 |
|||
|work= [[Lecture Notes in Computer Science]] |
|||
|volume= 948 |
|||
|publisher= [[Springer]] |
|||
|url= https://books.google.com/books?id=ZPB51NDgRj0C |
|||
}} |
|||
* {{anchor|maranariMoellerMora96}}<!-- 79 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= On multiplicities in Polynomial System Solving |
|||
|author= M.G. Marinari, H.M. Möller, T. Mora |
|||
|date= 1996 |
|||
|volume= 348 |
|||
|number= 8 |
|||
|pages= 3283-3321 |
|||
|work= Transactions of the American Mathematical Society |
|||
|publisher= [[American Mathematical Society]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/tams.ps.gz |
|||
|via= [http://www.ams.org/tran/1996-348-08/S0002-9947-96-01671-6/ Publisher's site]. [http://www.ams.org/tran/1996-348-08/S0002-9947-96-01671-6/S0002-9947-96-01671-6.pdf Publisher's PDF]. |
|||
}} |
|||
* <!-- 6 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Groebner Duality and multiple points in linearly general position |
|||
|author= T. Mora |
|||
|date= 1997 |
|||
|work= Proceedings of the American Mathematical Society |
|||
|publisher= [[American Mathematical Society]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/pams.ps.gz |
|||
|via= [http://www.ams.org/proc/1997-125-05/S0002-9939-97-03713-1/ Publisher's site]. [http://www.ams.org/proc/1997-125-05/S0002-9939-97-03713-1/S0002-9939-97-03713-1.pdf Publisher's PDF]. |
|||
}} |
|||
* <!-- 0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= A Note on the Castelnuovo Theory |
|||
|author= T. Mora |
|||
|date= 1997 |
|||
|work= [[Communications in Algebra]] |
|||
|volume= 25 |
|||
|pages= 2342-2354 |
|||
|publisher= [[Taylor & Francis]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Scroll.ps.gz |
|||
|via= [http://www.tandfonline.com/doi/pdf/10.1080/00927879708825994 Publisher's site]. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.6477&rep=rep1&type=pdf CiteSeerX]. |
|||
}} |
|||
* <!-- 16 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The Non-Commutative Gröbner Freaks |
|||
|author= E. Green, T. Mora, V. Ufnarovski |
|||
|date= 1997 or 1998 |
|||
|work= Proc. Conf. on Symbolic Rewriting Techniques |
|||
|publisher= [[Birkhauser]]/[[Springer]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Freaks.ps.gz |
|||
|via= [http://link.springer.com/chapter/10.1007/978-3-0348-8800-4_5 Publisher's site]. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.1991&rep=rep1&type=pdf CiteSeerX]. |
|||
}} |
|||
* <!-- 2 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Proc. AAECC 12 |
|||
|editor= H. F. Mattson, T. Mora |
|||
|date= 1997 |
|||
|work= [[Lecture Notes in Computer Science]] |
|||
|volume= 1255 |
|||
|publisher= [[Springer]] |
|||
|url= https://books.google.com/books?id=Lke4daIYok8C |
|||
}} |
|||
* <!-- 20 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= A Note on Nielsen Reduction and Coset Enumeration |
|||
|author= Birgit Reinert, Klaus Madlener, T. Mora |
|||
|date= 1998 |
|||
|pages= 171-178 |
|||
|work= Proc.ISSAC'98 |
|||
|publisher= [[Association of Computing Machinery]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/RMM.ps.gz |
|||
|via= [http://dl.acm.org/citation.cfm?id=281607 Publisher's site]. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.72.6935&rep=rep1&type=pdf CiteSeerX]. |
|||
}} |
|||
* <!-- ~0 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= De Nugis Groebnerialium 1: Eagon, Northcott, Groebner |
|||
|author= T. Mora |
|||
|work= Groebner Bases and Applications |
|||
|series= London Math. Soc. Lecture Notes Series |
|||
|volume= 251 |
|||
|pages= 434-447 |
|||
|date= 1998 |
|||
|publisher= [[Cambridge University Press]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/NG1.ps.gz |
|||
|via= [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.7201&rep=rep1&type=pdf CiteSeerX] |
|||
}} |
|||
* <!-- 31 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting |
|||
|author= M. Borges-Trenard, M. Borges-Quintana, T. Mora |
|||
|date= 2000 |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|volume= 30 |
|||
|pages= 429-449 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/Borges.ps.gz |
|||
|via= [http://www.sciencedirect.com/science/article/pii/S0747717199904157 Publisher's site]. |
|||
}} |
|||
* <!-- 19 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem |
|||
|author= M.Caboara,T.Mora |
|||
|date= 2002 |
|||
|work= AAECC: J.Appl.Alg |
|||
|volume= 13 |
|||
|pages= 209-232 |
|||
|publisher= [[Springer]] |
|||
|url= https://www.researchgate.net/profile/Massimo_Caboara/publication/2842166_The_Chen-Reed-Helleseth-Truong_Decoding_Algorithm_and_the_Gianni-Kalkbrenner_Grbner_Shape_Theorem/links/0fcfd50a665923b3ea000000.pdf |
|||
|via= [http://link.springer.com/article/10.1007/s002000200097 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/codici.ps.gz Author's site]. |
|||
}} |
|||
* <!-- 3 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= ISSAC'02: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation <!-- held in Lille, France --> |
|||
|editor= T. Mora |
|||
|date= <!--July-->2002 |
|||
|publisher= [[Association of Computing Machinery]] Press |
|||
|location= [[New York]] |
|||
|volume= 193 |
|||
}} |
|||
* {{anchor|mora03}}<!-- 126 cites in scholar.google.com as of 2017 for the series -->{{cite book |
|||
|title= Solving Polynomial Equation Systems I: The Kronecker-Duval Philosophy |
|||
|author= Teo Mora |
|||
|isbn= 9780521811545 |
|||
|date= March 1, 2003 |
|||
|publisher= [[Cambridge University Press]] |
|||
|series= Encyclopedia of Mathematics and its Applications Series |
|||
|volume= 88 |
|||
|url= https://pdfs.semanticscholar.org/2a1b/a06e6d22c18caf539b7862d6e9c9d7b076ab.pdf |
|||
|via= [http://www.cambridge.org/ca/academic/subjects/mathematics/algebra/solving-polynomial-equation-systems-i-kronecker-duval-philosophy?format=HB&isbn=9780521811545 Publisher's website]. [http://www.langtoninfo.com/web_content/9780521811545_excerpt.pdf Excerpt]. [ftp://130.251.61.4/person/MoraF/ALTRO/1SPES.ps Draft]. |
|||
}} |
|||
* <!-- 1 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Oracle-supported drawing of the Groebner escalier |
|||
|author= M.E. Alonso, M.G. Marinari, T. Mora |
|||
|date= 2010 |
|||
|publisher= preprint |
|||
|url= https://arxiv.org/abs/1006.3297 |
|||
}} |
|||
* <!-- 19 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= A Remark on a remark by Macaualay, or, Enhancing Lazard Structural Theorem |
|||
|author= M.G. Marinari, T. Mora |
|||
|date= 2003 and 2011 |
|||
|publisher= Bulletin of the [[Iranian Mathematical Society]] |
|||
|volume= 29 |
|||
|number= 1 |
|||
|pages= 1-45 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/mora.pdf |
|||
|via= [http://bims.iranjournals.ir/article_125_53f274cb7be99bf28d6b74995295a863.pdf Publisher's site] |
|||
}} |
|||
* <!-- 9 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= De Nugis Groebnerialium 2: Applying Macaulay's Trick in order to easily write a Gröbner basis |
|||
|author= T. Mora |
|||
|date= 2003 |
|||
|work= J. AAECC 13 |
|||
|pages= 437-446 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.springerlink.com/index/36NXAKK618FC6WAR.pdf |
|||
|via= [http://link.springer.com/article/10.1007/s00200-002-0112-2 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/NG2y.ps.gz Author's site]. |
|||
}} |
|||
* <!-- 25 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= On the Gröbner bases of some symmetric systems and their application to Coding Theory |
|||
|author= T. Mora, Massimiliano Sala |
|||
|date= 2003 |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|volume= 35 |
|||
|pages= 177-194 |
|||
|publisher= [[Elsevier]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/sym.ps.gz |
|||
|via= [http://www.sciencedirect.com/science/article/pii/S0747717102001311 Publisher's site] |
|||
}} |
|||
* <!-- 24 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The Big Mother of All the Dualities, I: Möller Algorithm |
|||
|author= M.E. Alonso, M.G. Marinari, M.T. Mora |
|||
|work= [[Communications in Algebra]] |
|||
|date= 2003 |
|||
|volume= 31 |
|||
|pages= 783-818 |
|||
|publisher= [[Taylor & Francis]] |
|||
|url= https://www.researchgate.net/profile/Mariemi_Alonso/publication/2656876_The_Big_Mother_of_All_the_Dualities_Mller_Algorithm/links/55a757bb08aeb4e8e646e270.pdf |
|||
|via= [https://tandfonline.com/doi/abs/10.1081/AGB-120017343 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/3Marie.ps.gz Author's site]. |
|||
}} |
|||
* {{anchor|mora2005}}<!-- 126 cites in scholar.google.com as of 2017 for the series -->{{cite book |
|||
|title= Solving Polynomial Equation Systems II: Macaulay's Paradigm and Groebner Technology |
|||
|author= T. Mora |
|||
|date= 2005 |
|||
|publisher= [[Cambridge University Press]] |
|||
|series= Encyclopedia of Mathematics and its Applications |
|||
|volume= 99 |
|||
}} |
|||
* <!-- 26 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= General error locator polynomials for binary cyclic codes with t <= 2 and n < 63 |
|||
|author= T. Mora, E. Orsini, Massimiliano Sala |
|||
|date= 2006 |
|||
|publisher= Boole Centre (BCRI), [[University College Cork]] |
|||
|location= Ireland |
|||
|volume= 43 |
|||
|url= http://www.bcri.ucc.ie/FILES/PUBS/BCRI_44.pdf |
|||
|via= [http://www.bcri.ucc.ie/index.php?option=com_content&view=article&id=18&Itemid=6 Publisher's site]. [http://www.dima.unige.it/~morafe/PUBLICATIONS/BCRI_44.pdf Author's site]. |
|||
}} |
|||
* <!-- 8 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The Big Mother of All the Dualities, II: Macaulay Bases |
|||
|author= Maria Emilia Alonso, Maria Grazia Marinari, T. Mora |
|||
|date= 2006 |
|||
|work= J. AAECC |
|||
|volume= 17 |
|||
|pages= 409-451 |
|||
|publisher= [[Springer]] |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/mo4.pdf |
|||
|via= [http://www.springerlink.com/index/66481GJ571721120.pdf Publisher's site] |
|||
}} |
|||
* <!-- 11 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Cerlienco-Mureddu Correspondence and Lazard Structural Theorem |
|||
|author= M. G. Marinari, T. Mora |
|||
|date= 2006 |
|||
|work= Investigaciones Mathematicas/Operacional |
|||
|volume= 27 |
|||
|pages= 155-178 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/cubastampa.pdf |
|||
}} |
|||
* {{anchor|salaMora09}}<!-- see also 3 more chapters below --><!-- 14 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Gröbner bases over commutative rings and applications to coding theory |
|||
|author= Eimear Byrne, T. Mora |
|||
|pages= 239-262 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/BMG13.pdf |
|||
|work= Gröbner Bases, Coding, and Cryptography |
|||
|editor= Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso |
|||
|date= 2009 |
|||
|publisher= [[Springer]] |
|||
|isbn= 9783540938057 |
|||
|doi= 10.1007/978-3-540-93806-4 |
|||
|via= [https://www.researchgate.net/profile/Eimear_Byrne/publication/226194750_Grobner_Bases_over_Commutative_Rings_and_Applications_to_Coding_Theory/links/00b7d51a38bb6b2efe000000.pdf ResearchGate]. [https://books.google.com/books?isbn=3540938060 GoogleBooks]. [http://link.springer.com/chapter/10.1007/978-3-540-93806-4_14 Publisher's site]. |
|||
}} |
|||
* <!-- 13 cites in scholar.google.com as of 2017-->{{cite book |
|||
|title= Decoding cyclic codes: the Cooper Philosophy |
|||
|author= T. Mora, Emmanuela Orsini |
|||
|pages= 62-92 |
|||
|url= http://fermat.dima.unige.it/~morafe/PUBLICATIONS/CooperNew.pdf |
|||
|work= Gröbner Bases, Coding, and Cryptography |
|||
|editor= Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso |
|||
|date= 2009 |
|||
|publisher= [[Springer]] |
|||
|isbn= 9783540938057 |
|||
|doi= 10.1007/978-3-540-93806-4 |
|||
|via= [https://books.google.com/books?isbn=3540938060 GoogleBooks]. [http://link.springer.com/content/pdf/10.1007/978-3-540-93806-4_5.pdf Publisher's site]. |
|||
}} |
|||
* <!-- 12 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Groebner Technology |
|||
|author= T. Mora |
|||
|pages= 11-26 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/GrobTech.pdf |
|||
|work= Gröbner Bases, Coding, and Cryptography |
|||
|editor= Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso |
|||
|date= 2009 |
|||
|publisher= [[Springer]] |
|||
|isbn= 9783540938057 |
|||
|doi= 10.1007/978-3-540-93806-4 |
|||
|via= [https://books.google.com/books?isbn=3540938060 GoogleBooks]. [http://link.springer.com/chapter/10.1007/978-3-540-93806-4_2 Publisher's site]. |
|||
}} |
|||
* <!-- 6 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= The FGLM Problem and Moeller's Algorithm on Zero-dimensional Ideals |
|||
|author= T. Mora |
|||
|pages= 27-46 |
|||
|url= http://www.dima.unige.it/~morafe/PUBLICATIONS/LinzPunti.pdf |
|||
|work= Gröbner Bases, Coding, and Cryptography |
|||
|editor= Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso |
|||
|date= 2009 |
|||
|publisher= [[Springer]] |
|||
|isbn= 9783540938057 |
|||
|doi= 10.1007/978-3-540-93806-4 |
|||
|via= [https://books.google.com/books?isbn=3540938060 GoogleBooks]. [http://link.springer.com/content/pdf/10.1007/978-3-540-93806-4_3.pdf Publisher's site]. |
|||
}} |
|||
* <!-- 6 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Term-ordering free involutive bases |
|||
|author= Michela Ceria, T Mora, Margherita Roggero |
|||
|work= [[Journal of Symbolic Computation]] |
|||
|date= 2015 |
|||
|publisher= [[Elsevier]] |
|||
|url= https://arxiv.org/pdf/1310.0916 |
|||
|via= [https://www.sciencedirect.com/science/article/pii/S074771711400073X Publisher's site]. |
|||
}} |
|||
* <!-- 4 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= A primer on ideal theoretical operation in non-commutative polynomial rings |
|||
|author= T Mora |
|||
|date= 2015 |
|||
|publisher= [[World Scientific]] |
|||
|work= Journal of Algebra and Its Applications |
|||
|url= http://www.worldscientific.com/doi/pdf/10.1142/S0219498815500188 |
|||
}} |
|||
* {{anchor|mora16}}<!-- 126 cites in scholar.google.com as of 2017 for the series-->{{cite book |
|||
|title= Solving Polynomial Equation Systems IV: Buchberger Theory and Beyond |
|||
|author= T Mora |
|||
|date= 2016 |
|||
|publisher= [[Cambridge University Press]] |
|||
|series= Encyclopedia of Mathematics and its Applications |
|||
|volume= 158 |
|||
|url= https://books.google.com/books?id=3O-7CwAAQBAJ |
|||
}} |
|||
* <!-- 3 cites in scholar.google.com as of 2017-->{{cite journal |
|||
|title= Buchberger–Zacharias theory of multivariate ore extensions |
|||
|author= Michela Ceria, T Mora |
|||
|date= 2017 |
|||
|work= Journal of Pure and Applied Algebra |
|||
|publisher= [[Elsevier]] |
|||
|url= http://arxiv.org/pdf/1701.01899 |
|||
|via= [http://www.sciencedirect.com/science/article/pii/S0022404917300361 Publisher's site]. |
|||
}} |
|||
[[Category:Italian mathematicians]] |
[[Category:Italian mathematicians]] |
Revision as of 21:41, 5 April 2017
An editor has nominated this article for deletion. You are welcome to participate in the deletion discussion, which will decide whether or not to retain it. |
Ferdinando 'Teo' Mora[a] is an Italian mathematician, and since 1990,[1] a professor of algebra at the University of Genoa.[b]
Life and work
Mora's degree is in mathematics from the University of Genoa in 1974.[1] Mora's publications span forty years; his best-cited[c] works thus far:
- 1982 paper on tangent cones
- 1984 paper on Gröbner bases and bounding the degree thereof
- 1985 paper on Gröbner bases and non-commutative polynomial rings
- 1986 paper on ideal theory methods
- 1988 paper on the Gröbner fan
- 1989 paper on Gröbner bases and systems of polynomial equations
- 1991 paper on Buchberger algorithm selection-strategies
- 1992 paper on Gröbner bases and syzygies
- 1993 paper on Gröbner bases and projective points
- 1993 paper on computing Gröbner bases using the FGLM algorithm (named for Mora and his co-authors)
- 1994 paper on the shape lemma
- 1994 paper on commutative and non-commutative Gröbner bases
- 1996 paper on multiplicities in polynomial systems
- 2009 book (co-editor and author of four chapters) on several aspects of Gröbner bases
- Solving Polynomial Equation Systems: 2003 book-volume on Kronecker and Duval
- Solving Polynomial Equation Systems: 2005 book-volume on Macaulay and Gröbner bases
- Solving Polynomial Equation Systems: 2016 book-volume on the Buchberger algorithm
Mora is on the managing-editorial-board of the journal AAECC published by Springer,[2] and was also formerly an editor of the Bulletin of the Iranian Mathematical Society.[d] Mora co-chaired a 2008 conference at the University of Catania on differential algebra.[3]
See also
- FGLM algorithm, Buchberger's algorithm
- Gröbner fan, Gröbner basis
- Algebraic geometry#Computational algebraic geometry, System of polynomial equations
- Cinema of Italy, per Mora's 1977 book: Storia del cinema dell'orrore
References
Notes
- ^ Teo Mora is his nickname, but used in most of his post-1980s publications; he has also used the pen name Theo Moriarty.[1]
- ^ Currently in the Dipartimento di Matematica,[1] formerly[when?] in the Dipartimento di Informatica e Scienze dell'Informazione.[1]
- ^ https://scholar.google.com/scholar?q=%28%22Teo+Mora%22+OR+%22Ferdinando+Mora%22%29&as_sdt=1%2C44
- ^ http://www.disi.unige.it/person/MoraF/
Further reading
- Teo Mora (1977). Storia del cinema dell'orrore. Vol. 1. Fanucci. ISBN 88-347-0800-8.. Second and third volumes: ISBN 88-347-0850-4, ISBN 88-347-0897-0. Reprinted 2001.
- F. Mora (1979). "Computation of Finite Categories". University of Genova: unpublished note (Neubüser).
{{cite journal}}
: Cite journal requires|journal=
(help). Cited in e.g. this paper. - F. Mora (1982). "An algorithm to compute the equations of tangent cones" (PDF). Proc.EUROCAM'82: Lecture Notes in Computer Science (Computer algebra). 144. Springer: 158–165.
- F. Mora (1983). "Classification of monomial curves". 101. Rendiconti Accademia Nazionale dei XL: 13–28. ISSN 0370-3460.
{{cite journal}}
: Cite journal requires|journal=
(help) - F. Mora (1983). "A constructive characterization of standard bases". 2. Boll. UMI sez. D: 41–50.
{{cite journal}}
: Cite journal requires|journal=
(help) - F. Mora, H.M. Moeller (1983). "The computation of the Hilbert function" (PDF). Proc.EUROCAL'83: Lecture Notes in Computer Science (Computer Algebra). 162. Springer: 157–167 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- F. Mora, H.M. Möller (1984). "Upper and lower bounds for the degree of Gröbner bases" (PDF). Proc.EUROSAM'84: Lecture Notes in Computer Science. 174. Springer: 172–183.
- M.T. De Benedetti, F. Mora, G. Ucovich (1984). "Polynomials of minimal degree and fixed period". Proc.MIMI'84: 170–172.
{{cite journal}}
: CS1 maint: multiple names: authors list (link) - F. Mora (1985). "An algorithmic approach to local rings" (PDF). Proc.EUROCAL'85: Lecture Notes in Computer Science. 204. Springer: 518–525.
- F. Mora (1985 or 1986). "Gröbner bases for non-commutative polynomial rings" (PDF). Proc.AAECC3: Lecture Notes in Computer Science. 229. Springer: 353–362.
{{cite journal}}
: Check date values in:|date=
(help) - H.M. Möller, F. Mora (1986). "Computational aspects of reduction strategies to construct resolutions of monomial ideals" (PDF). Proc.AAECC2: Lecture Notes in Computer Science. 228. Springer: 182–197.
- H.M. Möller, F. Mora (1986). "New constructive methods in classical ideal theory". Journal of Algebra. 100. Elsevier: 138–178.
- P Gianni, A Miola, T Mora (1987). "Symbolic and algebraic computation research in Italy". SIGSAM Bulletin. Association of Computing Machinery.
{{cite journal}}
: CS1 maint: multiple names: authors list (link) - Teo Mora (1988). "Seven variations on standard bases" – via Bibliography.
{{cite journal}}
: Cite journal requires|journal=
(help); External link in
(help)|via=
- Teo Mora; Lorenzo Robbiano (1988). "The Gröbner fan of an ideal". Journal of Symbolic Computation. 6. Elsevier: 183–208.
- also in: Lorenzo Robbiano, ed. (1989). Computational Aspects of Commutative Algebra. Vol. 6. London: Academic Press.
- A. Miola, T. Mora (1988). "Constructive lifting in graded structures: a unified view of Buchberger and Hensel methods". Journal of Symbolic Computation. 6. Elsevier: 305–322.
- T. Mora (1988). "Standard bases and non-noetherianity: non-commutative polynomial rings" (PDF). Proc.AAECC4: Lecture Notes in Computer Science. 307. Springer: 98–109.
- M.E. Alonso, T. Mora, M. Raimondo (1989). "Computing with Algebraic Series". Proc.ISSAC'89. Association of Computing Machinery: 101–111 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1989). "Gröbner bases in non-commutative algebras" (PDF). Proc.ISSAC'88: Lecture Notes in Computer Science. 358. Springer: 150–161 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- P. Gianni, T. Mora (1989). "Algebraic solution of systems of polynomial equations using Groebner bases" (PDF). AAECC5: Lecture Notes in Computer Science. 356. Springer: 247–257 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- T. Mora, ed. (July 10, 1989). Proc.AAECC6: Lecture Notes in Computer Science. Vol. 356. Berlin and Heidelberg: Springer. ISBN 9783540510833.
- C. Traverso, T. Mora, ed. (1991). "Effective Methods in Algebraic Geometry". Proc.MEGA'90: Progress in Mathematics. Birkhauser – via Austria.
{{cite journal}}
: External link in
(help)|via=
- M.E. Alonso, T. Mora, M. Raimondo (1990 or 1991). "Local decomposition algorithms". Proc.AAECC8: Lecture Notes in Computer Science. 508. Springer: 208–221 – via Publisher's site.
{{cite journal}}
: Check date values in:|date=
(help); External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1987 or 1991). "Gröbner bases and the word problem". University of Genoa (preprint).
{{cite journal}}
: Check date values in:|date=
(help); Cite journal requires|journal=
(help) - M.G. Marinari, H.M. Möller, T. Mora (1991). "Gröbner bases of ideals given by dual bases" (PDF). Proc.ISSAC'91. Association of Computing Machinery: 55–63 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Alessandro Giovini, T. Mora, Gianfranco Niesi, Lorenzo Robbiano, Carlo Traverso (1991). "'One sugar cube, please'; or: Selection strategies in Buchberger algorithm". Proc.ISSAC'91. Association of Computing Machinery: 49–54 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M.E. Alonso, T. Mora, M. Raimondo (1991). "On the complexity of algebraic power series". Proc.AAECC8: Lecture Notes in Computer Science. 508. Springer: 197–207 – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1991). "La queste del Saint Gra (AL): a computational approach to local algebra". Proc.AAECC7: Discrete Applied Mathematics. 33. Elsevier: 161–190 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- H. F. Mattson, T. Mora, ed. (1991). "Proc. AAECC 7: Applied algebra, Algebraic algorithms, and Error-Correcting Codes". Discrete Applied Mathematics. 33. Elsevier.
- H. F. Mattson, T. Mora, T.R.N. Rao, ed. (1991). Proc. AAECC 9. Vol. 539. Springer.
{{cite book}}
:|work=
ignored (help)CS1 maint: multiple names: editors list (link) - H. M. Möller, T. Mora, C. Traverso (1992). "Gröbner Bases Computation Using Syzygies" (PDF). Proc.ISSAC'92. Association of Computing Machinery – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M.E.Alonso, G.Niesi, T.Mora, M.Raimondo (1992). "An Algorithm for Computing Analytic Branches of Space Curves at Singular Points". Proc. 1992 Intl. Workshop on Math. Mechanization. International Academic Publishers: 135–166 – via CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M. E. Alonso, T. Mora, G. Niesi, M. Raimondo (1992). B. Falcidieno, I. Herman, C. Pienovi (ed.). "Local Parameterization of Space Curves at Singular Points" (PDF). Computer Graphics and Mathematics. Eurographic Seminar Series. Springer: 61–90 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M. E. Alonso, T. Mora, M. Raimondo (1992). "A computational model for algebraic power series". Journal of Pure and Applied Algebra. 77. Elsevier: 1–38 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Gerhard Pfister, T.Mora, Carlo Traverso (1992). Christoph M Hoffmann (ed.). "An introduction to the tangent cone algorithm". Issues in Robotics and Nonlinear Geometry (Advances in Computing Research). 6. Greenwich, Connecticut: JAI Press: 199–270.
{{cite journal}}
: CS1 maint: multiple names: authors list (link) - Abdallah Assi, T. Mora (1993). "The virtues of laziness: the complexity of the tangent cone algorithm". J.AAECC. 4 (4). Springer: 231–238 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- T. Mora, L. Robbiano (1993). D. Eisenbud, L. Robbiano (ed.). "Points in affine and projective spaces". Computational Algebraic Geometry and Commutative Algebra. Cambridge University Press: 106–150 – via ResearchGate.
{{cite journal}}
: External link in
(help)|via=
- M. G. Marinari, H. M. Möller, T. Mora (1993). "Gröbner bases of ideals defined by functionals with an application to ideals of projective points". J.AAECC4. Springer: 103–145 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- J. C. Faugere, P. Gianni, D. Lazard, T. Mora (1993). "Efficient computation of zero-dimensional Gröbner bases by change of ordering". Journal of Symbolic Computation. 16. Elsevier: 329–344 – via Publisher's site. Publisher's PDF.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Gérard Cohen, Teo Mora, Oscar Moreno, ed. (1993). "Proc.AAECC10: Applied algebra, Algebraic algorithms and Error-Correcting Codes". Lecture Notes in Computer Science. 673. Springer Verlag – via GoogleScholar.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- S. Licciardi, T. Mora (1994). "Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion" (PDF). Proc.ISSAC'94. Association of Computing Machinery: 191–196 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- E. Becker, T. Mora, M.G. Marinari, C. Traverso (1994). "The shape of the Shape Lemma". Proc.ISSAC'94. Association of Computing Machinery: 129–133 – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Boo Barkee, D. C. Can, J. Ecks, T. Moriarty, R.F. Ree (1994). "Why you cannot even hope to use Gröbner bases in public key cryptography: an open letter to a scientist who failed and a challenge to those who have not yet failed" (PDF). Journal of Symbolic Computation. 18 (6). Elsevier: 497–501 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1994). "An introduction to commutative and non-commutative Gröbner bases". Theoretical Computer Science (journal). 134. Elsevier: 131–173 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- T. Mora (1994). "Polynomial System Solving, a Survey: EIDMA minicourse" – via http://citeseerx.ist.psu.edu/viewdoc/download?rep=rep1&type=pdf&doi=10.1.1.27.4308.
{{cite journal}}
: Cite journal requires|journal=
(help); External link in
(help)|via=
- Patrizia M Gianni, Ferdinando (Teo) Mora, Lorenzo Robbiano, Carlo Traverso (1994). "Hilbert functions and Buchberger algorithm". preprint.
{{cite journal}}
: Cite journal requires|journal=
(help)CS1 maint: multiple names: authors list (link) - T. Mora, M. Evelina Rossi (1995). "An algorithm for the Hilbert function of a primary ideal" (PDF). Communications in Algebra. 23. Taylor & Francis: 1899–1911 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- M.G. Marinari, T. Mora, H.M. Möller (1995). "Gröbner Duality and Multiplicities in Polynomial System Solving". Proc.ISSAC'95. Association of Computing Machinery – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- G. Cohen, M. Giusti, T. Mora, ed. (1995). Proc. AAECC 11. Vol. 948. Springer.
{{cite book}}
:|work=
ignored (help)CS1 maint: multiple names: editors list (link) - M.G. Marinari, H.M. Möller, T. Mora (1996). "On multiplicities in Polynomial System Solving". Transactions of the American Mathematical Society. 348 (8). American Mathematical Society: 3283–3321 – via Publisher's site. Publisher's PDF.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1997). "Groebner Duality and multiple points in linearly general position". Proceedings of the American Mathematical Society. American Mathematical Society – via Publisher's site. Publisher's PDF.
{{cite journal}}
: External link in
(help)|via=
- T. Mora (1997). "A Note on the Castelnuovo Theory". Communications in Algebra. 25. Taylor & Francis: 2342–2354 – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)|via=
- E. Green, T. Mora, V. Ufnarovski (1997 or 1998). "The Non-Commutative Gröbner Freaks". Proc. Conf. on Symbolic Rewriting Techniques. Birkhauser/Springer – via Publisher's site. CiteSeerX.
{{cite journal}}
: Check date values in:|date=
(help); External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- H. F. Mattson, T. Mora, ed. (1997). "Proc. AAECC 12". Lecture Notes in Computer Science. 1255. Springer.
- Birgit Reinert, Klaus Madlener, T. Mora (1998). "A Note on Nielsen Reduction and Coset Enumeration". Proc.ISSAC'98. Association of Computing Machinery: 171–178 – via Publisher's site. CiteSeerX.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (1998). "De Nugis Groebnerialium 1: Eagon, Northcott, Groebner". Groebner Bases and Applications. London Math. Soc. Lecture Notes Series. 251. Cambridge University Press: 434–447 – via CiteSeerX.
{{cite journal}}
: External link in
(help)|via=
- M. Borges-Trenard, M. Borges-Quintana, T. Mora (2000). "Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting". Journal of Symbolic Computation. 30. Elsevier: 429–449 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M.Caboara,T.Mora (2002). "The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem" (PDF). AAECC: J.Appl.Alg. 13. Springer: 209–232 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- T. Mora, ed. (2002). "ISSAC'02: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation". 193. New York: Association of Computing Machinery Press.
{{cite journal}}
: Cite journal requires|journal=
(help) - Teo Mora (March 1, 2003). Solving Polynomial Equation Systems I: The Kronecker-Duval Philosophy (PDF). Encyclopedia of Mathematics and its Applications Series. Vol. 88. Cambridge University Press. ISBN 9780521811545 – via Publisher's website. Excerpt. Draft.
{{cite book}}
: External link in
(help)|via=
- M.E. Alonso, M.G. Marinari, T. Mora (2010). "Oracle-supported drawing of the Groebner escalier". preprint.
{{cite journal}}
: Cite journal requires|journal=
(help)CS1 maint: multiple names: authors list (link) - M.G. Marinari, T. Mora (2003 and 2011). "A Remark on a remark by Macaualay, or, Enhancing Lazard Structural Theorem" (PDF). 29 (1). Bulletin of the Iranian Mathematical Society: 1–45 – via Publisher's site.
{{cite journal}}
: Check date values in:|date=
(help); Cite journal requires|journal=
(help); External link in
(help)|via=
- T. Mora (2003). "De Nugis Groebnerialium 2: Applying Macaulay's Trick in order to easily write a Gröbner basis" (PDF). J. AAECC 13. Springer: 437–446 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)|via=
- T. Mora, Massimiliano Sala (2003). "On the Gröbner bases of some symmetric systems and their application to Coding Theory". Journal of Symbolic Computation. 35. Elsevier: 177–194 – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=
- M.E. Alonso, M.G. Marinari, M.T. Mora (2003). "The Big Mother of All the Dualities, I: Möller Algorithm" (PDF). Communications in Algebra. 31. Taylor & Francis: 783–818 – via Publisher's site. Author's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T. Mora (2005). Solving Polynomial Equation Systems II: Macaulay's Paradigm and Groebner Technology. Encyclopedia of Mathematics and its Applications. Vol. 99. Cambridge University Press.
- T. Mora, E. Orsini, Massimiliano Sala (2006). "General error locator polynomials for binary cyclic codes with t <= 2 and n < 63" (PDF). 43. Ireland: Boole Centre (BCRI), University College Cork – via Publisher's site. Author's site.
{{cite journal}}
: Cite journal requires|journal=
(help); External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- Maria Emilia Alonso, Maria Grazia Marinari, T. Mora (2006). "The Big Mother of All the Dualities, II: Macaulay Bases" (PDF). J. AAECC. 17. Springer: 409–451 – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- M. G. Marinari, T. Mora (2006). "Cerlienco-Mureddu Correspondence and Lazard Structural Theorem" (PDF). Investigaciones Mathematicas/Operacional. 27: 155–178.
- Eimear Byrne, T. Mora (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). "Gröbner bases over commutative rings and applications to coding theory" (PDF). Gröbner Bases, Coding, and Cryptography. Springer: 239–262. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via ResearchGate. GoogleBooks. Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T. Mora, Emmanuela Orsini (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). Decoding cyclic codes: the Cooper Philosophy (PDF). Springer. pp. 62–92. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via GoogleBooks. Publisher's site.
{{cite book}}
:|work=
ignored (help); External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T. Mora (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). "Groebner Technology" (PDF). Gröbner Bases, Coding, and Cryptography. Springer: 11–26. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via GoogleBooks. Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- T. Mora (2009). Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, Carlo Traverso (ed.). "The FGLM Problem and Moeller's Algorithm on Zero-dimensional Ideals" (PDF). Gröbner Bases, Coding, and Cryptography. Springer: 27–46. doi:10.1007/978-3-540-93806-4. ISBN 9783540938057 – via GoogleBooks. Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: editors list (link)|via=
- Michela Ceria, T Mora, Margherita Roggero (2015). "Term-ordering free involutive bases". Journal of Symbolic Computation. Elsevier – via Publisher's site.
{{cite journal}}
: External link in
(help)CS1 maint: multiple names: authors list (link)|via=
- T Mora (2015). "A primer on ideal theoretical operation in non-commutative polynomial rings". Journal of Algebra and Its Applications. World Scientific.
- T Mora (2016). Solving Polynomial Equation Systems IV: Buchberger Theory and Beyond. Encyclopedia of Mathematics and its Applications. Vol. 158. Cambridge University Press.
- Michela Ceria, T Mora (2017). "Buchberger–Zacharias theory of multivariate ore extensions". Journal of Pure and Applied Algebra. Elsevier – via Publisher's site.
{{cite journal}}
: External link in
(help)|via=