{"id":"https://openalex.org/W1968094522","doi":"https://doi.org/10.1145/1810479.1810523","title":"A local O(n <sup>2</sup> ) gathering algorithm","display_name":"A local O(n <sup>2</sup> ) gathering algorithm","publication_year":2010,"publication_date":"2010-06-13","ids":{"openalex":"https://openalex.org/W1968094522","doi":"https://doi.org/10.1145/1810479.1810523","mag":"1968094522"},"language":"en","primary_location":{"id":"doi:10.1145/1810479.1810523","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810479.1810523","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-second annual ACM symposium on Parallelism in algorithms and architectures","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/A5066191243","display_name":"Bastian Degener","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bastian Degener","raw_affiliation_strings":["Heinz Nixdorf Institute, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, Paderborn, Germany","institution_ids":["https://openalex.org/I4210152224"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057341664","display_name":"Barbara Kempkes","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Barbara Kempkes","raw_affiliation_strings":["Heinz Nixdorf Institute, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, Paderborn, Germany","institution_ids":["https://openalex.org/I4210152224"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109961260","display_name":"Friedhelm Meyer auf der Heide","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Friedhelm Meyer auf der Heide","raw_affiliation_strings":["Heinz Nixdorf Institute, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, Paderborn, Germany","institution_ids":["https://openalex.org/I4210152224"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066191243"],"corresponding_institution_ids":["https://openalex.org/I4210152224"],"apc_list":null,"apc_paid":null,"fwci":4.2735,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.94230955,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"223"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.972599983215332,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.8300957083702087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5956721901893616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5872083902359009},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5702238082885742},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5204196572303772},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4391222298145294},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2905460596084595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2821540832519531}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.8300957083702087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5956721901893616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5872083902359009},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5702238082885742},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5204196572303772},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4391222298145294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2905460596084595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2821540832519531},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1810479.1810523","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810479.1810523","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-second annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.7876","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.7876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://distcomp.ethz.ch/lectures/fs11/seminar/paper/tobias-2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1531196731","https://openalex.org/W1555199033","https://openalex.org/W1567376369","https://openalex.org/W1569673105","https://openalex.org/W1588762506","https://openalex.org/W1878407411","https://openalex.org/W1970322539","https://openalex.org/W1988889787","https://openalex.org/W2002501738","https://openalex.org/W2010017329","https://openalex.org/W2024735613","https://openalex.org/W2040689398","https://openalex.org/W2041571902","https://openalex.org/W2097569568","https://openalex.org/W2119517221","https://openalex.org/W2144182788","https://openalex.org/W2158669326","https://openalex.org/W2243207363","https://openalex.org/W2771879111","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W2053286651","https://openalex.org/W4386900933","https://openalex.org/W2181743346","https://openalex.org/W2122871747","https://openalex.org/W3114279067"],"abstract_inverted_index":{"The":[0],"gathering":[1,45],"problem,":[2],"where":[3],"n":[4],"autonomous":[5],"robots":[6,29,35],"with":[7,66],"restricted":[8],"capabilities":[9],"are":[10,30],"required":[11],"to":[12,32],"meet":[13],"in":[14,46,49,60],"a":[15,37,55,67],"single":[16],"point":[17],"of":[18,54,57,77],"the":[19,26,75],"plane,":[20],"is":[21],"widely":[22],"studied.":[23],"We":[24],"consider":[25],"case":[27],"that":[28],"limited":[31],"see":[33],"only":[34],"within":[36],"bounded":[38],"vicinity":[39],"and":[40],"present":[41],"an":[42],"algorithm":[43],"achieving":[44],"O(n2)":[47],"rounds":[48],"expectation.":[50],"A":[51],"round":[52],"consists":[53],"movement":[56],"all":[58,78],"robots,":[59],"random":[61],"order.":[62],"All":[63],"previous":[64],"algorithms":[65],"proven":[68],"time":[69],"bound":[70],"assume":[71],"global":[72],"view":[73],"on":[74],"configuration":[76],"robots.":[79]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}