{"id":"https://openalex.org/W1550016006","doi":"https://doi.org/10.1007/978-3-540-24847-7_31","title":"A Binary Recursive Gcd Algorithm","display_name":"A Binary Recursive Gcd Algorithm","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1550016006","doi":"https://doi.org/10.1007/978-3-540-24847-7_31","mag":"1550016006"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-24847-7_31","doi":"https://doi.org/10.1007/978-3-540-24847-7_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24847-7_31","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","ki-jl-1","norway-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W2791103999","display_name":"Algorithmic Number Theory: 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings","relationship":"volume"}],"lineage":["https://openalex.org/W1550016006","https://openalex.org/W2791103999"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00071533","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050316793","display_name":"Damien Stehl\u00e9","orcid":"https://orcid.org/0000-0003-3435-2453","observed_orcids":["https://orcid.org/0000-0003-3435-2453"]},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Damien Stehl\u00e9","raw_affiliation_strings":["LORIA/INRIA Lorraine, 615 rue du jardin botanique, BP 101, F-54602, Villers-l\u00e8s-Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA/INRIA Lorraine, 615 rue du jardin botanique, BP 101, F-54602, Villers-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057843487","display_name":"Paul Zimmermann","orcid":"https://orcid.org/0000-0003-0718-4458","observed_orcids":["https://orcid.org/0000-0003-0718-4458"]},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Paul Zimmermann","raw_affiliation_strings":["LORIA/INRIA Lorraine, 615 rue du jardin botanique, BP 101, F-54602, Villers-l\u00e8s-Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA/INRIA Lorraine, 615 rue du jardin botanique, BP 101, F-54602, Villers-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2078,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.8778641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":"3076","issue":null,"first_page":"411","last_page":"425"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9096999764442444,"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.9096999764442444,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.035599999129772186,"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"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.021400000900030136,"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/euclidean-algorithm","display_name":"Euclidean algorithm","score":0.7730000019073486},{"id":"https://openalex.org/keywords/greatest-common-divisor","display_name":"greatest common divisor","score":0.8050000071525574},{"id":"https://openalex.org/keywords/recursive-algorithm","display_name":"recursive algorithm","score":0.7820000052452087},{"id":"https://openalex.org/keywords/integer-arithmetic","display_name":"integer arithmetic","score":0.550000011920929},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"algorithmic complexity","score":0.5709999799728394}],"concepts":[{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.8874239921569824},{"id":"https://openalex.org/C125257309","wikidata":"https://www.wikidata.org/wiki/Q131752","display_name":"Greatest common divisor","level":2,"score":0.8760602474212646},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7539152503013611},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6908212900161743},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6011941432952881},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5862175226211548},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5519235134124756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35639941692352295},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1712413728237152}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-540-24847-7_31","doi":"https://doi.org/10.1007/978-3-540-24847-7_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24847-7_31","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","ki-jl-1","norway-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:https://researchers.mq.edu.au:publications/a0045171-82b4-4b1c-b51e-f1aa11b30a29","doi":null,"is_oa":false,"landing_page_url":"https://researchers.mq.edu.au/en/publications/a0045171-82b4-4b1c-b51e-f1aa11b30a29","pdf_url":null,"source":{"id":"https://openalex.org/S7407050580","display_name":"Macquarie University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I99043593","host_organization_name":"Macquarie University","host_organization_lineage":["https://openalex.org/I99043593"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stehle, D & Zimmermann, P 2004, A Binary Recursive Gcd Algorithm. in D A Buell (ed.), Proceedings of the 6th International Symposium on Algorithmic Number Theory (ANTS 2004). Springer, Springer Nature, Berlin ; Heidelberg, Germany, pp. 411-425, The 6th International Symposium on Algorithmic Number Theory (ANTS 2004), Burlington, VT, USA, 13/06/04.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:HAL:inria-00071533v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00071533","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-5050, INRIA. 2002","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:HAL:inria-00100175v1","doi":null,"is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00100175","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.8612","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.loria.fr/~zimmerma/papers/recbinary.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00071533v1","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00071533","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] RR-5050, INRIA. 2002","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1562183207","https://openalex.org/W1583935850","https://openalex.org/W1584026429","https://openalex.org/W2004814164","https://openalex.org/W2034379372","https://openalex.org/W2057334623","https://openalex.org/W2083368929","https://openalex.org/W2113672208","https://openalex.org/W2127856956","https://openalex.org/W4212788863"],"related_works":["https://openalex.org/W2359386390","https://openalex.org/W1986372353","https://openalex.org/W2160707732","https://openalex.org/W2064739973","https://openalex.org/W7097268784","https://openalex.org/W2510351432","https://openalex.org/W2492729437","https://openalex.org/W2153388668","https://openalex.org/W2085448428","https://openalex.org/W4302194796"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1550016006","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
