{"id":"https://openalex.org/W2055834864","doi":"https://doi.org/10.1145/2312005.2312007","title":"Time vs. space trade-offs for rendezvous in trees","display_name":"Time vs. space trade-offs for rendezvous in trees","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2055834864","doi":"https://doi.org/10.1145/2312005.2312007","mag":"2055834864"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312007","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","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/A5067736776","display_name":"Jurek Czyzowicz","orcid":"https://orcid.org/0000-0002-9026-1217"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jurek Czyzowicz","raw_affiliation_strings":["University of Quebec, Hull, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"University of Quebec, Hull, PQ, Canada","institution_ids":["https://openalex.org/I33217400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075900164","display_name":"Adrian Kosowski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Adrian Kosowski","raw_affiliation_strings":["INRIA, Talence, France","Algorithmics for computationally intensive applications over wide scale distributed platforms","Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"INRIA, Talence, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Algorithmics for computationally intensive applications over wide scale distributed platforms","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102714160","display_name":"Andrzej Pelc","orcid":"https://orcid.org/0000-0003-0598-1218"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Andrzej Pelc","raw_affiliation_strings":["University of Quebec, Hull, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"University of Quebec, Hull, PQ, Canada","institution_ids":["https://openalex.org/I33217400"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067736776"],"corresponding_institution_ids":["https://openalex.org/I33217400"],"apc_list":null,"apc_paid":null,"fwci":1.8626,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86436054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9934999942779541,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9926999807357788,"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/rendezvous","display_name":"Rendezvous","score":0.9962438344955444},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.7038387656211853},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.631171703338623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6196776032447815},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5908328890800476},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5816324353218079},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5767873525619507},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5703030228614807},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.42059844732284546},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3791922926902771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3511013984680176},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3373657464981079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33447927236557007},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07180845737457275}],"concepts":[{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.9962438344955444},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7038387656211853},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.631171703338623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6196776032447815},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5908328890800476},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5816324353218079},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5767873525619507},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5703030228614807},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.42059844732284546},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3791922926902771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3511013984680176},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3373657464981079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33447927236557007},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07180845737457275},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2312005.2312007","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.4775","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.4775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/64/69/12/PDF/tradeoffs-hal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.656.3988","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.656.3988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/file/index/docid/646912/filename/tradeoffs-hal.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00725924v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00725924","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":"SPAA - 24th Symposium on Parallelism in Algorithms and Architectures - 2012, ACM, 2012, Pittsburgh, United States. pp.1-10, ⟨10.1145/2312005.2312007⟩","raw_type":"Conference papers"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/197873","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/197873","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication dans un congr\u00e8s"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1501957312","https://openalex.org/W1526420573","https://openalex.org/W1532566247","https://openalex.org/W1535538796","https://openalex.org/W1547036184","https://openalex.org/W1571240480","https://openalex.org/W1592126212","https://openalex.org/W1635699204","https://openalex.org/W1706180934","https://openalex.org/W1759574848","https://openalex.org/W1971467559","https://openalex.org/W1972775782","https://openalex.org/W1975690872","https://openalex.org/W1988551609","https://openalex.org/W1988889787","https://openalex.org/W2007267487","https://openalex.org/W2010017329","https://openalex.org/W2010875998","https://openalex.org/W2014192080","https://openalex.org/W2030068303","https://openalex.org/W2034224690","https://openalex.org/W2040570464","https://openalex.org/W2048683471","https://openalex.org/W2049047281","https://openalex.org/W2050063944","https://openalex.org/W2071069929","https://openalex.org/W2073103034","https://openalex.org/W2081055073","https://openalex.org/W2083418734","https://openalex.org/W2086702855","https://openalex.org/W2096182510","https://openalex.org/W2103469743","https://openalex.org/W2114858735","https://openalex.org/W2116509046","https://openalex.org/W2131887891","https://openalex.org/W2138881680","https://openalex.org/W2152623377","https://openalex.org/W2621800709","https://openalex.org/W2623545498","https://openalex.org/W2729560458","https://openalex.org/W2950424720","https://openalex.org/W4245131660"],"related_works":["https://openalex.org/W2057371520","https://openalex.org/W2542862126","https://openalex.org/W2807763113","https://openalex.org/W2030068303","https://openalex.org/W1521763702","https://openalex.org/W2245527669","https://openalex.org/W937816491","https://openalex.org/W2046042302","https://openalex.org/W4367665025","https://openalex.org/W1985727224"],"abstract_inverted_index":{"Two":[0],"identical":[1],"(anonymous)":[2],"mobile":[3],"agents":[4,78,108,132,167],"start":[5],"from":[6],"arbitrary":[7,112,123],"nodes":[8],"of":[9,41,55,66,72,74,114,131,143,145],"an":[10,28],"unknown":[11,115],"tree":[12],"and":[13,69,148],"have":[14],"to":[15,39],"meet":[16],"at":[17,33,157],"some":[18,103],"node.":[19],"Agents":[20],"move":[21,38],"in":[22,25,91,111,118,136,140,170],"synchronous":[23],"rounds:":[24],"each":[26],"round":[27],"agent":[29],"can":[30,133],"either":[31],"stay":[32],"the":[34,63,70,75,141],"current":[35],"node":[36],"or":[37],"one":[40],"its":[42],"neighbors.":[43],"We":[44,125],"consider":[45],"deterministic":[46],"algorithms":[47],"for":[48,102,163,166],"this":[49,56],"rendezvous":[50,68,87,110,135],"task.":[51],"The":[52],"main":[53],"result":[54],"paper":[57],"is":[58,89,161],"a":[59,171],"tight":[60],"trade-off":[61],"between":[62],"optimal":[64,86],"time":[65,88,119,137],"completing":[67],"size":[71,116],"memory":[73,81,160],"agents.":[76],"For":[77],"with":[79,122,150],"k":[80,97],"bits,":[82],"we":[83,106,154],"show":[84,127],"that":[85,128,156],"\u0398(n+n2/k)":[90],"n-node":[92,172],"trees.":[93],"More":[94],"precisely,":[95],"if":[96],"\u2265":[98],"c":[99],"log":[100],"n,":[101],"constant":[104],"c,":[105],"design":[107],"accomplishing":[109],"trees":[113],"n":[117],"O(n+n2/k),":[120],"starting":[121,168],"delay.":[124],"also":[126],"no":[129],"pair":[130],"accomplish":[134],"o(n+n2/k),":[138],"even":[139,149,165],"class":[142],"lines":[144],"known":[146],"length":[147],"simultaneous":[151],"start.":[152],"Finally,":[153],"prove":[155],"least":[158],"logarithmic":[159],"necessary":[162],"rendezvous,":[164],"simultaneously":[169],"line.":[173]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}