{"id":"https://openalex.org/W11916716","doi":"https://doi.org/10.1051/ita/1989230101131","title":"Efficient distributed algorithms by using the archimedean time assumption","display_name":"Efficient distributed algorithms by using the archimedean time assumption","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W11916716","doi":"https://doi.org/10.1051/ita/1989230101131","mag":"11916716"},"language":"en","primary_location":{"id":"doi:10.1051/ita/1989230101131","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ita/1989230101131","pdf_url":"https://www.rairo-ita.org/articles/ita/pdf/1989/01/ita1989230101131.pdf","source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.rairo-ita.org/articles/ita/pdf/1989/01/ita1989230101131.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["GR","US"],"is_corresponding":true,"raw_author_name":"Paul Spirakis","raw_affiliation_strings":[") Computer Technology Institute, PO BOX 1122, 26110, Patras, Greece",") Courant Institute of Mathematical Sciences, 251 Mercer St, NY NY 10012, U.S.A"],"affiliations":[{"raw_affiliation_string":") Computer Technology Institute, PO BOX 1122, 26110, Patras, Greece","institution_ids":["https://openalex.org/I120729142"]},{"raw_affiliation_string":") Courant Institute of Mathematical Sciences, 251 Mercer St, NY NY 10012, U.S.A","institution_ids":["https://openalex.org/I36672615"]}]},{"author_position":"last","author":{"id":null,"display_name":"Basil Tampakas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Basil Tampakas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011756177"],"corresponding_institution_ids":["https://openalex.org/I120729142","https://openalex.org/I36672615"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00207211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"1","first_page":"113","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.5642722249031067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5559624433517456}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5642722249031067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5559624433517456}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ita/1989230101131","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ita/1989230101131","pdf_url":"https://www.rairo-ita.org/articles/ita/pdf/1989/01/ita1989230101131.pdf","source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:edpsciences.org:dkey/10.1051/ita/1989230101131","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400744","display_name":"Springer Link (Chiba Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8488066","host_organization_name":"Chiba Institute of Technology","host_organization_lineage":["https://openalex.org/I8488066"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.1051/ita/1989230101131","raw_type":"Text"},{"id":"pmh:oai:numdam.org:ITA_1989__23_1_113_0","is_oa":false,"landing_page_url":"https://www.numdam.org/item/ITA_1989__23_1_113_0/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1051/ita/1989230101131","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ita/1989230101131","pdf_url":"https://www.rairo-ita.org/articles/ita/pdf/1989/01/ita1989230101131.pdf","source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4335130814","display_name":"Innovative Techniques for Concurrency Control in Database   Systems","funder_award_id":"8503497","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W11916716.pdf","grobid_xml":"https://content.openalex.org/works/W11916716.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1507828656","https://openalex.org/W1606793879","https://openalex.org/W1965790513","https://openalex.org/W1968191405","https://openalex.org/W1990511053","https://openalex.org/W2029288212","https://openalex.org/W2049764332","https://openalex.org/W2053981136","https://openalex.org/W2074638099","https://openalex.org/W2086012279","https://openalex.org/W2121236443","https://openalex.org/W2122261906","https://openalex.org/W2144884804","https://openalex.org/W3137220996"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2317200988","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278"],"abstract_inverted_index":{"This":[0],"work":[1],"examines":[2],"the":[3,28,43,53,61,69,76,85,109,112,118,122,149,160],"effect":[4],"oflimited":[5],"asynchrony":[6],"on":[7,52,108,121],"three":[8],"fondamental":[9],"problems":[10,72],"of":[11,16,24,30,78,102,124,130],"distributed":[12,37,154],"computation:":[13],"The":[14],"problem":[15,29,88,115],"symmetry":[17,86],"breaking":[18,87],"in":[19,42,128,148],"a":[20,91],"logical":[21],"ring,":[22],"that":[23,45,151],"mutual":[25,113],"exclusion":[26,114],"and":[27,32,49,56,97,105,141],"readers":[31],"writers.":[33],"We":[34,59,133],"assume":[35],"our":[36],"System":[38,155],"to":[39,65,157],"be":[40],"Archimedean":[41,140,161],"sens":[44,150],"processors":[46],"know":[47],"upper":[48],"lower":[50,119],"bounds":[51,64],"message":[54,103],"delays":[55],"processor":[57],"speeds.":[58],"use":[60],"knowledge":[62],"ofthose":[63],"get":[66,90],"algorithms":[67,79,145],"for":[68],"above":[70],"mentioned":[71],"which":[73,93,126],"well":[74],"improve":[75],"efficiency":[77],"presented":[80],"by":[81],"previous":[82],"research.":[83],"For":[84,111],"we":[89,116],"protocol":[92],"admits":[94],"arbitrary":[95],"initiation,":[96],"uses":[98],"only":[99],"linear":[100,106],"number":[101,123],"bits":[104],"time":[107,162],"average.":[110],"break":[117],"bound":[120],"messages":[125],"holds":[127],"case":[129],"unrestricted":[131],"asynchrony.":[132],"also":[134],"find":[135],"an":[136],"important":[137],"diffrence":[138],"between":[139],"Synchronous":[142],"networks.":[143],"Our":[144],"are":[146],"practical":[147],"any":[152],"existing":[153],"up":[156],"now":[158],"follows":[159],"assumption.":[163]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}