{"id":"https://openalex.org/W2029568832","doi":"https://doi.org/10.1145/2611462.2611463","title":"Trade-offs between selection complexity and performance when searching the plane without communication","display_name":"Trade-offs between selection complexity and performance when searching the plane without communication","publication_year":2014,"publication_date":"2014-07-15","ids":{"openalex":"https://openalex.org/W2029568832","doi":"https://doi.org/10.1145/2611462.2611463","mag":"2029568832"},"language":"en","primary_location":{"id":"doi:10.1145/2611462.2611463","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2611462.2611463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 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/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["MIT, Cmabridge, MA, USA","MIT, Cmabridge, MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cmabridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cmabridge, MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071944803","display_name":"Nancy Lynch","orcid":"https://orcid.org/0000-0003-3045-265X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nancy Lynch","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078649776","display_name":"Calvin Newport","orcid":"https://orcid.org/0009-0006-0353-8254"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Calvin Newport","raw_affiliation_strings":["Georgetown University, Washington D.C., DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington D.C., DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029015236","display_name":"Tsvetomira Radeva","orcid":"https://orcid.org/0000-0001-7179-0706"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tsvetomira Radeva","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006005471"],"corresponding_institution_ids":["https://openalex.org/I4210110987","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":6.8962,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.97080292,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"252","last_page":"261"},"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/binary-logarithm","display_name":"Binary logarithm","score":0.6992734670639038},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6873713731765747},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6777691841125488},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6683181524276733},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6510186791419983},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6363487243652344},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6031888127326965},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5208771228790283},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5009934902191162},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4749579429626465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4707266390323639},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4655137062072754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4380418062210083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3999141752719879},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3363889753818512},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3309740126132965},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17082631587982178}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6992734670639038},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6873713731765747},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6777691841125488},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6683181524276733},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6510186791419983},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6363487243652344},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6031888127326965},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5208771228790283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5009934902191162},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4749579429626465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4707266390323639},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4655137062072754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4380418062210083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3999141752719879},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3363889753818512},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3309740126132965},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17082631587982178},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2611462.2611463","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2611462.2611463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1513799234","https://openalex.org/W1523665192","https://openalex.org/W1556814728","https://openalex.org/W1844529830","https://openalex.org/W1873892361","https://openalex.org/W1964024785","https://openalex.org/W1984727163","https://openalex.org/W2002942860","https://openalex.org/W2008110774","https://openalex.org/W2017716370","https://openalex.org/W2019154292","https://openalex.org/W2029568832","https://openalex.org/W2049717114","https://openalex.org/W2052474723","https://openalex.org/W2053831174","https://openalex.org/W2069970157","https://openalex.org/W2088352008","https://openalex.org/W2096295934","https://openalex.org/W2100451855","https://openalex.org/W2101101965","https://openalex.org/W2144433568","https://openalex.org/W2149888497","https://openalex.org/W2160504298","https://openalex.org/W2166162093","https://openalex.org/W2621324178","https://openalex.org/W2751862591","https://openalex.org/W2769725448","https://openalex.org/W4254598619","https://openalex.org/W4300353561","https://openalex.org/W7029258064"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857","https://openalex.org/W1941306591"],"abstract_inverted_index":{"We":[0,99,118,132,175],"argue":[1],"that":[2,138,177,184],"in":[3,9,12,42,107],"the":[4,16,27,55,75,87,108,116,197,214],"context":[5],"of":[6,19,32,77,89,95,142],"biology-inspired":[7],"problems":[8],"computer":[10],"science,":[11],"addition":[13],"to":[14,25,40,213],"studying":[15],"time":[17],"complexity":[18,51,130],"solutions":[20],"it":[21],"is":[22,39,74,157,180,199],"also":[23],"important":[24],"study":[26],"selection":[28,50,129],"complexity,":[29],"a":[30,35,49,105,124,134,210],"measure":[31],"how":[33],"likely":[34],"given":[36],"algorithmic":[37],"strategy":[38],"arise":[41],"nature.":[43],"In":[44],"this":[45,178],"spirit,":[46],"we":[47,64],"propose":[48],"metric":[52],"\u03c7":[53],"for":[54,104,127,147],"ANTS":[56],"problem":[57],"[Feinerman":[58],"et":[59],"al.].":[60],"For":[61],"algorithm":[62],"A,":[63],"define":[65],"\u03c7(A)":[66,148,171,186],"=":[67,172],"b":[68,73],"+":[69,154,217],"log":[70,120,121,151,152,188,189],"l,":[71],"where":[72],"number":[76],"memory":[78],"bits":[79],"used":[80],"by":[81,182],"each":[82,203],"agent":[83,204],"and":[84],"l":[85],"bounds":[86],"fineness":[88],"available":[90],"probabilities":[91,94],"(agents":[92],"use":[93],"at":[96],"least":[97],"1/2l).":[98],"consider":[100],"n":[101],"agents":[102],"searching":[103],"target":[106,198],"plane,":[109],"within":[110],"an":[111],"(unknown)":[112],"distance":[113],"D":[114,122,153,190],"from":[115],"origin.":[117],"identify":[119],"as":[123],"crucial":[125],"threshold":[126,179],"our":[128],"metric.":[131],"prove":[133],"new":[135],"upper":[136],"bound":[137],"achieves":[139],"near-optimal":[140],"speed-up":[141,169],"(D2/n":[143],"+D)":[144],"\u22c5":[145],"2O(l)":[146],"\u2264":[149],"3":[150],"O(1),":[155],"which":[156],"asymptotically":[158],"optimal":[159],"if":[160,185,202],"l\u2208":[161],"O(1).":[162],"By":[163],"comparison,":[164],"previous":[165],"algorithms":[166],"achieving":[167],"similar":[168],"require":[170],"\u03a9(log":[173],"D).":[174],"show":[176],"tight":[181],"proving":[183],"<":[187],"-":[191],"\u03c9(1),":[192],"then":[193],"with":[194],"high":[195],"probability":[196],"not":[200],"found":[201],"performs":[205],"D2-o(1)":[206],"moves.":[207],"This":[208],"constitutes":[209],"sizable":[211],"gap":[212],"straightforward":[215],"\u03a9(D2/n":[216],"D)":[218],"lower":[219],"bound.":[220]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}