{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T17:53:44Z","timestamp":1720893224685},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6225,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00090-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"69-92","source":"Crossref","is-referenced-by-count":8,"title":["Algorithmes de calcul de la r\u00e9duction de Hermite d'une matrice \u00e0 coefficients polynomiaux"],"prefix":"10.1016","volume":"161","author":[{"given":"Salah","family":"Labhalla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri","family":"Lombardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Marlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00090-9_BIB1","first-page":"565","article-title":"Sylvester's identity and multistep integer-preserving Gaussian elimination","volume":"22","author":"Bareiss","year":"1968","journal-title":"Math. Comp."},{"issue":"3","key":"10.1016\/0304-3975(95)00090-9_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","article-title":"On computing the determinant in small parallel time using a small number of processors","volume":"18","author":"Berkovitz","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00090-9_BIB3","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0211057","article-title":"Algorithms for the solution of systems of linear diophantine equations","volume":"11","author":"Chou","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00090-9_BIB4","series-title":"Symbolic and Algebraic Computaton (ISSAC 88)","first-page":"440","article-title":"Algebraic extensions and algebraic closure in Scratchpad","volume":"Vol. 358","author":"Dicrescenzo","year":"1989"},{"key":"10.1016\/0304-3975(95)00090-9_BIB5","series-title":"Proc. Eurocal '85","first-page":"289","article-title":"About a new method for computing in algebraic number fields","volume":"Vol. 204","author":"Dora","year":"1985"},{"key":"10.1016\/0304-3975(95)00090-9_BIB6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.12.1.50","article-title":"Hermite normal form computation using modulo determinant arithmetic","volume":"12","author":"Domich","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0304-3975(95)00090-9_BIB7","first-page":"1165","article-title":"An application of modular arithmetic to the construction of algorithms solving systems of linear equations","volume":"17","author":"Frumkin","year":"1976","journal-title":"Soviet. Math. Dokl."},{"key":"10.1016\/0304-3975(95)00090-9_BIB8","series-title":"Fundamentals of Computation Theory","first-page":"386","article-title":"Polynomial time algorithms in the theory of linear diophantine equations","volume":"Vol. 56","author":"Frumkin","year":"1977"},{"key":"10.1016\/0304-3975(95)00090-9_BIB9","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/BF02104748","article-title":"Complexity questions in number theory","volume":"29","author":"Frumkin","year":"1985","journal-title":"J. Soviet. Math."},{"key":"10.1016\/0304-3975(95)00090-9_BIB10_1","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1051\/ita\/1990240605611","article-title":"Sp\u00e9cialisation de la suite de Sturm et sousr\u00e9sultants. 1","volume":"24","author":"Gonzalez","year":"1990","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(95)00090-9_BIB10_2","author":"Gonzalez","year":"1989","journal-title":"CALSYF journ\u00e9es du GRECO de Calcul Formel"},{"key":"10.1016\/0304-3975(95)00090-9_BIB11","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/0220067","article-title":"Asymptotically fast triangularization of matrices over rings","volume":"20","author":"Hafner","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00090-9_BIB12","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0218045","article-title":"Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrice","volume":"18","author":"Iliopoulos","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00090-9_BIB13","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/0218046","article-title":"Worst-case complexity bounds on algorithms for computing the canonical structure of infinite abelian groups and solving systems of linear diophantine equations","volume":"18","author":"Iliopoulos","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00090-9_BIB14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(85)90131-8","article-title":"Solving systems of linear equations over polynomials","volume":"39","author":"Kannan","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00090-9_BIB15","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00090-9_BIB16","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/0608057","article-title":"Fast parallel computation of Hermite and Smith normal forms of polynomial matrices","volume":"8","author":"Kaltofen","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(95)00090-9_BIB17","unstructured":"H. Lombard, Sous-r\u00e9sultants, suite de Sturm, sp\u00e9cialisation, 2\u00e8me partie de la th\u00e8se soutenue en juin 89 \u00e0 Nice. R\u00e9impression: Publications Math\u00e9matiques de l'Universit\u00e9 (Besan\u00e7on) 88\u201389. Th\u00e9orie des Nombres. Fascicule 2."},{"key":"10.1016\/0304-3975(95)00090-9_BIB18","series-title":"Computer Algebra, Symbolic and Algebraic Computation","first-page":"115","article-title":"Generalized polynomial remainder sequences","author":"Loos","year":"1982"},{"key":"10.1016\/0304-3975(95)00090-9_BIB19","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1214\/aoms\/1177731540","article-title":"A method for determining explicitly the coefficients of the characteristic equation","volume":"13","author":"Samuelson","year":"1942","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0304-3975(95)00090-9_BIB20","series-title":"Theory of Integer and Linear Programming","author":"Schrijver","year":"1985"},{"key":"10.1016\/0304-3975(95)00090-9_BIB21","unstructured":"G. Villard, Computation of Smith normal forms of polynomial matrices, Rapport technique Dec 92, LMC Imag Grenoble."},{"key":"10.1016\/0304-3975(95)00090-9_BIB22","series-title":"Internat. Symp. on Symbolic and Algebraic Computation","first-page":"209","article-title":"Computation of Smith normal forms of polynomial mltrices","author":"Villard","year":"1993"},{"key":"10.1016\/0304-3975(95)00090-9_BIB23","unstructured":"G. Villard, Generalized subresultants for computing the Smith normal form of polynomial matrices, J. Symbolic Comput.\u00e0 para\u00eetre."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000909?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000909?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:53:40Z","timestamp":1555404820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595000909"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00090-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}