{"id":"https://openalex.org/W2739019226","doi":"https://doi.org/10.1145/3087604.3087610","title":"Two Fast Parallel GCD Algorithms of Many Integers","display_name":"Two Fast Parallel GCD Algorithms of Many Integers","publication_year":2017,"publication_date":"2017-07-19","ids":{"openalex":"https://openalex.org/W2739019226","doi":"https://doi.org/10.1145/3087604.3087610","mag":"2739019226"},"language":"en","primary_location":{"id":"doi:10.1145/3087604.3087610","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087604.3087610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066278887","display_name":"Sidi Mohamed Sedjelmaci","orcid":null},"institutions":[{"id":"https://openalex.org/I59807433","display_name":"Universit\u00e9 Lille Nord de France","ror":"https://ror.org/03btvgn05","country_code":"FR","type":"education","lineage":["https://openalex.org/I59807433"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Sidi Mohamed Sedjelmaci","raw_affiliation_strings":["University of Paris Nord, Paris, France"],"affiliations":[{"raw_affiliation_string":"University of Paris Nord, Paris, France","institution_ids":["https://openalex.org/I59807433","https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066278887"],"corresponding_institution_ids":["https://openalex.org/I204730241","https://openalex.org/I59807433"],"apc_list":null,"apc_paid":null,"fwci":0.9672,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82346594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"397","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6227817535400391},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5196715593338013},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3812238574028015}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6227817535400391},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5196715593338013},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3812238574028015}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087604.3087610","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087604.3087610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1522504315","https://openalex.org/W1584086289","https://openalex.org/W1964485194","https://openalex.org/W1966466171","https://openalex.org/W2003196739","https://openalex.org/W2015161630","https://openalex.org/W2022475297","https://openalex.org/W2038038783","https://openalex.org/W2040055854","https://openalex.org/W2062881752","https://openalex.org/W2069883996","https://openalex.org/W2073952448","https://openalex.org/W2089514214","https://openalex.org/W2110759722","https://openalex.org/W2126155652","https://openalex.org/W2158251041","https://openalex.org/W2333117240","https://openalex.org/W4210445513"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"We":[0,87],"present":[1],"two":[2],"new":[3],"parallel":[4,56,72],"algorithms":[5],"which":[6],"compute":[7],"the":[8,24,42,71,78],"GCD":[9,43,91],"of":[10,13,44,47,81],"n":[11],"integers":[12,46,82,95],"O(n)":[14,48],"bits":[15,49],"in":[16,23,32,53,84],"O(n/log":[17,54],"n)":[18,55],"time":[19,57,73],"with":[20,58],"O(n2+\u03b5)":[21],"processors":[22],"worst":[25],"case,":[26],"for":[27,62,93],"any":[28,63],"\u03b5":[29],">":[30],"0":[31],"CRCW":[33],"PRAM":[34],"model.":[35],"More":[36],"generally,":[37],"we":[38],"prove":[39],"that":[40],"computing":[41],"$m$":[45],"can":[50],"be":[51],"achieved":[52],"O(m":[59],"n1+\u03b5)":[60],"processors,":[61],"2":[64],"\u2264":[65,67],"m":[66,80],"n3/2/log":[68],"n,":[69],"i.e.":[70],"does":[74],"not":[75],"depend":[76],"on":[77],"number":[79],"considered":[83],"this":[85],"range.":[86],"suggest":[88],"an":[89,99],"extended":[90],"version":[92],"many":[94],"as":[96,98],"well":[97],"algorithm":[100],"to":[101],"solve":[102],"linear":[103],"Diophantine":[104],"equations.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}