{"department":[{"_id":"DaAl"}],"article_type":"original","scopus_import":1,"external_id":{"arxiv":["1705.06173"]},"article_processing_charge":"Yes","language":[{"iso":"eng"}],"has_accepted_license":"1","ddc":["000"],"oa":1,"publisher":"ACM","volume":66,"ec_funded":1,"file":[{"content_type":"application/pdf","relation":"main_file","checksum":"7e5d95c478e0e393f4927fcf7e48194e","file_size":2183085,"access_level":"open_access","creator":"dernst","file_id":"6975","file_name":"2019_JACM_Lenzen.pdf","date_updated":"2020-07-14T12:47:46Z","date_created":"2019-10-25T12:58:38Z"}],"year":"2019","type":"journal_article","month":"09","citation":{"short":"C. Lenzen, J. Rybicki, Journal of the ACM 66 (2019).","ieee":"C. Lenzen and J. Rybicki, “Self-stabilising Byzantine clock synchronisation is almost as easy as consensus,” Journal of the ACM, vol. 66, no. 5. ACM, 2019.","ama":"Lenzen C, Rybicki J. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 2019;66(5). doi:10.1145/3339471","chicago":"Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3339471.","mla":"Lenzen, Christoph, and Joel Rybicki. “Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.” Journal of the ACM, vol. 66, no. 5, 32, ACM, 2019, doi:10.1145/3339471.","ista":"Lenzen C, Rybicki J. 2019. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 66(5), 32.","apa":"Lenzen, C., & Rybicki, J. (2019). Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. ACM. https://doi.org/10.1145/3339471"},"publication_identifier":{"issn":["0004-5411"]},"quality_controlled":"1","_id":"6972","oa_version":"Published Version","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"title":"Self-stabilising Byzantine clock synchronisation is almost as easy as consensus","publication":"Journal of the ACM","status":"public","doi":"10.1145/3339471","article_number":"32","publication_status":"published","date_published":"2019-09-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of thennodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e.,the initial state of the system may be arbitrary, and there can be up to f