{"id":"https://openalex.org/W4399375396","doi":"https://doi.org/10.1145/3662158.3662776","title":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter","display_name":"Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter","publication_year":2024,"publication_date":"2024-06-05","ids":{"openalex":"https://openalex.org/W4399375396","doi":"https://doi.org/10.1145/3662158.3662776"},"language":"en","primary_location":{"id":"doi:10.1145/3662158.3662776","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3662158.3662776","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3662158.3662776?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3662158.3662776?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055096967","display_name":"Andreas Padalkin","orcid":"https://orcid.org/0000-0002-4601-9597"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Padalkin","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Scheideler","raw_affiliation_strings":["Paderborn University, Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055096967"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.615,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66596597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13429","display_name":"Electricity Theft Detection Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13429","display_name":"Electricity Theft Detection Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10917","display_name":"Smart Grid Security and Resilience","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/computer-science","display_name":"Computer science","score":0.6952366232872009},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6204828023910522},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5443938374519348},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4282046854496002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4020256996154785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33094722032546997},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0841960608959198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05251684784889221}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6952366232872009},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6204828023910522},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5443938374519348},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4282046854496002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4020256996154785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33094722032546997},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0841960608959198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05251684784889221}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3662158.3662776","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3662158.3662776","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3662158.3662776?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3662158.3662776","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3662158.3662776","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3662158.3662776?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.4099999964237213,"display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G1544232361","display_name":null,"funder_award_id":"592/10-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G762232396","display_name":null,"funder_award_id":"Project","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399375396.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1895781671","https://openalex.org/W1984090926","https://openalex.org/W2027032283","https://openalex.org/W2041222862","https://openalex.org/W2072446943","https://openalex.org/W2083323175","https://openalex.org/W2102334337","https://openalex.org/W2474103057","https://openalex.org/W2963533232","https://openalex.org/W3001053786","https://openalex.org/W3117534020","https://openalex.org/W3126827766","https://openalex.org/W3139505564","https://openalex.org/W3159559857","https://openalex.org/W3182175832","https://openalex.org/W3216836550","https://openalex.org/W4221121560","https://openalex.org/W4226519231","https://openalex.org/W4386694355","https://openalex.org/W4389990927","https://openalex.org/W4391988073","https://openalex.org/W6947738296"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"In":[0],"this":[1,51,80],"paper,":[2,52],"we":[3],"study":[4],"the":[5,11,42,48,72,77,94],"computation":[6],"of":[7,50,76,97],"shortest":[8,58],"paths":[9,23],"within":[10],"geometric":[12],"amoebot":[13,64,81],"model,":[14],"a":[15],"commonly":[16],"used":[17],"model":[18,78],"for":[19,26],"programmable":[20,43],"matter.":[21],"Shortest":[22],"are":[24],"essential":[25],"various":[27],"tasks":[28],"and":[29],"therefore":[30],"have":[31,56],"been":[32],"heavily":[33],"investigated":[34],"in":[35,41],"many":[36],"different":[37],"contexts.":[38],"For":[39],"example,":[40],"matter":[44],"context,":[45],"which":[46],"is":[47,83],"focus":[49],"Kostitsyna":[53],"et":[54],"al.":[55],"utilized":[57],"path":[59],"trees":[60],"to":[61,85],"transform":[62],"one":[63],"structure":[65,82],"into":[66],"another":[67],"[DISC,":[68],"2023].":[69],"We":[70],"consider":[71],"reconfigurable":[73],"circuit":[74],"extension":[75],"where":[79],"able":[84],"interconnect":[86],"amoebots":[87],"by":[88],"so-called":[89],"circuits.":[90],"These":[91],"circuits":[92],"permit":[93],"instantaneous":[95],"transmission":[96],"simple":[98],"signals":[99],"between":[100],"connected":[101],"amoebots.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}