{"id":"https://openalex.org/W2952504335","doi":"https://doi.org/10.1137/16m107877x","title":"Efficient Counting with Optimal Resilience","display_name":"Efficient Counting with Optimal Resilience","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2952504335","doi":"https://doi.org/10.1137/16m107877x","mag":"2952504335"},"language":"en","primary_location":{"id":"doi:10.1137/16m107877x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m107877x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1508.02535","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christoph Lenzen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Joel Rybicki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joel Rybicki","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Jukka Suomela","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jukka Suomela","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4396,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71192706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"46","issue":"4","first_page":"1473","last_page":"1500"},"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.698199987411499,"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.698199987411499,"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/T13553","display_name":"Age of Information Optimization","score":0.0575999990105629,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.030799999833106995,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/resilience","display_name":"Resilience (materials science)","score":0.6133000254631042},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5723999738693237},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.535099983215332},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5250999927520752},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5101000070571899},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4555000066757202},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.43880000710487366},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41920000314712524},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.35409998893737793}],"concepts":[{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.6133000254631042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6018999814987183},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5723999738693237},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.535099983215332},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5250999927520752},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5101000070571899},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4555000066757202},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4223000109195709},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3709999918937683},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C83529365","wikidata":"https://www.wikidata.org/wiki/Q4972103","display_name":"Broadcast communication network","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.32510000467300415},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.31279999017715454},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28850001096725464},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.2856000065803528},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.2671000063419342},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2667999863624573}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/16m107877x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m107877x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1508.02535","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1508.02535","pdf_url":"https://arxiv.org/pdf/1508.02535","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/36724","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/460e3231-6bd7-49f7-b487-39fe1e081ace","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:helda.helsinki.fi:10138/224608","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/224608","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1508.02535","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1508.02535","pdf_url":"https://arxiv.org/pdf/1508.02535","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1942094667","https://openalex.org/W1970745521","https://openalex.org/W1975533944","https://openalex.org/W1992961293","https://openalex.org/W2013801588","https://openalex.org/W2014772227","https://openalex.org/W2039164882","https://openalex.org/W2047541256","https://openalex.org/W2062904677","https://openalex.org/W2077963568","https://openalex.org/W2126924915","https://openalex.org/W2914863966"],"related_works":[],"abstract_inverted_index":{"Consider":[0],"a":[1,12,87,97,106,120],"complete":[2],"communication":[3,128],"network":[4],"of":[5,100,109,123,161],"$n$":[6],"nodes,":[7],"where":[8],"the":[9,18,35,45,73,159],"nodes":[10,31,43],"receive":[11],"common":[13],"clock":[14],"pulse.":[15],"We":[16],"study":[17],"synchronous":[19,74],"$c$-counting":[20],"problem:":[21],"given":[22],"any":[23],"starting":[24],"state":[25,143],"and":[26,125,145,165],"up":[27],"to":[28,38,117],"$f$":[29,92],"faulty":[30],"with":[32,47],"arbitrary":[33],"behavior,":[34],"task":[36],"is":[37],"eventually":[39],"have":[40,82,86,131],"all":[41],"correct":[42],"labeling":[44],"pulses":[46],"increasing":[48],"values":[49],"modulo":[50],"$c$":[51],"in":[52,91,141],"agreement.":[53],"Thus,":[54],"we":[55,68,136,152],"are":[56,60,79],"considering":[57],"algorithms":[58,71,114],"that":[59,77],"self-stabilizing":[61],"despite":[62],"Byzantine":[63],"failures.":[64],"In":[65,134],"this":[66],"work,":[67],"give":[69],"new":[70],"for":[72,148,157],"counting":[75],"problem":[76],"(1)":[78],"deterministic,":[80],"(2)":[81],"optimal":[83],"resilience,":[84],"(3)":[85],"linear":[88],"stabilization":[89],"time":[90],"(asymptotically":[93],"optimal),":[94],"(4)":[95],"use":[96,119],"small":[98,107],"number":[99,108,122,160],"states,":[101],"and,":[102],"consequently,":[103],"(5)":[104],"communicate":[105],"bits":[110,162],"per":[111],"round.":[112],"Prior":[113],"either":[115],"resort":[116],"randomization,":[118],"large":[121],"states":[124],"need":[126],"high":[127],"bandwidth,":[129],"or":[130],"suboptimal":[132],"resilience.":[133],"particular,":[135],"achieve":[137],"an":[138],"exponential":[139],"improvement":[140],"both":[142],"complexity":[144],"message":[146],"size":[147],"deterministic":[149],"algorithms.":[150],"Moreover,":[151],"present":[153],"two":[154],"complementary":[155],"approaches":[156],"reducing":[158],"communicated":[163],"during":[164],"after":[166],"stabilization.":[167]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-01T17:29:45.350535","created_date":"2019-06-27T00:00:00"}