{"id":"https://openalex.org/W1582826078","doi":"https://doi.org/10.1137/130931990","title":"How to Meet Asynchronously at Polynomial Cost","display_name":"How to Meet Asynchronously at Polynomial Cost","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1582826078","doi":"https://doi.org/10.1137/130931990","mag":"1582826078"},"language":"en","primary_location":{"id":"doi:10.1137/130931990","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130931990","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5036192968","display_name":"Yoann Dieudonn\u00e9","orcid":"https://orcid.org/0000-0002-9593-7802"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Yoann Dieudonn\u00e9","raw_affiliation_strings":["MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)","LaRIA - Laboratoire de Recherche en Informatique d'Amiens (Universit\u00e9 de Picardie Jules Verne - Facult\u00e9 de Math\u00e9matiques et d'Informatique -  33, rue Saint Leu - 80039 AMIENS CEDEX 1 - France)"],"affiliations":[{"raw_affiliation_string":"MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)","institution_ids":["https://openalex.org/I4647051"]},{"raw_affiliation_string":"LaRIA - Laboratoire de Recherche en Informatique d'Amiens (Universit\u00e9 de Picardie Jules Verne - Facult\u00e9 de Math\u00e9matiques et d'Informatique -  33, rue Saint Leu - 80039 AMIENS CEDEX 1 - France)","institution_ids":["https://openalex.org/I4647051","https://openalex.org/I4210144804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102714160","display_name":"Andrzej Pelc","orcid":"https://orcid.org/0000-0003-0598-1218"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrzej Pelc","raw_affiliation_strings":["DII - D\u00e9partement d'Informatique et d'Ing\u00e9nierie (101, Saint-Jean-Bosco, C.P. 1250, succursale Hull, Gatineau (Qu\u00e9bec) Canada, J8X 3X7 - Canada)"],"affiliations":[{"raw_affiliation_string":"DII - D\u00e9partement d'Informatique et d'Ing\u00e9nierie (101, Saint-Jean-Bosco, C.P. 1250, succursale Hull, Gatineau (Qu\u00e9bec) Canada, J8X 3X7 - Canada)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023906766","display_name":"Vincent Villain","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vincent Villain","raw_affiliation_strings":["MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)"],"affiliations":[{"raw_affiliation_string":"MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036192968"],"corresponding_institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":7.7252,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.97468089,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"44","issue":"3","first_page":"844","last_page":"867"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9907000064849854,"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/T11182","display_name":"Auction Theory and Applications","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rendezvous","display_name":"Rendezvous","score":0.928717315196991},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5891366004943848},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5789371728897095},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5032076239585876},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49285387992858887},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4573464095592499},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.43423566222190857},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.4227476119995117},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37366801500320435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3498552441596985},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33699148893356323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3259912133216858},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14626672863960266}],"concepts":[{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.928717315196991},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5891366004943848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5789371728897095},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5032076239585876},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49285387992858887},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4573464095592499},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.43423566222190857},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.4227476119995117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37366801500320435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3498552441596985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33699148893356323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3259912133216858},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14626672863960266},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/130931990","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130931990","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.765.4688","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.765.4688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1301.7119.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-03138485v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-03138485","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2015, 44 (3), pp.844-867. ⟨10.1137/130931990⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1972775782","https://openalex.org/W1988551609","https://openalex.org/W1988782771","https://openalex.org/W1988889787","https://openalex.org/W2007267487","https://openalex.org/W2010017329","https://openalex.org/W2012688519","https://openalex.org/W2014192080","https://openalex.org/W2030068303","https://openalex.org/W2040570464","https://openalex.org/W2041571902","https://openalex.org/W2048683471","https://openalex.org/W2049516232","https://openalex.org/W2050063944","https://openalex.org/W2071069929","https://openalex.org/W2080750094","https://openalex.org/W2081055073","https://openalex.org/W2086702855","https://openalex.org/W2087073465","https://openalex.org/W2103469743","https://openalex.org/W2114858735","https://openalex.org/W2136023420","https://openalex.org/W2138881680","https://openalex.org/W2621800709","https://openalex.org/W2950424720"],"related_works":["https://openalex.org/W2057371520","https://openalex.org/W2807763113","https://openalex.org/W2542862126","https://openalex.org/W2030068303","https://openalex.org/W4299484523","https://openalex.org/W2953266086","https://openalex.org/W2123785131","https://openalex.org/W1537369971","https://openalex.org/W1974895073","https://openalex.org/W2763250600"],"abstract_inverted_index":{"Two":[0],"mobile":[1],"agents":[2,52,76,170,203,219,254],"starting":[3],"at":[4,271],"different":[5,27,225],"nodes":[6],"of":[7,51,63,71,94,117,124,137,146,151,162,168,195,209,236,249,268,277,285,288],"an":[8,46,59,149],"unknown":[9,38,163,174],"network":[10],"have":[11,204,220,255],"to":[12,35,39,190,205,221,256],"meet.":[13],"This":[14],"task":[15],"is":[16,30,56,67,233],"known":[17,34],"in":[18,45,91,98,114,121,134,143,173,185,200,216,241,274,281],"the":[19,40,49,68,92,95,99,115,118,122,125,131,135,138,144,179,192,207,228,234,259,275,278,282],"literature":[20],"as":[21],"rendezvous.":[22],"Each":[23],"agent":[24,188,244],"has":[25,88,189,245],"a":[26,31,64,107,210,247],"label":[28,208],"which":[29,186,201,217,242],"positive":[32],"integer":[33],"it":[36],"but":[37],"other":[41],"agent.":[42],"Agents":[43],"move":[44],"asynchronous":[47],"way:":[48],"speed":[50],"may":[53],"vary":[54],"and":[55,97,120,140,224,238,252,280],"controlled":[57],"by":[58,74],"adversary.":[60],"The":[61,80],"cost":[62,89,112,132,272],"rendezvous":[65,109,153,263],"algorithm":[66,84,110,154],"total":[69,193],"number":[70,194,235],"edge":[72],"traversals":[73],"both":[75],"until":[77],"their":[78],"meeting.":[79],"only":[81],"previous":[82],"deterministic":[83,108],"solving":[85],"this":[86,103],"problem":[87],"exponential":[90],"size":[93,116,136,164,276],"graph":[96,119,139,279],"larger":[100,165],"label.":[101,127],"In":[102],"paper":[104],"we":[105,129,155,265],"present":[106],"with":[111],"polynomial":[113,273],"length":[123,284],"smaller":[126],"Hence,":[128],"decrease":[130],"exponentially":[133,142],"doubly":[141],"labels":[145,226,287],"agents.":[147,290],"As":[148],"application":[150],"our":[152,262],"solve":[156,266],"several":[157],"fundamental":[158],"problems":[159,270],"involving":[160],"teams":[161],"than":[166],"1":[167],"labeled":[169],"moving":[171],"asynchronously":[172],"networks.":[175],"Among":[176],"them":[177],"are":[178],"following":[180],"problems:":[181],"\\tt":[182,197,213,239],"team":[183],"size,":[184],"every":[187],"find":[191],"agents;":[196,237],"leader":[198],"election,":[199],"all":[202,218,253,258,267,286],"output":[206,257],"single":[211],"agent;":[212],"perfect":[214],"renaming,":[215],"adopt":[222],"new":[223],"from":[227],"set":[229],"$\\{1,\\dots,k\\}$,":[230],"where":[231],"$k$":[232],"gossiping,":[240],"each":[243],"initially":[246],"piece":[248],"information":[250],"(value)":[251],"values.":[260],"Using":[261],"algorithm,":[264],"these":[269],"smallest":[283],"participating":[289]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2025-10-10T00:00:00"}