{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:03:58Z","timestamp":1760061838698},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/s0747-7171(08)80021-1","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T10:22:56Z","timestamp":1212056576000},"page":"429-455","source":"Crossref","is-referenced-by-count":13,"title":["Analysis of euclidean algorithms for polynomials over finite fields"],"prefix":"10.1016","volume":"9","author":[{"given":"Keju","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim von zur","family":"Gathen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80021-1_bib1","author":"Aho","year":"1975"},{"key":"10.1016\/S0747-7171(08)80021-1_bib2","series-title":"Proc. 22nd IEEE Symp. on the Foundations of Computer Science","first-page":"394","article-title":"Probabilistic algorithms in finite fields","author":"Ben-Or","year":"1981"},{"key":"10.1016\/S0747-7171(08)80021-1_bib3","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","article-title":"Factoring polynomials over large finite fields","volume":"24","author":"Berlekamp","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(08)80021-1_bib4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and GCD computations","volume":"52","author":"Borodin","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/S0747-7171(08)80021-1_bib5","series-title":"Algorithms and Complexity","first-page":"321","article-title":"Analysis of the binary Euclidean algorithm","author":"Brent","year":"1976"},{"key":"10.1016\/S0747-7171(08)80021-1_bib6","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321662.321664","article-title":"On Euclid's algorithm and the computation of polynomial greatest common divisors","volume":"18","author":"Brown","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0747-7171(08)80021-1_bib7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","article-title":"On Euclid's algorithm and the theory of subresultants","volume":"18","author":"Brown","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0747-7171(08)80021-1_bib8","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","article-title":"On algorithms for factoring polynomials over finite fields","volume":"36","author":"Cantor","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(08)80021-1_bib9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/321371.321381","article-title":"Subresultants and reduced polynomial remainder sequences","volume":"14","author":"Collins","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0747-7171(08)80021-1_bib10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0203001","article-title":"The computing time of the Euclidean algorithm","volume":"3","author":"Collins","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(08)80021-1_bib11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0022-314X(70)90044-2","article-title":"The number of steps in the Euclidean algorithm","volume":"2","author":"Dixon","year":"1970","journal-title":"J. Number Theory"},{"key":"10.1016\/S0747-7171(08)80021-1_bib12","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","article-title":"Parallel algorithms for algebraic problems","volume":"13","author":"von zur Gathen","year":"1984","journal-title":"SIAM J Comput."},{"key":"10.1016\/S0747-7171(08)80021-1_bib13","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1137\/0215030","article-title":"Representations and parallel computations for rational functions","volume":"15","author":"von zur Gathen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(08)80021-1_bib14","series-title":"Abhandlungen aus Zahlentheorie und Analysis","first-page":"87","article-title":"On the average length of a class of continued fractions","author":"Heilbronn","year":"1968"},{"key":"10.1016\/S0747-7171(08)80021-1_bib15","first-page":"269","article-title":"The analysis of algorithms","volume":"vol. 3","author":"Knuth","year":"1970"},{"key":"10.1016\/S0747-7171(08)80021-1_bib16","author":"Knuth","year":"1981"},{"key":"10.1016\/S0747-7171(08)80021-1_bib17","first-page":"867","article-title":"Note sur la limite du nombre des divisions dans la recherche du plus grand commun diviseur entre deux nombres entiers","volume":"19","author":"Lam\u00e9","year":"1844","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/S0747-7171(08)80021-1_bib18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.2307\/2302607","article-title":"Euclid's algorithm for large numbers","volume":"45","author":"Lehmer","year":"1938","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0747-7171(08)80021-1_bib19","article-title":"Analysis of polynomial GCD computations over finite fields","volume":"195","author":"Ma","year":"1987"},{"key":"10.1016\/S0747-7171(08)80021-1_bib20","series-title":"The theory of error-correcting codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0747-7171(08)80021-1_bib21","series-title":"Proc. Fifth ACM Symp. on Theory of Computing","first-page":"142","article-title":"Fast computation of GCD's","author":"Moenck","year":"1973"},{"key":"10.1016\/S0747-7171(08)80021-1_bib22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","article-title":"Probabilistic algorithms in finite fields","volume":"9","author":"Rabin","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(08)80021-1_bib23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","article-title":"Schnelle Berechnung von Kettenbruchentwicklungen","volume":"1","author":"Sch\u00f6nhage","year":"1971","journal-title":"Acta Inform."},{"key":"10.1016\/S0747-7171(08)80021-1_bib24","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","article-title":"Computational problems associated with Racah Algebra","volume":"1","author":"Stein","year":"1967","journal-title":"J. Comp. Phys."},{"key":"10.1016\/S0747-7171(08)80021-1_bib25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0212001","article-title":"The computational complexity of continued fractions","volume":"12","author":"Strassen","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800211?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800211?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T07:24:18Z","timestamp":1545981858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108800211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["S0747717108800211"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80021-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}