{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:24Z","timestamp":1750221144213,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The London Mathematical Society (LMS)","award":["SC7-1516-11"],"award-info":[{"award-number":["SC7-1516-11"]}]},{"name":"German Research Foundation (DFG)","award":["SFB 901"],"award-info":[{"award-number":["SFB 901"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210399","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"173-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking the $ilde$Omega($sqrt{n})$ Barrier"],"prefix":"10.1145","author":[{"given":"Peter","family":"Robinson","sequence":"first","affiliation":[{"name":"McMaster University, Hamilton, ON, Canada"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}]},{"given":"Alexander","family":"Setzer","sequence":"additional","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050070"},{"key":"e_1_3_2_1_2_1","volume-title":"The Cost of Global Broadcast in Dynamic Radio Networks 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14--17","author":"Ahmadi Mohamad","year":"2015","unstructured":"Mohamad Ahmadi , Abdolhamid Ghodselahi , Fabian Kuhn , and Anisur Rahaman Molla . 2015 . The Cost of Global Broadcast in Dynamic Radio Networks 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14--17 , 2015, Rennes, France. 7:1--7:17. Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, and Anisur Rahaman Molla . 2015. The Cost of Global Broadcast in Dynamic Radio Networks 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14--17, 2015, Rennes, France. 7:1--7:17."},{"key":"e_1_3_2_1_3_1","volume-title":"ALGOSENSORS 2016","author":"Ahmadi Mohamad","year":"2016","unstructured":"Mohamad Ahmadi and Fabian Kuhn . 2016 . Multi-message Broadcast in Dynamic Radio Networks. Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks , ALGOSENSORS 2016 , Aarhus, Denmark, August 25--26 , 2016, Revised Selected Papers. 1--15. Mohamad Ahmadi and Fabian Kuhn . 2016. Multi-message Broadcast in Dynamic Radio Networks. Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25--26, 2016, Revised Selected Papers. 1--15."},{"volume-title":"A Simple Population Protocol for Fast Robust Approximate Majority Proceedings of the 21st International Conference on Distributed Computing (DISC'07)","author":"Angluin Dana","key":"e_1_3_2_1_4_1","unstructured":"Dana Angluin , James Aspnes , and David Eisenstat . 2007. A Simple Population Protocol for Fast Robust Approximate Majority Proceedings of the 21st International Conference on Distributed Computing (DISC'07) . Springer-Verlag , Berlin, Heidelberg , 20--32. http:\/\/dl.acm.org\/citation.cfm?id=2393794.2393801 Dana Angluin, James Aspnes, and David Eisenstat . 2007. A Simple Population Protocol for Fast Robust Approximate Majority Proceedings of the 21st International Conference on Distributed Computing (DISC'07). Springer-Verlag, Berlin, Heidelberg, 20--32. http:\/\/dl.acm.org\/citation.cfm?id=2393794.2393801"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0081-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/090751906"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/983102"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484275"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.10.005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393794.2393802"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277733"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722156"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612677"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884481"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_16_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"55","author":"Berenbrink Petra","year":"2016","unstructured":"Petra Berenbrink , Tom Friedetzky , George Giakkoupis , and Peter Kling . 2016 . Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs)) , Vol. Vol. 55 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 136:1--136:14. Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling . 2016. Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. Vol. 55. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 136:1--136:14."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65956"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989516"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935783"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217061"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843568"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933097"},{"key":"e_1_3_2_1_25_1","volume-title":"Distributed Agreement with Optimal Communication Complexity Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010","author":"Gilbert Seth","year":"2010","unstructured":"Seth Gilbert and Dariusz R . Kowalski . 2010 . Distributed Agreement with Optimal Communication Complexity Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 , Austin, Texas, USA, January 17--19 , 2010 . 965--977. Seth Gilbert and Dariusz R. Kowalski . 2010. Distributed Agreement with Optimal Communication Complexity Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17--19, 2010. 965--977."},{"volume-title":"Urn Models and Their Application","author":"Johnson N. L.","key":"e_1_3_2_1_26_1","unstructured":"N. L. Johnson and S. Kotz . 1977. Urn Models and Their Application . John Wiley & Sons , New York . N. L. Johnson and S. Kotz . 1977. Urn Models and Their Application. John Wiley & Sons, New York."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.77"},{"key":"e_1_3_2_1_29_1","volume-title":"Ordered and Delayed Adversaries and How to Work against Them on Shared Channel. CoRR","author":"Klonowski Marek","year":"2017","unstructured":"Marek Klonowski , Dariusz R. Kowalski , and Jaroslaw Mirek . 2017. Ordered and Delayed Adversaries and How to Work against Them on Shared Channel. CoRR Vol. abs\/ 1706 .08366 ( 2017 ). http:\/\/arxiv.org\/abs\/1706.08366 Marek Klonowski, Dariusz R. Kowalski, and Jaroslaw Mirek . 2017. Ordered and Delayed Adversaries and How to Work against Them on Shared Channel. CoRR Vol. abs\/1706.08366 (2017). http:\/\/arxiv.org\/abs\/1706.08366"},{"key":"e_1_3_2_1_30_1","volume-title":"Comms.","author":"Lamport L","year":"1978","unstructured":"L Lamport and Clocks Time . 1978. the Ordering of Events in a Distributed System , Comms. ( 1978 ). L Lamport and Clocks Time . 1978. the Ordering of Events in a Distributed System, Comms. (1978)."},{"volume-title":"Distributed Algorithms","author":"Nancy Lynch","key":"e_1_3_2_1_31_1","unstructured":"Nancy Lynch . 1996. Distributed Algorithms . Morgan Kaufman Publishers, Inc. , San Francisco, USA. Nancy Lynch . 1996. Distributed Algorithms. Morgan Kaufman Publishers, Inc., San Francisco, USA."},{"volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher M.","key":"e_1_3_2_1_32_1","unstructured":"M. Mitzenmacher and E. Upfal . 2004. Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press . M. Mitzenmacher and E. Upfal . 2004. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_1_34_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system.","author":"Satoshi Nakamoto","year":"2008","unstructured":"Satoshi Nakamoto . 2008 . Bitcoin: A peer-to-peer electronic cash system. (2008). Satoshi Nakamoto . 2008. Bitcoin: A peer-to-peer electronic cash system. (2008)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611479"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_37_1","volume-title":"Breaking the $tilde\u00d8mega(sqrtn)$ Barrier: Fast Consensus under a Late Adversary (full version). ArXiv e-prints","author":"Robinson Peter","year":"2018","unstructured":"Peter Robinson , Christian Scheideler , and Alexander Setzer . 2018. Breaking the $tilde\u00d8mega(sqrtn)$ Barrier: Fast Consensus under a Late Adversary (full version). ArXiv e-prints ( 2018 ). showeprint{arxiv}cs.DC\/1805.00774 https:\/\/arxiv.org\/abs\/1805.00774 Peter Robinson, Christian Scheideler, and Alexander Setzer . 2018. Breaking the $tilde\u00d8mega(sqrtn)$ Barrier: Fast Consensus under a Late Adversary (full version). ArXiv e-prints (2018). showeprint{arxiv}cs.DC\/1805.00774 https:\/\/arxiv.org\/abs\/1805.00774"},{"volume-title":"Probabilistic Methods for Coordination Problems. HNI-Verlagsschriftenreihe 78","author":"C. Scheideler","key":"e_1_3_2_1_38_1","unstructured":"C. Scheideler . 2000. Probabilistic Methods for Coordination Problems. HNI-Verlagsschriftenreihe 78 , University of Paderborn. C. Scheideler . 2000. Probabilistic Methods for Coordination Problems. HNI-Verlagsschriftenreihe 78, University of Paderborn."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135437"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210399"}},"subtitle":["Fast Consensus under a Late Adversary"],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":40,"alternative-id":["10.1145\/3210377.3210399","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210399","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}