{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:16Z","timestamp":1750306636141,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2014,1,28]],"date-time":"2014-01-28T00:00:00Z","timestamp":1390867200000},"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":[[2014,1,28]]},"abstract":"<jats:p>\n            We present a new parallel algorithm which computes the GCD of\n            <jats:italic>n<\/jats:italic>\n            integers of\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            ) bits in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            \/ log\n            <jats:italic>n<\/jats:italic>\n            ) time with\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2+\u03b5<\/jats:sup>\n            ) processors, for any \u03b5 &gt; 0 on CRCW PRAM model.\n          <\/jats:p>","DOI":"10.1145\/2576802.2576809","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T14:16:21Z","timestamp":1391523381000},"page":"92-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast parallel GCD algorithm of many integers"],"prefix":"10.1145","volume":"47","author":[{"given":"Sidi M.","family":"Sedjelmaci","sequence":"first","affiliation":[{"name":"University of Paris-Nord, Villetaneuse, France"}]}],"member":"320","published-online":{"date-parts":[[2014,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90766-5"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840374"},{"key":"e_1_2_1_3_1","first-page":"310","article-title":"von zur Gathen and G. Havas, GCD of many integers, Lect. Notes in Comp. Sci., Springer-Verlag","volume":"1627","author":"Cooperman G.","year":"1999","unstructured":"G. Cooperman , S. Feisel , J . von zur Gathen and G. Havas, GCD of many integers, Lect. Notes in Comp. Sci., Springer-Verlag , Berlin , 1627 ( 1999 ), 310 -- 317 G. Cooperman, S. Feisel, J. von zur Gathen and G. Havas, GCD of many integers, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1627 (1999), 310--317","journal-title":"Berlin"},{"key":"e_1_2_1_4_1","volume-title":"Congressus Numerantium, 111","author":"Havas G.","year":"1998","unstructured":"G. Havas , S. Majewski , Extended gcd calculation , Congressus Numerantium, 111 , 1627 ( 1998 ), 104--114 G. Havas, S. Majewski, Extended gcd calculation, Congressus Numerantium, 111, 1627 (1998), 104--114"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/384101.384142"},{"key":"e_1_2_1_6_1","volume-title":"LIPN","author":"Sedjelmaci S.M.","year":"2013","unstructured":"S.M. Sedjelmaci , Fast Parallel GCD algorithm of many integers, lipn.univ-paris13.fr\/~sedjelmaci, Rapport interne , LIPN , April , 2013 S.M. Sedjelmaci, Fast Parallel GCD algorithm of many integers, lipn.univ-paris13.fr\/~sedjelmaci, Rapport interne, LIPN, April, 2013"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1006"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576802.2576809","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576802.2576809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:54Z","timestamp":1750229754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576802.2576809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,28]]},"references-count":7,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2014,1,28]]}},"alternative-id":["10.1145\/2576802.2576809"],"URL":"https:\/\/doi.org\/10.1145\/2576802.2576809","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2014,1,28]]},"assertion":[{"value":"2014-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}