{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:22:55Z","timestamp":1771485775544,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"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,2]]},"DOI":"10.1145\/3564246.3585243","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1777-1790","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Faster Deterministic Distributed MIS and Approximate Matching"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Christoph","family":"Grunau","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0159"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science (FOCS). 364\u2013369","author":"Awerbuch B.","unstructured":"B. Awerbuch , A. V. Goldberg , M. Luby , and S. A. Plotkin . 1989. Network Decomposition and Locality in Distributed Computation . In Proc. 30th IEEE Symp. on Foundations of Computer Science (FOCS). 364\u2013369 . B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In Proc. 30th IEEE Symp. on Foundations of Computer Science (FOCS). 364\u2013369."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00037"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3404504"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_37"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00376-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467933"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188964"},{"key":"e_1_3_2_1_11_1","volume-title":"Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. In IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Elkin Michael","year":"2022","unstructured":"Michael Elkin , Bernhard Haeupler , V\u00e1clav Rozho\u0148 , and Christoph Grunau . 2022 . Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. In IEEE Symposium on Foundations of Computer Science (FOCS). to appear, arXiv:2204.08254. Michael Elkin, Bernhard Haeupler, V\u00e1clav Rozho\u0148, and Christoph Grunau. 2022. Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. In IEEE Symposium on Foundations of Computer Science (FOCS). to appear, arXiv:2204.08254."},{"key":"e_1_3_2_1_12_1","volume-title":"Distributed Strong Diameter Network Decomposition. In ACM Symp. on Principles of Distributed Computing (PODC). 211\u2013216","author":"Elkin Michael","year":"2016","unstructured":"Michael Elkin and Ofer Neiman . 2016 . Distributed Strong Diameter Network Decomposition. In ACM Symp. on Principles of Distributed Computing (PODC). 211\u2013216 . Michael Elkin and Ofer Neiman. 2016. Distributed Strong Diameter Network Decomposition. In ACM Symp. on Principles of Distributed Computing (PODC). 211\u2013216."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch168"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0344-4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.25"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520039"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch97"},{"key":"e_1_3_2_1_18_1","volume-title":"Improved Deterministic Network Decomposition. In ACM-SIAM Symp. on Discrete Algorithms (SODA). 2904\u20132923","author":"Ghaffari Mohsen","year":"2021","unstructured":"Mohsen Ghaffari , Christoph Grunau , and Vaclav Rozhon . 2021 . Improved Deterministic Network Decomposition. In ACM-SIAM Symp. on Discrete Algorithms (SODA). 2904\u20132923 . Mohsen Ghaffari, Christoph Grunau, and Vaclav Rozhon. 2021. Improved Deterministic Network Decomposition. In ACM-SIAM Symp. on Discrete Algorithms (SODA). 2904\u20132923."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00069"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 62nd IEEE Symp. on Foundations of Computer Science (FOCS). 1009\u20131020","author":"Ghaffari Mohsen","year":"2021","unstructured":"Mohsen Ghaffari and Fabian Kuhn . 2021 . Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition . In Proc. 62nd IEEE Symp. on Foundations of Computer Science (FOCS). 1009\u20131020 . Mohsen Ghaffari and Fabian Kuhn. 2021. Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. In Proc. 62nd IEEE Symp. on Foundations of Computer Science (FOCS). 1009\u20131020."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100373121"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00048"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01303516"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90033-S"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486180"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129769"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585243","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:02Z","timestamp":1750178822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":32,"alternative-id":["10.1145\/3564246.3585243","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585243","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}