{"id":"https://openalex.org/W2114986147","doi":"https://doi.org/10.1145/1073814.1073826","title":"On the locality of bounded growth","display_name":"On the locality of bounded growth","publication_year":2005,"publication_date":"2005-07-17","ids":{"openalex":"https://openalex.org/W2114986147","doi":"https://doi.org/10.1145/1073814.1073826","mag":"2114986147"},"language":"en","primary_location":{"id":"doi:10.1145/1073814.1073826","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073814.1073826","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 Principles of distributed computing","raw_type":"proceedings-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/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041937385","display_name":"Thomas Moscibroda","orcid":"https://orcid.org/0000-0002-8729-7841"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thomas Moscibroda","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113667148","display_name":"Rogert Wattenhofer","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rogert Wattenhofer","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023808567"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":17.8428,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.99625576,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"60","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9990000128746033,"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/bounded-function","display_name":"Bounded function","score":0.7926119565963745},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6038393974304199},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5919632911682129},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5508393049240112},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5299514532089233},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4736189544200897},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4344730079174042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4344088137149811},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4342823028564453},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4324629008769989},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4213871955871582},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3563031852245331},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34536439180374146}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7926119565963745},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6038393974304199},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5919632911682129},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5508393049240112},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5299514532089233},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4736189544200897},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4344730079174042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4344088137149811},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4342823028564453},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4324629008769989},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4213871955871582},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3563031852245331},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34536439180374146},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1145/1073814.1073826","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073814.1073826","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 Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W81816231","https://openalex.org/W100489996","https://openalex.org/W1523004878","https://openalex.org/W1977066974","https://openalex.org/W1988686528","https://openalex.org/W1996066664","https://openalex.org/W1998137177","https://openalex.org/W1998544343","https://openalex.org/W2000876023","https://openalex.org/W2005580106","https://openalex.org/W2022191808","https://openalex.org/W2034188144","https://openalex.org/W2035506862","https://openalex.org/W2053578961","https://openalex.org/W2054910423","https://openalex.org/W2067661972","https://openalex.org/W2085463780","https://openalex.org/W2092534058","https://openalex.org/W2096035763","https://openalex.org/W2100061495","https://openalex.org/W2109764756","https://openalex.org/W2127248062","https://openalex.org/W2127622665","https://openalex.org/W2129295346","https://openalex.org/W2145797586","https://openalex.org/W2148570604","https://openalex.org/W2165441947","https://openalex.org/W2169102947","https://openalex.org/W2169140571","https://openalex.org/W2583644876"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W78560857","https://openalex.org/W4389820491","https://openalex.org/W2521054645"],"abstract_inverted_index":{"Many":[0],"large-scale":[1],"networks":[2],"such":[3],"as":[4],"ad":[5],"hoc":[6],"and":[7,88],"sensor":[8],"networks,":[9,11],"peer-to-peer":[10],"or":[12],"the":[13,16,19,68,81,111],"Internet":[14],"have":[15],"property":[17],"that":[18,44,79,113,126],"number":[20],"of":[21,32,61,71,120],"independent":[22],"nodes":[23,114],"does":[24],"not":[25],"grow":[26],"arbitrarily":[27],"when":[28],"looking":[29],"at":[30],"neighborhoods":[31],"increasing":[33],"size.":[34],"Due":[35],"to":[36,49,65,133],"this":[37,62],"bounded":[38],"\"volume":[39],"growth,\"":[40],"one":[41],"could":[42],"expect":[43],"distributed":[45,69],"algorithms":[46,146],"are":[47,115],"able":[48],"solve":[50],"many":[51,148],"problems":[52,72],"more":[53,103],"efficiently":[54],"than":[55],"on":[56,73,80,110],"general":[57,104],"graphs.":[58,76],"The":[59],"goal":[60],"paper":[63],"is":[64,108,131],"help":[66],"understanding":[67],"complexity":[70],"\"bounded":[74],"growth\"":[75],"We":[77],"show":[78,125],"widely":[82],"used":[83],"unit":[84],"disk":[85],"graph,":[86],"covering":[87],"packing":[89],"linear":[90],"programs":[91],"can":[92],"be":[93],"approximated":[94],"by":[95],"constant":[96,99,121],"factors":[97],"in":[98,116,127,141],"time.":[100],"For":[101],"a":[102,117,135],"network":[105],"model":[106],"which":[107],"based":[109],"assumption":[112],"metric":[118],"space":[119],"doubling":[122],"dimension,":[123],"we":[124],"O(log*!n)":[128,144],"rounds":[129],"it":[130],"possible":[132],"construct":[134],"(O(1),":[136],"O(1))-network":[137],"decomposition.":[138],"This":[139],"results":[140],"asymptotically":[142],"optimal":[143],"time":[145],"for":[147],"important":[149],"problems.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}