{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:18Z","timestamp":1720624938943},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81002-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"1-4","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["On the complexity of the extended euclidean algorithm (Extended Abstract)"],"prefix":"10.1016","volume":"78","author":[{"given":"George","family":"Havas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB1","series-title":"Multi-dimensional continued fraction algorithms","author":"Brentjes","year":"1981"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-61581-4_50","article-title":"A new algorithm and refined bounds for extended GCD computation","volume":"1122","author":"Havas","year":"1996","journal-title":"Algorithmic number theory, Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1006\/jsco.1996.0141","article-title":"Integer matrix diagonalization","volume":"24","author":"Havas","year":"1997","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB4","first-page":"184","article-title":"Hermite normal form computation for integer matrices","volume":"105","author":"Havas","year":"1994","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BFb0015426","article-title":"A hard problem which is almost always easy","volume":"1004","author":"Havas","year":"1995","journal-title":"Algorithms and computation, Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10586458.1998.10504362","article-title":"Extended GCD and Hermite normal form algorithms via lattice basis reduction","volume":"7","author":"Havas","year":"1998","journal-title":"Experimental Mathematics"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-48340-3_10","article-title":"The complexity of the extended GCD problem","volume":"1672","author":"Havas","year":"1999","journal-title":"Mathematical foundations of computer science, Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB8","series-title":"Approximation Algorithms for NP-hard Problems","year":"1996"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB9","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 interger matrix","volume":"18","author":"Iliopousos","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB10","article-title":"The Art of computer Programming","volume":"Vol. 2","author":"Knuth","year":"1998"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB11","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB12","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-58691-1_56","article-title":"The complexity of greatest common divisor computations","volume":"877","author":"Majewski","year":"1994","journal-title":"algorithmic Number Theory, Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(04)81002-8_NEWBIB13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jsco.2000.0374","article-title":"Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm","volume":"30","author":"Kallen Van Der","year":"2000","journal-title":"Journal of Symbolic computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810028?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810028?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:56Z","timestamp":1549191236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":13,"alternative-id":["S1571066104810028"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81002-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}