{"id":"https://openalex.org/W2152623377","doi":"https://doi.org/10.1145/1921659.1921663","title":"Tree exploration with logarithmic memory","display_name":"Tree exploration with logarithmic memory","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2152623377","doi":"https://doi.org/10.1145/1921659.1921663","mag":"2152623377"},"language":"en","primary_location":{"id":"doi:10.1145/1921659.1921663","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1921659.1921663","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5085876663","display_name":"Christoph Amb\u00fchl","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Christoph Amb\u00fchl","raw_affiliation_strings":["University of Liverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052366414","display_name":"Leszek G\u0105sieniec","orcid":"https://orcid.org/0000-0003-1809-9814"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leszek G\u0105sieniec","raw_affiliation_strings":["University of Liverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","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":["Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I33217400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070579616","display_name":"Tomasz Radzik","orcid":"https://orcid.org/0000-0002-7776-5461"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tomasz Radzik","raw_affiliation_strings":["King's College London, London, UK"],"affiliations":[{"raw_affiliation_string":"King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044176695","display_name":"Xiaohui Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xiaohui Zhang","raw_affiliation_strings":["University of Liverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5085876663"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":8.7519,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.98056696,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"2","first_page":"1","last_page":"21"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973999857902527,"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/tree-traversal","display_name":"Tree traversal","score":0.7907008528709412},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6321220397949219},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5956087708473206},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5797566175460815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5737401843070984},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5417720675468445},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5309547781944275},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4401305913925171},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4210512340068817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3995700180530548},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39950984716415405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3439534902572632},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3347918391227722},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2994209825992584}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7907008528709412},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6321220397949219},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5956087708473206},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5797566175460815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5737401843070984},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5417720675468445},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5309547781944275},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4401305913925171},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4210512340068817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3995700180530548},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39950984716415405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3439534902572632},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3347918391227722},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2994209825992584},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1921659.1921663","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1921659.1921663","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/78d31db3-b08a-4862-90a5-3c4ad1403dca","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/78d31db3-b08a-4862-90a5-3c4ad1403dca","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ambuehl, C, Gasieniec, L, Pelc, A, Radzik, T & Zhang, X 2011, 'Tree Exploration with Logarithmic Memory', Acm Transactions On Algorithms, vol. 7, no. 2, 17. https://doi.org/10.1145/1921659.1921663","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3113406164","display_name":null,"funder_award_id":"EP/D060354/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7986880715","display_name":null,"funder_award_id":"IJP-2007/R1","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W36702847","https://openalex.org/W108165974","https://openalex.org/W1531657024","https://openalex.org/W1564744283","https://openalex.org/W2010371907","https://openalex.org/W2011438986","https://openalex.org/W2017617294","https://openalex.org/W2017716370","https://openalex.org/W2019755546","https://openalex.org/W2024957346","https://openalex.org/W2039936247","https://openalex.org/W2040188343","https://openalex.org/W2045648565","https://openalex.org/W2046427295","https://openalex.org/W2049516232","https://openalex.org/W2051193227","https://openalex.org/W2065686270","https://openalex.org/W2070042895","https://openalex.org/W2077944048","https://openalex.org/W2086814302","https://openalex.org/W2095518199","https://openalex.org/W2117019228","https://openalex.org/W2147342018","https://openalex.org/W2148369462","https://openalex.org/W2149735608","https://openalex.org/W2149888497","https://openalex.org/W2154255883","https://openalex.org/W2156184725","https://openalex.org/W2611754984","https://openalex.org/W4241060902"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2366394613","https://openalex.org/W2152421698","https://openalex.org/W3139820740","https://openalex.org/W1983915440","https://openalex.org/W1994598067","https://openalex.org/W4367665025","https://openalex.org/W2010914215","https://openalex.org/W3095925971"],"abstract_inverted_index":{"We":[0,97,149],"consider":[1],"the":[2,36,41,62,65,84,120,141,176],"task":[3],"of":[4,24,40,61,64,68,89,179],"network":[5,26,42,66,85],"exploration":[6,104],"by":[7],"a":[8,25,58,161],"mobile":[9],"agent":[10,16,55],"(robot)":[11],"with":[12],"small":[13],"memory.":[14],"The":[15,54],"has":[17,56],"to":[18,35,95,101,160],"traverse":[19],"all":[20,114],"nodes":[21,74],"and":[22,33,45,71,139],"edges":[23],"(represented":[27],"as":[28],"an":[29,99],"undirected":[30],"connected":[31],"graph),":[32],"return":[34],"starting":[37],"node.":[38,53],"Nodes":[39],"are":[43,48,170,182],"unlabeled":[44],"edge":[46],"ports":[47,166],"locally":[49],"labeled":[50],"at":[51,167],"each":[52,168],"no":[57],"priori":[59],"knowledge":[60],"topology":[63],"or":[67],"its":[69],"size,":[70],"cannot":[72],"mark":[73],"in":[75,83,164,172],"any":[76],"way.":[77],"Under":[78],"such":[79],"weak":[80],"assumptions,":[81],"cycles":[82],"may":[86],"prevent":[87],"feasibility":[88],"exploration,":[90,138],"hence":[91],"we":[92],"restrict":[93],"attention":[94],"trees.":[96,117],"present":[98],"algorithm":[100],"accomplish":[102],"tree":[103,137],"(with":[105],"return)":[106],"using":[107],"O":[108,128,153],"(log":[109,129,154],"n":[110,115,131,155],")-bit":[111,132,156],"memory":[112,133,145,157],"for":[113,136],"-node":[116],"This":[118],"strengthens":[119],"result":[121],"from":[122],"Diks":[123],"et":[124],"al.":[125],"[2004],":[126],"where":[127],"2":[130],"was":[134],"used":[135],"matches":[140],"lower":[142],"bound":[143],"on":[144],"size":[146],"proved":[147],"there.":[148],"also":[150],"extend":[151],"our":[152],"traversal":[158],"mechanism":[159],"weaker":[162],"model":[163],"which":[165],"node":[169],"ordered":[171],"circular":[173],"manner,":[174],"however,":[175],"explicit":[177],"values":[178],"port":[180],"numbers":[181],"not":[183],"available.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}