{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:18Z","timestamp":1750309458343,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T00:00:00Z","timestamp":1735948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1955939"],"award-info":[{"award-number":["1955939"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education, Government of India","award":["F.16-13\/2017-TEL\/2022\/29"],"award-info":[{"award-number":["F.16-13\/2017-TEL\/2022\/29"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,4]]},"DOI":"10.1145\/3700838.3700872","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"152-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Deterministic Massively Parallel Ruling Sets Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6610-844X","authenticated-orcid":false,"given":"Hongyan","family":"Ji","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Iowa, Iowa City, Iowa, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5523-4494","authenticated-orcid":false,"given":"Kishore","family":"Kothapalli","sequence":"additional","affiliation":[{"name":"Center for Security, Theory, and Algorithmic Research, IIIT Hyderabad, Hyderabad, Telangana, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0834-3476","authenticated-orcid":false,"given":"Sriram V","family":"Pemmaraju","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Iowa, Iowa City, Iowa, United States"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9767-031X","authenticated-orcid":false,"given":"Ajitanshu","family":"Singh","sequence":"additional","affiliation":[{"name":"Center for Security, Theory, and Algorithmic Research, IIIT Hyderabad, Hyderabad, Telangana, India"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Noga Alon L\u00e1szl\u00f3 Babai and Alon Itai. 1986. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7 4 (1986) 567\u2013583.","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331609"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611512"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2023.11"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Keren Censor-Hillel Merav Parter and Gregory Schwartzman. 2020. Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33 3-4 (2020) 349\u2013366. 10.1007\/S00446-020-00376-1","DOI":"10.1007\/S00446-020-00376-1"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"A. Ching S. Edunov M. Kabiljo D. Logothetis and S. Muthukrishnan. 2015. One trillion edges: Graph processing at facebook-scale. Proc. VLDB Endow. 8 (2015) 1804\u20131815.","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400282"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Artur Czumaj Peter Davies and Merav Parter. 2021. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17 2 (2021) 16:1\u201316:27.","DOI":"10.1145\/3451992"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"J. Dean and S. Ghemawat. 2008. Mapreduce: Simplified data processing on large clusters. Commun. ACM 51 (2008) 107\u2013113.","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591081"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087830"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310534"},{"key":"e_1_3_3_2_14_2","first-page":"523","volume-title":"Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing","author":"Giliberti Jeff","year":"2024","unstructured":"Jeff Giliberti and Zahra Parsaeian. 2024. Massively Parallel Ruling Set Made Deterministic (See also https:\/\/arxiv.org\/abs\/2406.12727). In Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, New York, NY, United States, 523\u2013526."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_35"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_3_3_2_17_2","first-page":"28","volume-title":"40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","volume":"182","author":"Kothapalli Kishore","year":"2020","unstructured":"Kishore Kothapalli, Shreyas Pai, and Sriram\u00a0V Pemmaraju. 2020. Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science , Vol.\u00a0182. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Oktavie-Allee, Wadern, Germany, 28\u20131."},{"key":"e_1_3_3_2_18_2","first-page":"136","volume-title":"32nd International Conference on Foundations of Software Technology and Theoretical Computer Science","author":"Kothapalli Kishore","year":"2012","unstructured":"Kishore Kothapalli and Sriram Pemmaraju. 2012. Super-Fast 3-Ruling Sets. In 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Oktavie-Allee, Wadern, Germany, 136."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594579"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538472"},{"key":"e_1_3_3_2_23_2","first-page":"3","volume-title":"32nd International Symposium on Distributed Computing","author":"Parter Merav","year":"2018","unstructured":"Merav Parter and Eylon Yogev. 2018. Congested Clique Algorithms for Graph Spanners. In 32nd International Symposium on Distributed Computing. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Germany, 3."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"M. Zaharia R.\u00a0S. Xin P. Wendell T. Das M. Armbrust A. Dave X. Meng J. Rosen M.\u00a0J.\u00a0Franklin S.\u00a0Venkataraman A. Ghodsi J. Gonzalez S. Shenker and I. Stoica. 2016. Apache spark: A unified engine for big data processing. Commun. ACM 59 (2016) 56\u201365.","DOI":"10.1145\/2934664"}],"event":{"name":"ICDCN 2025: 26th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2025","location":"Hyderabad India"},"container-title":["Proceedings of the 26th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700872","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700872","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:22Z","timestamp":1750295422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":24,"alternative-id":["10.1145\/3700838.3700872","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3700872","relation":{},"subject":[],"published":{"date-parts":[[2025,1,4]]},"assertion":[{"value":"2025-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}