{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:04:16Z","timestamp":1756310656125,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594598","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"180-189","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Near-Optimal Deterministic Distributed Synchronizer"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4213-9898","authenticated-orcid":false,"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6020-8469","authenticated-orcid":false,"given":"Anton","family":"Trygub","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_2_1","volume-title":"ACM symposium on Theory of Computing (STOC). 557--570","author":"Awerbuch Baruch","year":"1992","unstructured":"Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, and Michael Saks. 1992. Adapting to asynchronous dynamic networks. In ACM symposium on Theory of Computing (STOC). 557--570."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89572"},{"key":"e_1_3_2_1_4_1","volume-title":"Sparse Partitions. In IEEE Symposium on Foundations of Computer Science (FOCS). 503--513","author":"Awerbuch Baruch","year":"1990","unstructured":"Baruch Awerbuch and David Peleg. 1990. Sparse Partitions. In IEEE Symposium on Foundations of Computer Science (FOCS). 503--513."},{"key":"e_1_3_2_1_5_1","volume-title":"An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. In International Symposium on Distributed Computing (DISC).","author":"Dufoulon Fabien","year":"2022","unstructured":"Fabien Dufoulon, Shay Kutten, William K Moses Jr, Gopal Pandurangan, and David Peleg. 2022. An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00069"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087827"},{"key":"e_1_3_2_1_8_1","volume-title":"Singularly Near Optimal Leader Election in Asynchronous Networks. In International Symposium on Distributed Computing (DISC).","author":"Kutten Shay","year":"2021","unstructured":"Shay Kutten, William K Moses Jr, Gopal Pandurangan, and David Peleg. 2021. Singularly Near Optimal Leader Election in Asynchronous Networks. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01303516"},{"key":"e_1_3_2_1_11_1","volume-title":"International Symposium on Distributed Computing (DISC).","author":"Mashreghi Ali","year":"2019","unstructured":"Ali Mashreghi and Valerie King. 2019. Brief announcement: Faster asynchronous MST and low diameter tree construction with sublinear communication. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_12_1","volume-title":"Spanners. https:\/\/www.cs.bgu.ac.il\/~elkinm\/awer.pdf. Accessed","author":"Elkin Michael","year":"2023","unstructured":"Michael Elkin. [n. d.]. Synchronizers, Spanners. https:\/\/www.cs.bgu.ac.il\/~elkinm\/awer.pdf. Accessed: January 8, 2023."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"PODC '23"},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594598","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":14,"alternative-id":["10.1145\/3583668.3594598","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594598","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}