{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:42Z","timestamp":1750307622971,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","license":[{"start":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T00:00:00Z","timestamp":1216944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2008,7,25]]},"DOI":"10.1145\/1394042.1394073","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T13:22:19Z","timestamp":1217337739000},"page":"62-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A straight line program computing the integer greatest common divisor (abstract only)"],"prefix":"10.1145","volume":"42","author":[{"given":"Sidi Mohamed","family":"Sedjelmaci","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Nord"}]}],"member":"320","published-online":{"date-parts":[[2008,7,25]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Algorithmica. 5","author":"Chor B.","year":"1990","unstructured":"B. Chor and O. Goldreich , An improved parallel algorithm for integer GCD , Algorithmica. 5 ( 1990 ). B. Chor and O. Goldreich, An improved parallel algorithm for integer GCD, Algorithmica. 5 (1990)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/384101.384142"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1006"},{"issue":"4","key":"e_1_2_1_5_1","first-page":"641","volume":"12","author":"Valiant L.G.","year":"1983","unstructured":"L.G. Valiant , S. Skyum , S. Berkowitz and C. Rackoff , Fast parallel computation of polynomials using few processors, SIAM J.Computing 12 No. 4 ( 1983 ) 641 -- 644 . L.G. Valiant, S. Skyum, S. Berkowitz and C. Rackoff, Fast parallel computation of polynomials using few processors, SIAM J.Computing 12 No.4 (1983) 641--644.","journal-title":"Fast parallel computation of polynomials using few processors, SIAM J.Computing"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394073","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1394042.1394073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:52Z","timestamp":1750250752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,25]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,7,25]]}},"alternative-id":["10.1145\/1394042.1394073"],"URL":"https:\/\/doi.org\/10.1145\/1394042.1394073","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2008,7,25]]},"assertion":[{"value":"2008-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}