{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:26:55Z","timestamp":1762032415770},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":3578,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Finite Fields and Their Applications"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1071-5797(03)00022-4","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T19:15:45Z","timestamp":1054581345000},"page":"423-431","source":"Crossref","is-referenced-by-count":3,"title":["On computation of the greatest common divisor of several polynomials over a finite field"],"prefix":"10.1016","volume":"9","author":[{"given":"Alessandro","family":"Conflitti","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1071-5797(03)00022-4_BIB1","series-title":"The Design and the Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S1071-5797(03)00022-4_BIB2","unstructured":"G. Cooperman, S. Feisel, J. von zur Gathen, G. Havas, GCD of many integers, Proceedings of the Fifth International Computing and Combinatorics Conference, Tokyo, 1999, Lecture Notes in Computer Science, Vol. 1627, Springer, Berlin, 1999, pp. 310\u2013317."},{"key":"10.1016\/S1071-5797(03)00022-4_BIB3","series-title":"Modern Computer Algebra","author":"von zur Gathen","year":"1999"},{"key":"10.1016\/S1071-5797(03)00022-4_BIB4","series-title":"Finite Fields","author":"Lidl","year":"1997"},{"key":"10.1016\/S1071-5797(03)00022-4_BIB5","doi-asserted-by":"crossref","unstructured":"T. Mulders, A. Storjohann, Diophantine linear system solving, Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC), Vancouver, ACM Press, New York, 1999, pp. 181\u2013188.","DOI":"10.1145\/309831.309905"},{"key":"10.1016\/S1071-5797(03)00022-4_BIB6","unstructured":"T. Mulders, A. Storjohann, Certified dense linear system solving, Technical Report 355, Department of Computer Science, ETH Zurich, December 2000."}],"container-title":["Finite Fields and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579703000224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579703000224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T20:26:37Z","timestamp":1553113597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579703000224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S1071579703000224"],"URL":"https:\/\/doi.org\/10.1016\/s1071-5797(03)00022-4","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}