{"id":"https://openalex.org/W7165771651","doi":"https://doi.org/10.4230/lipics.sand.2026.26","title":"Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model","display_name":"Brief Announcement: Leader Election with Noisy Reconfigurable Circuits in the Amoebot Model","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165771651","doi":"https://doi.org/10.4230/lipics.sand.2026.26"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26260","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.26/LIPIcs.SAND.2026.26.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.26/LIPIcs.SAND.2026.26.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026983991","display_name":"Daniel Warner","orcid":"https://orcid.org/0000-0002-9423-6094"},"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":"Warner, Daniel","raw_affiliation_strings":["Department of Computer Science, Paderborn University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9423-6094","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Paderborn University, 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":"Scheideler, Christian","raw_affiliation_strings":["Department of Computer Science, Paderborn University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5278-528X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Paderborn University, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75570769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.289900004863739,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.289900004863739,"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/T10142","display_name":"Formal Methods in Verification","score":0.16519999504089355,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.14470000565052032,"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/leader-election","display_name":"Leader election","score":0.7821000218391418},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5455999970436096},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4659999907016754},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.3741999864578247},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.36070001125335693},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.35280001163482666},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.2856000065803528}],"concepts":[{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.7821000218391418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6836000084877014},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5455999970436096},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4659999907016754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4593999981880188},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3075999915599823},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C190839683","wikidata":"https://www.wikidata.org/wiki/Q2448197","display_name":"Train","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C155837451","wikidata":"https://www.wikidata.org/wiki/Q1069144","display_name":"Clock drift","level":5,"score":0.26579999923706055},{"id":"https://openalex.org/C97399411","wikidata":"https://www.wikidata.org/wiki/Q825367","display_name":"Coin flipping","level":2,"score":0.2639999985694885},{"id":"https://openalex.org/C2993101906","wikidata":"https://www.wikidata.org/wiki/Q23768","display_name":"Las vegas","level":3,"score":0.2590999901294708},{"id":"https://openalex.org/C190560348","wikidata":"https://www.wikidata.org/wiki/Q3245116","display_name":"Circuit design","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26260","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.26/LIPIcs.SAND.2026.26.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.26","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.26","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26260","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.26/LIPIcs.SAND.2026.26.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165771651.pdf","grobid_xml":"https://content.openalex.org/works/W7165771651.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Reconfigurable":[0],"circuits":[1],"substantially":[2],"accelerate":[3],"coordination":[4],"tasks":[5],"in":[6,33,48,56,85,109,121],"the":[7,57,110],"geometric":[8],"Amoebot":[9],"model,":[10],"but":[11],"existing":[12],"circuit-based":[13],"leader":[14,80,95],"election":[15,81],"assumes":[16],"perfectly":[17],"reliable":[18],"circuit":[19,35,47,112],"beeps":[20,36,44],"and":[21,139],"provides":[22],"only":[23,115],"Monte":[24],"Carlo":[25],"guarantees.":[26],"We":[27],"introduce":[28],"a":[29,46,49,77,94,131],"natural":[30],"fault":[31],"model":[32,74,113],"which":[34],"are":[37],"noisy:":[38],"whenever":[39],"at":[40],"least":[41],"one":[42],"amoebot":[43,52],"on":[45],"round,":[50],"each":[51],"hears":[53],"that":[54,83,106],"beep":[55],"next":[58],"round":[59],"independently":[60],"with":[61,114,130],"probability":[62],"1-\u03b5,":[63],"while":[64],"direct":[65],"neighbor-to-neighbor":[66],"(pin-to-pin)":[67],"communication":[68],"remains":[69],"reliable.":[70],"In":[71],"this":[72],"noisy-circuit":[73],"we":[75,98],"give":[76],"Las":[78],"Vegas":[79],"algorithm":[82,105],"terminates":[84],"O(\u221a{log":[86,117],"n}":[87],"log":[88],"n)":[89],"rounds":[90],"w.h.p.":[91],"Moreover,":[92],"once":[93],"is":[96,107],"elected,":[97],"show":[99],"how":[100],"to":[101],"simulate":[102],"any":[103],"stationary":[104],"correct":[108],"noiseless":[111],"an":[116],"n})":[118],"multiplicative":[119],"overhead":[120],"running":[122],"time.":[123],"Our":[124],"techniques":[125],"combine":[126],"robust":[127],"flooding/acknowledgment":[128],"primitives":[129],"tree-based":[132],"competition":[133],"framework":[134],"(Euler-tour":[135],"representation,":[136],"randomized":[137],"attrition,":[138],"deterministic":[140],"solitude":[141],"verification).":[142]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-25T00:00:00"}