{"id":"https://openalex.org/W2408366326","doi":"https://doi.org/10.1137/1.9781611972979.14","title":"Analysis of fast versions of the Euclid Algorithm","display_name":"Analysis of fast versions of the Euclid Algorithm","publication_year":2007,"publication_date":"2007-01-06","ids":{"openalex":"https://openalex.org/W2408366326","doi":"https://doi.org/10.1137/1.9781611972979.14","mag":"2408366326"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611972979.14","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611972979.14","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00211424","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107305126","display_name":"Eda Cesaratto","orcid":"https://orcid.org/0000-0002-7475-5954"},"institutions":[{"id":"https://openalex.org/I24354313","display_name":"Universidad de Buenos Aires","ror":"https://ror.org/0081fs513","country_code":"AR","type":"education","lineage":["https://openalex.org/I24354313"]},{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]}],"countries":["AR","FR"],"is_corresponding":false,"raw_author_name":"Eda Cesaratto","raw_affiliation_strings":["FIUBA - Facultad de Ingenier\u00eda [Buenos Aires] (Av. Paseo Col\u00f3n 850 - C1063ACV - Buenos Aires - Argentina)","Equipe AMACC - Laboratoire GREYC - UMR6072 (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FIUBA - Facultad de Ingenier\u00eda [Buenos Aires] (Av. Paseo Col\u00f3n 850 - C1063ACV - Buenos Aires - Argentina)","institution_ids":["https://openalex.org/I24354313"]},{"raw_affiliation_string":"Equipe AMACC - Laboratoire GREYC - UMR6072 (France)","institution_ids":["https://openalex.org/I4210139483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047748726","display_name":"Julien Cl\u00e9ment","orcid":"https://orcid.org/0000-0001-8365-3899"},"institutions":[{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Julien Clement","raw_affiliation_strings":["Equipe AMACC - Laboratoire GREYC - UMR6072 (France)","GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen (Boulevard du Mar\u00e9chal Juin - 14050 CAEN Cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Equipe AMACC - Laboratoire GREYC - UMR6072 (France)","institution_ids":["https://openalex.org/I4210139483"]},{"raw_affiliation_string":"GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen (Boulevard du Mar\u00e9chal Juin - 14050 CAEN Cedex - France)","institution_ids":["https://openalex.org/I4210139483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008438041","display_name":"Beno\u00eet Daireaux","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152551","display_name":"International Research Institute of Stavanger","ror":"https://ror.org/0502t5s28","country_code":"NO","type":"facility","lineage":["https://openalex.org/I4210152551"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Beno\u00eet Daireaux","raw_affiliation_strings":["IrisResearch Center (Stavanger, Norway - Norway)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IrisResearch Center (Stavanger, Norway - Norway)","institution_ids":["https://openalex.org/I4210152551"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015311118","display_name":"Lo\u00efck Lhote","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lo\u00efck Lhote","raw_affiliation_strings":["Equipe AMACC - Laboratoire GREYC - UMR6072 (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Equipe AMACC - Laboratoire GREYC - UMR6072 (France)","institution_ids":["https://openalex.org/I4210139483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077519934","display_name":"V\u00e9ronique Maume\u2010Deschamps","orcid":"https://orcid.org/0009-0005-2992-472X"},"institutions":[{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]},{"id":"https://openalex.org/I4210112333","display_name":"Institut de Math\u00e9matiques de Bourgogne","ror":"https://ror.org/021f0sa24","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210112333","https://openalex.org/I4405253280"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"V\u00e9ronique Maume-Deschamps","raw_affiliation_strings":["IMB - Institut de Math\u00e9matiques de Bourgogne [Dijon] (Universit\u00e9 de Bourgogne - 9, avenue Alain Savary - B.P. 47 870 - 21078 Dijon Cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMB - Institut de Math\u00e9matiques de Bourgogne [Dijon] (Universit\u00e9 de Bourgogne - 9, avenue Alain Savary - B.P. 47 870 - 21078 Dijon Cedex - France)","institution_ids":["https://openalex.org/I4210166017","https://openalex.org/I4210112333","https://openalex.org/I177064439"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082150310","display_name":"Brigitte Vall\u00e9e","orcid":"https://orcid.org/0000-0002-2794-6811"},"institutions":[{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Brigitte Vall\u00e9e","raw_affiliation_strings":["Equipe AMACC - Laboratoire GREYC - UMR6072 (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Equipe AMACC - Laboratoire GREYC - UMR6072 (France)","institution_ids":["https://openalex.org/I4210139483"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4966,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.83891809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"271","last_page":"285"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/algorithm","display_name":"Algorithm","score":0.6535766124725342},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5855404734611511},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5647760629653931},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.558074414730072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5514503717422485},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5123182535171509},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5093942284584045},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47744518518447876},{"id":"https://openalex.org/keywords/freivalds-algorithm","display_name":"Freivalds' algorithm","score":0.4762970507144928},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4660068154335022},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4603962302207947},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4592326879501343},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42846786975860596},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.423519492149353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37396132946014404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2799580693244934}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6535766124725342},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5855404734611511},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5647760629653931},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.558074414730072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5514503717422485},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5123182535171509},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5093942284584045},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47744518518447876},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.4762970507144928},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4660068154335022},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4603962302207947},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4592326879501343},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42846786975860596},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.423519492149353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37396132946014404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2799580693244934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/1.9781611972979.14","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611972979.14","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.1709","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.1709","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siam.org/proceedings/analco/2007/anl07_029ecesaratto.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.533.1156","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.533.1156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://lhote.users.greyc.fr/articles/FFTgcdAnalco.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.533.6837","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.533.6837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/21/14/24/PDF/analco-10-12_-_copie.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00211424v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00211424","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"2008","raw_type":"Preprints, Working Papers, ..."},{"id":"pmh:oai:HAL:hal-04704017v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04704017","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2007), Jan 2007, La Nouvelle Orl\u00e9ans, LA, United States. pp.271-285, ⟨10.1137/1.9781611972979.14⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00211424v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00211424","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"2008","raw_type":"Preprints, Working Papers, ..."},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W611098039","https://openalex.org/W1510272435","https://openalex.org/W1518027194","https://openalex.org/W1526480832","https://openalex.org/W1550016006","https://openalex.org/W1583935850","https://openalex.org/W1584026429","https://openalex.org/W1644202329","https://openalex.org/W1972511254","https://openalex.org/W1997160752","https://openalex.org/W2006074106","https://openalex.org/W2014355030","https://openalex.org/W2017360635","https://openalex.org/W2056364851","https://openalex.org/W2057334623","https://openalex.org/W2063001983","https://openalex.org/W2065660572","https://openalex.org/W2068509473","https://openalex.org/W2120782763","https://openalex.org/W2160707732","https://openalex.org/W2318007796","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W4250757898","https://openalex.org/W1598763886","https://openalex.org/W4245606755","https://openalex.org/W2050001863","https://openalex.org/W2035721896","https://openalex.org/W4231916799","https://openalex.org/W4243263074","https://openalex.org/W1508924483","https://openalex.org/W102882884","https://openalex.org/W2007715402"],"abstract_inverted_index":{"There":[0],"exist":[1],"fast":[2,56,90,120,217],"variants":[3],"of":[4,21,50,54,86,88,102,125,144,152,158,211,215,231],"the":[5,37,51,59,137,150,153,156,159,169,173,177,201,208,212,237,241],"gcd":[6],"algorithm":[7,121],"which":[8,141,191],"are":[9,181,197],"all":[10,172],"based":[11,70,226],"on":[12,71,99,227],"principles":[13],"due":[14],"to":[15,200,207,236],"Knuth":[16],"and":[17,29,35,74,92,131,224],"Sch\u00f6nhage.":[18],"On":[19],"inputs":[20,101],"size":[22,103],"n,":[23],"these":[24,55,89,194,216],"algorithms":[25,196],"use":[26],"a":[27,40,82,112,119,123,165,187,228],"Divide":[28],"Conquer":[30],"approach,":[31],"perform":[32],"FFT":[33],"multiplications":[34],"stop":[36],"recursion":[38],"at":[39],"depth":[41],"slightly":[42],"smaller":[43],"than":[44],"lg":[45],"n.":[46],"A":[47],"rough":[48],"estimate":[49,68,167],"worst\u2013case":[52],"complexity":[53],"versions":[57],"provides":[58],"bound":[60],"O(n(log":[61],"n)2":[62,107],"log":[63,64,108,109],"n).":[65],"However,":[66],"this":[67],"is":[69,75,105,225],"some":[72,87],"heuristics":[73],"not":[76],"actually":[77],"proven.":[78],"Here,":[79],"we":[80,93,127,132,163,184],"provide":[81],"precise":[83,113,209,229],"probabilistic":[84],"analysis":[85],"variants,":[91],"prove":[94],"that":[95,171,193],"their":[96],"average":[97,213],"bit\u2013complexity":[98,214],"random":[100],"n":[104],"\u0398(n(log":[106],"n),":[110],"with":[111],"remainder":[114],"term.":[115],"We":[116,147],"view":[117],"such":[118],"as":[122],"sequence":[124],"what":[126],"call":[128],"interrupted":[129,195],"algorithms,":[130],"obtain":[133,164],"three":[134],"results":[135],"about":[136],"(plain)":[138,160,178],"Euclid":[139,161,179,242],"Algorithm":[140,180],"may":[142],"be":[143],"independent":[145],"interest.":[146],"precisely":[148],"describe":[149],"evolution":[151],"distribution":[154],"during":[155],"execution":[157],"Algorithm;":[162],"sharp":[166],"for":[168],"probability":[170],"quotients":[174],"produced":[175],"by":[176],"small":[182],"enough;":[183],"also":[185],"exhibit":[186],"strong":[188],"regularity":[189],"phenomenon,":[190],"proves":[192],"locally":[198],"\u201csimilar\u201d":[199],"total":[202],"algorithm.":[203],"This":[204,219],"finally":[205],"leads":[206],"evaluation":[210],"algorithms.":[218],"work":[220],"uses":[221],"various":[222],"tools,":[223],"study":[230],"generalised":[232],"transfer":[233],"operators":[234],"related":[235],"dynamical":[238],"system":[239],"underlying":[240],"Algorithm.":[243]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}