{"id":"https://openalex.org/W7119195006","doi":"https://doi.org/10.1137/1.9781611978971.24","title":"Space-efficient population protocols for exact majority on general graphs","display_name":"Space-efficient population protocols for exact majority on general graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7119195006","doi":"https://doi.org/10.1137/1.9781611978971.24"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.24","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.24","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"conference-paper","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/A5091604054","display_name":"Joel Rybicki","orcid":"https://orcid.org/0000-0002-6432-6646"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joel Rybicki","raw_affiliation_strings":["Humboldt University of Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt University of Berlin","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122185609","display_name":"Jakob Solnerzik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jakob Solnerzik","raw_affiliation_strings":["Humboldt University of Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt University of Berlin","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021256988","display_name":"Olivier Stietel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Olivier Stietel","raw_affiliation_strings":["Humboldt University of Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt University of Berlin","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039607367","display_name":"Robin Vacus","orcid":"https://orcid.org/0000-0002-7368-4912"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robin Vacus","raw_affiliation_strings":["Humboldt University of Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt University of Berlin","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05598932,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"574","last_page":"612"},"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.927299976348877,"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.927299976348877,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.04230000078678131,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.0052999998442828655,"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/population","display_name":"Population","score":0.5979999899864197},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5198000073432922},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.43470001220703125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41530001163482666},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41370001435279846},{"id":"https://openalex.org/keywords/majority-rule","display_name":"Majority rule","score":0.374099999666214}],"concepts":[{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5979999899864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5490999817848206},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5198000073432922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.451200008392334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.446399986743927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4406000077724457},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41530001163482666},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C153668964","wikidata":"https://www.wikidata.org/wiki/Q27636","display_name":"Majority rule","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3368000090122223},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3158999979496002},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.30070000886917114},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2632000148296356}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.24","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.24","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"exact":[2,46],"majority":[3,47,77],"consensus":[4,48],"in":[5,27],"the":[6,13,45,58,76],"population":[7],"protocol":[8,64],"model.":[9],"In":[10,44],"this":[11],"model,":[12],"system":[14],"is":[15,52,60],"described":[16],"by":[17],"a":[18,31,37,54,63,69],"graph":[19],"\\(G":[20],"=":[21],"(V,E)\\)":[22],"with":[23],"n":[24],"nodes,":[25],"and":[26,57],"each":[28,50],"time":[29],"step,":[30],"scheduler":[32],"samples":[33],"uniformly":[34],"at":[35],"random":[36],"pair":[38],"of":[39],"adjacent":[40],"nodes":[41,74],"to":[42,61],"interact.":[43],"task,":[49],"node":[51],"given":[53],"binary":[55],"input,":[56],"goal":[59],"design":[62],"that":[65],"almost":[66],"surely":[67],"reaches":[68],"stable":[70],"configuration,":[71],"where":[72],"all":[73],"output":[75],"input":[78],"value.":[79]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-08T00:00:00"}