{"id":"https://openalex.org/W4380875799","doi":"https://doi.org/10.1145/3583668.3594568","title":"Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next","display_name":"Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380875799","doi":"https://doi.org/10.1145/3583668.3594568"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594568","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-04429961v1/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021665812","display_name":"Romain Cosson","orcid":"https://orcid.org/0009-0004-8784-7112"},"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"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Romain Cosson","raw_affiliation_strings":["Inria, Paris, France","DYOGENE - Dynamics of Geometric Networks (48 Rue Barrault, 75013 Paris - France)"],"raw_orcid":"https://orcid.org/0009-0004-8784-7112","affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"DYOGENE - Dynamics of Geometric Networks (48 Rue Barrault, 75013 Paris - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007698196","display_name":"Laurent Massouli\u00e9","orcid":"https://orcid.org/0000-0001-7263-0069"},"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Massoulie","raw_affiliation_strings":["Inria, Paris, France","DYOGENE - Dynamics of Geometric Networks (48 Rue Barrault, 75013 Paris - France)"],"raw_orcid":"https://orcid.org/0000-0001-7263-0069","affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"DYOGENE - Dynamics of Geometric Networks (48 Rue Barrault, 75013 Paris - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082075747","display_name":"Laurent Viennot","orcid":"https://orcid.org/0000-0003-3657-6979"},"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Viennot","raw_affiliation_strings":["Inria, Paris, France","DYOGENE - Dynamics of Geometric Networks (48 Rue Barrault, 75013 Paris - France)"],"raw_orcid":"https://orcid.org/0000-0003-3657-6979","affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"DYOGENE - Dynamics of Geometric Networks (48 Rue Barrault, 75013 Paris - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021665812"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07077574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"24","last_page":"27"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/tree","display_name":"Tree (set theory)","score":0.6906524300575256},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6692867279052734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5616464018821716},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5489396452903748},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5458163022994995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.522934079170227},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.48741796612739563},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4857807457447052},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47141122817993164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42848140001296997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3910750150680542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3507223129272461},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.347430944442749},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.23344138264656067},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.16790398955345154},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.13513174653053284}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6906524300575256},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6692867279052734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5616464018821716},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5489396452903748},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5458163022994995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.522934079170227},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.48741796612739563},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4857807457447052},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47141122817993164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42848140001296997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3910750150680542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3507223129272461},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.347430944442749},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.23344138264656067},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.16790398955345154},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.13513174653053284},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3583668.3594568","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04429961v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04429961/document","pdf_url":"https://hal.science/hal-04429961v1/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Jun 2023, Orlando FL, United States. pp.24-27, ⟨10.1145/3583668.3594568⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04429961v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04429961/document","pdf_url":"https://hal.science/hal-04429961v1/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Jun 2023, Orlando FL, United States. pp.24-27, ⟨10.1145/3583668.3594568⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2465436510","display_name":null,"funder_award_id":"ANR-22-CE48-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4715010108","display_name":null,"funder_award_id":"22-CE48-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5838787665","display_name":null,"funder_award_id":"ANR-19-P3IA-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G626190807","display_name":null,"funder_award_id":"19-P3IA-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8318455765","display_name":null,"funder_award_id":"ANR-19","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380875799.pdf","grobid_xml":"https://content.openalex.org/works/W4380875799.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W404046798","https://openalex.org/W1496690131","https://openalex.org/W1513036584","https://openalex.org/W1588736092","https://openalex.org/W1834556589","https://openalex.org/W1999053910","https://openalex.org/W2084346109","https://openalex.org/W2111972027","https://openalex.org/W2528604547","https://openalex.org/W3136290985"],"related_works":["https://openalex.org/W2359807192","https://openalex.org/W2007609084","https://openalex.org/W2227684440","https://openalex.org/W2489256354","https://openalex.org/W2150988524","https://openalex.org/W2366530317","https://openalex.org/W3128587426","https://openalex.org/W2951172905","https://openalex.org/W1963804133","https://openalex.org/W2156833871"],"abstract_inverted_index":{"We":[0,190],"consider":[1,97],"the":[2,29,42,47,55,58,66,74,80,102,173,192,249],"problem":[3],"of":[4,19,31,50,63,149,167,175,187,194,212,214,223,228,248],"collaborative":[5,134],"tree":[6,34,56,81,135],"exploration":[7,76,136,211],"posed":[8],"by":[9,45,53],"Fraigniaud,":[10],"Gasieniec,":[11],"Kowalski,":[12],"and":[13,39,52,94,109,129,152,158,201,210],"Pelc":[14],"[8]":[15,64],"where":[16,205],"a":[17,111,127,176,220,226],"team":[18],"k":[20,157],"agents":[21],"is":[22,251],"tasked":[23],"to":[24,41,73,107],"collectively":[25],"go":[26],"through":[27],"all":[28,147],"edges":[30],"an":[32,98],"unknown":[33],"as":[35,37],"fast":[36],"possible":[38],"return":[40],"root.":[43],"Denoting":[44],"n":[46],"total":[48],"number":[49],"nodes":[51],"D":[54,162],"depth,":[57],"O(n/log(k)":[59],"+":[60,113,115,140,230],"D)":[61,151],"algorithm":[62,77,131],"achieves":[65],"best":[67],"competitive":[68],"ratio":[69],"known":[70],"with":[71,105,160,180,198,225,242],"respect":[72,106],"optimal":[75],"that":[78,132,184],"knows":[79],"in":[82,137,182],"advance,":[83],"which":[84],"takes":[85],"order":[86],"max":[87],"{2n/k,":[88],"2D}":[89],"rounds.":[90],"Brass,":[91],"Cabrera-Mora,":[92],"Gasparri,":[93],"Xiao":[95],"[1]":[96,145],"alternative":[99],"performance":[100,239],"criterion,":[101],"additive":[103],"overhead":[104],"2n/k,":[108],"obtain":[110],"2n/k":[112,139],"O((D":[114],"k)k)":[116],"runtime":[117,227],"guarantee.":[118],"In":[119],"this":[120],"announcement,":[121],"we":[122,218],"present":[123],"'Breadth-First":[124],"Depth-Next'":[125],"(BFDN),":[126],"novel":[128],"simple":[130,177],"performs":[133],"time":[138],"O(D2":[141],"log(k)),":[142],"thus":[143],"outperforming":[144],"for":[146,155,232,240],"values":[148],"(n,":[150],"being":[153],"order-optimal":[154],"fixed":[156],"trees":[159,241],"depth":[161],"=":[163],"o(\u221an).":[164],"The":[165],"proof":[166],"our":[168],"result":[169],"crucially":[170],"relies":[171],"on":[172],"analysis":[174],"two-player":[178],"game":[179],"balls":[181],"urns":[183],"could":[185],"be":[186,208],"independent":[188],"interest.":[189],"extend":[191],"guarantees":[193],"BFDN":[195,224],"to:":[196],"scenarios":[197],"limited":[199],"memory":[200],"communication,":[202],"adversarial":[203],"setups":[204],"robots":[206],"can":[207],"blocked,":[209],"classes":[213],"non-tree":[215],"graphs.":[216],"Finally,":[217],"provide":[219],"recursive":[221],"version":[222,247],"O\u2113(n/k1/\u2113":[229],"log(k)D1+1/\u2113)":[231],"parameter":[233],"\u2113":[234],"\u2265":[235],"1,":[236],"thereby":[237],"improving":[238],"large":[243],"depth.":[244],"A":[245],"complete":[246],"paper":[250],"available":[252],"online":[253],"[2].":[254]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}