{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335552,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538472","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"366-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets"],"prefix":"10.1145","author":[{"given":"Shreyas","family":"Pai","sequence":"first","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"given":"Sriram V.","family":"Pemmaraju","sequence":"additional","affiliation":[{"name":"The University of Iowa, Iowa City, IA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"31st International Symposium on Distributed Computing, DISC 2017","volume":"10","author":"Censor-Hillel Keren","year":"2017","unstructured":"Keren Censor-Hillel , Merav Parter , and Gregory Schwartzman . 2017 . Derandomizing Local Distributed Algorithms under Bandwidth Restrictions . In 31st International Symposium on Distributed Computing, DISC 2017 , October 16 --20 , 2017, Vienna, Austria (LIPIcs, Vol. 91). https:\/\/doi.org\/ 10 .4230\/LIPIcs.DISC.2017.11 10.4230\/LIPIcs.DISC.2017.11 Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman. 2017. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. In 31st International Symposium on Distributed Computing, DISC 2017, October 16--20, 2017, Vienna, Austria (LIPIcs, Vol. 91). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.11"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400282"},{"key":"e_1_3_2_2_3_1","volume-title":"DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science","volume":"530","author":"Hegeman James W.","year":"2014","unstructured":"James W. Hegeman , Sriram V. Pemmaraju , and Vivek Sardeshmukh . 2014 . Near-Constant-Time Distributed Algorithms on a Congested Clique. In Distributed Computing - 28th International Symposium , DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science , Vol. 8784), Fabian Kuhn (Ed.). Springer, 514-- 530 . https:\/\/doi.org\/10.1007\/978--3--662--45174--8_35 10.1007\/978--3--662--45174--8_35 James W. Hegeman, Sriram V. Pemmaraju, and Vivek Sardeshmukh. 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8784), Fabian Kuhn (Ed.). Springer, 514--530. https:\/\/doi.org\/10.1007\/978--3--662--45174--8_35"},{"key":"e_1_3_2_2_4_1","volume-title":"Near-Constant-Time Distributed Algorithms on a Congested Clique. CoRR abs\/1408.2071","author":"Hegeman James W.","year":"2014","unstructured":"James W. Hegeman , Sriram V. Pemmaraju , and Vivek Sardeshmukh . 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. CoRR abs\/1408.2071 ( 2014 ). arXiv:1408.2071 http:\/\/arxiv.org\/abs\/1408.2071 James W. Hegeman, Sriram V. Pemmaraju, and Vivek Sardeshmukh. 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. CoRR abs\/1408.2071 (2014). arXiv:1408.2071 http:\/\/arxiv.org\/abs\/1408.2071"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_2_6_1","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012","author":"Kothapalli Kishore","year":"2012","unstructured":"Kishore Kothapalli and Sriram V. Pemmaraju . 2012. Super-Fast 3-Ruling Sets . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012 , December 15 --17 , 2012 , Hyderabad, India. 136--147. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2012.136 10.4230\/LIPIcs.FSTTCS.2012.136 Kishore Kothapalli and Sriram V. Pemmaraju. 2012. Super-Fast 3-Ruling Sets. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15--17, 2012, Hyderabad, India. 136--147. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2012.136"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777428"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_2_11_1","volume-title":"Pemmaraju","author":"Pai Shreyas","year":"2022","unstructured":"Shreyas Pai and Sriram V . Pemmaraju . 2022 . Deterministic Massively Parallel Algorithms for Ruling Sets . https:\/\/doi.org\/10.48550\/ARXIV.2205.12686 10.48550\/ARXIV.2205.12686 Shreyas Pai and Sriram V. Pemmaraju. 2022. Deterministic Massively Parallel Algorithms for Ruling Sets. https:\/\/doi.org\/10.48550\/ARXIV.2205.12686"},{"key":"e_1_3_2_2_12_1","volume-title":"Randomness-efficient Oblivious Sampling. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE Computer Society","author":"Rompel J.","year":"1994","unstructured":"J. Rompel and M. Bellare . 1994 . Randomness-efficient Oblivious Sampling. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE Computer Society , Los Alamitos, CA, USA, 276--287. https:\/\/doi.org\/10.1109\/SFCS. 1994 .365687 10.1109\/SFCS.1994.365687 J. Rompel and M. Bellare. 1994. Randomness-efficient Oblivious Sampling. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, CA, USA, 276--287. https:\/\/doi.org\/10.1109\/SFCS.1994.365687"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning, ICML 2018","volume":"80","author":"Yaroslavtsev Grigory","year":"2018","unstructured":"Grigory Yaroslavtsev and Adithya Vadapalli . 2018 . Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under lp Distances . In Proceedings of the 35th International Conference on Machine Learning, ICML 2018 , Vol. 80 . PMLR, 5596--5605. http:\/\/proceedings.mlr.press\/v80\/yaroslavtsev18a.html Grigory Yaroslavtsev and Adithya Vadapalli. 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under lp Distances. In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Vol. 80. PMLR, 5596--5605. http:\/\/proceedings.mlr.press\/v80\/yaroslavtsev18a.html"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538472","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":14,"alternative-id":["10.1145\/3519270.3538472","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538472","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}