{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:40:08Z","timestamp":1747867208571,"version":"3.41.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031917356","type":"print"},{"value":"9783031917363","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-91736-3_12","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:03:08Z","timestamp":1747864988000},"page":"194-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When MIS and\u00a0Maximal Matching are Easy in\u00a0the\u00a0Congested Clique"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4395-5205","authenticated-orcid":false,"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8942-3637","authenticated-orcid":false,"given":"Tomer","family":"Even","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2693-0470","authenticated-orcid":false,"given":"Maxime","family":"Flin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5774-8437","authenticated-orcid":false,"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"12_CR1","unstructured":"Ahn, K., Cormode, G., Guha, S., McGregor, A., Wirth, A.: Correlation clustering in data streams. In: International Conference on Machine Learning, pp. 2237\u20132246. PMLR (2015)"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Assadi, S., Bateni, M., Bernstein, A., Mirrokni, V.S., Stein, C.: Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January 2019, pp. 1616\u20131635. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.98","DOI":"10.1137\/1.9781611975482.98"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Assadi, S., Kol, G., Zhang, Z.: Rounds vs communication tradeoffs for maximal independent sets. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, 31 October\u20133 November 2022, pp. 1193\u20131204. IEEE (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00115","DOI":"10.1109\/FOCS54457.2022.00115"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Assadi, S., Konrad, C., Naidu, K.K., Sundaresan, J.: O(log log n) passes is optimal for semi-streaming maximal independent set. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, 24\u201328 June 2024, pp. 847\u2013858. ACM (2024). https:\/\/doi.org\/10.1145\/3618260.3649763","DOI":"10.1145\/3618260.3649763"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Assadi, S., Onak, K., Schieber, B., Solomon, S.: Fully dynamic maximal independent set with sublinear in n update time. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 815\u2013826 (2018)","DOI":"10.1145\/3188745.3188922"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Assadi, S., Solomon, S.: When algorithms for maximal independent set and maximal matching run in sublinear time. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, 9\u201312 July 2019, Patras, Greece. LIPIcs, vol.\u00a0132, pp. 17:1\u201317:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2019.17","DOI":"10.4230\/LIPICS.ICALP.2019.17"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3461458","volume":"68","author":"A Balliu","year":"2021","unstructured":"Balliu, A., Brandt, S., Hirvonen, J., Olivetti, D., Rabie, M., Suomela, J.: Lower bounds for maximal matchings and maximal independent sets. J. ACM (JACM) 68(5), 1\u201330 (2021)","journal-title":"J. ACM (JACM)"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Balliu, A., Brandt, S., Kuhn, F., Olivetti, D.: Distributed $$\\delta $$-coloring plays hide-and-seek. In: Leonardi, S., Gupta, A. (eds.) STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, 20\u201324 June 2022, pp. 464\u2013477. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520027","DOI":"10.1145\/3519935.3520027"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Balliu, A., Brandt, S., Kuhn, F., Olivetti, D.: Distributed maximal matching and maximal independent set on hypergraphs. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2632\u20132676. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch100"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/20M1381770","volume":"51","author":"A Balliu","year":"2022","unstructured":"Balliu, A., Brandt, S., Olivetti, D.: Distributed lower bounds for ruling sets. SIAM J. Comput. 51(1), 70\u2013115 (2022). https:\/\/doi.org\/10.1137\/20M1381770","journal-title":"SIAM J. Comput."},{"issue":"5\u20136","key":"12_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/S00446-009-0088-2","volume":"22","author":"L Barenboim","year":"2010","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. Distributed Comput. 22(5\u20136), 363\u2013379 (2010). https:\/\/doi.org\/10.1007\/S00446-009-0088-2","journal-title":"Distributed Comput."},{"issue":"5\u20136","key":"12_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/S00446-012-0167-7","volume":"26","author":"L Barenboim","year":"2013","unstructured":"Barenboim, L., Elkin, M.: Distributed deterministic edge coloring using bounded neighborhood independence. Distributed Comput. 26(5\u20136), 273\u2013287 (2013). https:\/\/doi.org\/10.1007\/S00446-012-0167-7","journal-title":"Distributed Comput."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2903137","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM (JACM) 63(3), 1\u201345 (2016)","journal-title":"J. ACM (JACM)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-90530-3_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"L Barenboim","year":"2018","unstructured":"Barenboim, L., Khazanov, V.: Distributed symmetry-breaking algorithms for congested cliques. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 41\u201352. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90530-3_5"},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3617360","volume":"70","author":"S Behnezhad","year":"2023","unstructured":"Behnezhad, S., Hajiaghayi, M., Harris, D.G.: Exponentially faster massively parallel maximal matching. J. ACM 70(5), 1\u201318 (2023)","journal-title":"J. ACM"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-642-31585-5_39","volume-title":"Automata, Languages, and Programming","author":"A Berns","year":"2012","unstructured":"Berns, A., Hegeman, J., Pemmaraju, S.V.: Super-fast distributed algorithms for metric facility location. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 428\u2013439. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_39"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: Cliques in random graphs. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol.\u00a080, pp. 419\u2013427. Cambridge University Press (1976)","DOI":"10.1017\/S0305004100053056"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Bui, H.D., Chandra, S., Chang, Y.J., Dory, M., Leitersdorf, D.: Improved all-pairs approximate shortest paths in congested clique. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (2024)","DOI":"10.1145\/3662158.3662804"},{"key":"12_CR19","unstructured":"Cambus, M., Kuhn, F., Pai, S., Uitto, J.: Time and space optimal massively parallel algorithm for the 2-ruling set problem. arXiv preprint arXiv:2306.00432 (2023)"},{"key":"12_CR20","unstructured":"Censor-Hillel, K., Even, T., Flin, M., Halld\u00f3rsson, M.M.: When MIS and maximal matching are easy in the congested clique (2025). https:\/\/arxiv.org\/abs\/2502.21031"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Chang, Y., Fischer, M., Ghaffari, M., Uitto, J., Zheng, Y.: The complexity of ($$\\Delta $$+1) coloring in congested clique, massively parallel computation, and centralized local computation, pp. 471\u2013480. ACM (2019)","DOI":"10.1145\/3293611.3331607"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Chechik, S., Zhang, T.: Constant-round near-optimal spanners in congested clique. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC 2022, pp. 325\u2013334. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3519270.3538439","DOI":"10.1145\/3519270.3538439"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.D.: The structure of claw-free graphs. In: Surveys in Combinatorics, 2005: Invited lectures from the Twentieth British Combinatorial Conference, Durham, UK, July 2005. London Mathematical Society Lecture Note Series, vol.\u00a0327, pp. 153\u2013171. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: ACM Symposium on Principles of Distributed Computing, PODC 2014, Paris, France, 15\u201318 July 2014, pp. 367\u2013376. ACM (2014). https:\/\/doi.org\/10.1145\/2611462.2611493","DOI":"10.1145\/2611462.2611493"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of measure for the analysis of randomized algorithms. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Faour, S., Ghaffari, M., Grunau, C., Kuhn, F., Rozhon, V.: Local distributed rounding: generalized to MIS, matching, set cover, and beyond. In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, 22\u201325 January 2023, pp. 4409\u20134447. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.CH168","DOI":"10.1137\/1.9781611977554.CH168"},{"issue":"3\u20134","key":"12_CR27","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-018-0344-4","volume":"33","author":"M Fischer","year":"2020","unstructured":"Fischer, M.: Improved deterministic distributed matching via rounding. Distrib. Comput. 33(3\u20134), 279\u2013291 (2020)","journal-title":"Distrib. Comput."},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Fischer, M., Mitrovic, S., Uitto, J.: Deterministic (1+$$\\epsilon $$)-approximate maximum matching with poly(1\/$$\\epsilon $$) passes in the semi-streaming model and beyond. In: STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, 20\u201324 June 2022, pp. 248\u2013260. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520039","DOI":"10.1145\/3519935.3520039"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(90)90149-C","volume":"81","author":"AM Frieze","year":"1990","unstructured":"Frieze, A.M.: On the independence number of random graphs. Discret. Math. 81(2), 171\u2013175 (1990)","journal-title":"Discret. Math."},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Gfeller, B., Vicari, E.: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, 12\u201315 August 2007, pp. 53\u201360. ACM (2007). https:\/\/doi.org\/10.1145\/1281100.1281111","DOI":"10.1145\/1281100.1281111"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.CH20","DOI":"10.1137\/1.9781611974331.CH20"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Ghaffari, M.: Distributed MIS via all-to-all communication. In: Schiller, E.M., Schwarzmann, A.A. (eds.) Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, 25\u201327 July 2017, pp. 141\u2013149. ACM (2017). https:\/\/doi.org\/10.1145\/3087801.3087830","DOI":"10.1145\/3087801.3087830"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Gouleakis, T., Konrad, C., Mitrovi\u0107, S., Rubinfeld, R.: Improved massively parallel computation algorithms for mis, matching, and vertex cover. arXiv preprint arXiv:1802.08237 (2018)","DOI":"10.1145\/3212734.3212743"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Grunau, C.: Faster deterministic distributed MIS and approximate matching. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, 20\u201323 June 2023, pp. 1777\u20131790. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585243","DOI":"10.1145\/3564246.3585243"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Grunau, C., Haeupler, B., Ilchi, S., Rozhon, V.: Improved distributed network decomposition, hitting sets, and spanners, via derandomization. In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, 22\u201325 January 2023, pp. 2532\u20132566. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.CH97","DOI":"10.1137\/1.9781611977554.CH97"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Grunau, C., Rozho\u0148, V.: Improved deterministic network decomposition. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2904\u20132923. SIAM (2021)","DOI":"10.1137\/1.9781611976465.173"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Sayyadi, A.: Distributed arboricity-dependent graph coloring via all-to-all communication. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, 9\u201312 July 2019, Patras, Greece. LIPIcs, vol.\u00a0132, pp. 142:1\u2013142:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.142","DOI":"10.4230\/LIPIcs.ICALP.2019.142"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Giliberti, J., Parsaeian, Z.: Massively parallel ruling set made deterministic. In: Alistarh, D. (ed.) 38th International Symposium on Distributed Computing, DISC 2024, October 28 to November 1, 2024, Madrid, Spain. LIPIcs, vol.\u00a0319, pp. 29:1\u201329:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2024.29","DOI":"10.4230\/LIPICS.DISC.2024.29"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-48653-5_37","volume-title":"Distributed Computing","author":"MM Halld\u00f3rsson","year":"2015","unstructured":"Halld\u00f3rsson, M.M., Konrad, C.: Distributed large independent sets in one round on bounded-independence graphs. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 559\u2013572. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_37"},{"issue":"3","key":"12_CR40","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/S00453-003-1031-8","volume":"37","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37(3), 187\u2013209 (2003). https:\/\/doi.org\/10.1007\/S00453-003-1031-8","journal-title":"Algorithmica"},{"key":"12_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-662-45174-8_35","volume-title":"Distributed Computing","author":"JW Hegeman","year":"2014","unstructured":"Hegeman, J.W., Pemmaraju, S.V., Sardeshmukh, V.B.: Near-constant-time distributed algorithms on a congested clique. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 514\u2013530. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_35"},{"key":"12_CR42","doi-asserted-by":"publisher","unstructured":"Jurdzinski, T., Nowicki, K.: MST in O(1) rounds of congested clique. In: Czumaj, A. (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 2620\u20132632. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.167","DOI":"10.1137\/1.9781611975031.167"},{"key":"12_CR43","unstructured":"Konrad, C.: MIS in the congested clique model in o(log log $$\\Delta $$) rounds. CoRR abs\/1802.07647 (2018). http:\/\/arxiv.org\/abs\/1802.07647"},{"key":"12_CR44","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. arXiv preprint arXiv:1011.5470 (2010)"},{"key":"12_CR45","doi-asserted-by":"publisher","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17:1\u201317:44 (2016). https:\/\/doi.org\/10.1145\/2742012","DOI":"10.1145\/2742012"},{"issue":"5","key":"12_CR46","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/S11276-007-0045-6","volume":"14","author":"F Kuhn","year":"2008","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad hoc networks beyond unit disk graphs. Wirel. Networks 14(5), 715\u2013729 (2008). https:\/\/doi.org\/10.1007\/S11276-007-0045-6","journal-title":"Wirel. Networks"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, pp. 42\u201350 (2013)","DOI":"10.1145\/2484239.2501983"},{"key":"12_CR48","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Milenkovi\u0107, L., Solomon, S.: A unified sparsification approach for matching problems in graphs of bounded neighborhood independence. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 395\u2013406 (2020)","DOI":"10.1145\/3350755.3400248"},{"key":"12_CR50","doi-asserted-by":"publisher","unstructured":"Pai, S., Pemmaraju, S.V.: Brief announcement: deterministic massively parallel algorithms for ruling sets. In: Milani, A., Woelfel, P. (eds.) PODC 2022: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 25\u201329 July 2022, pp. 366\u2013368. ACM (2022). https:\/\/doi.org\/10.1145\/3519270.3538472","DOI":"10.1145\/3519270.3538472"},{"issue":"2","key":"12_CR51","first-page":"581","volume":"20","author":"A Panconesi","year":"1995","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 581\u2013592 (1995)","journal-title":"J. Algorithms"},{"key":"12_CR52","doi-asserted-by":"publisher","unstructured":"Rozhon, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization, pp. 350\u2013363 (2020). https:\/\/doi.org\/10.1145\/3357713.3384298","DOI":"10.1145\/3357713.3384298"},{"key":"12_CR53","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-010-0097-1","volume":"22","author":"J Schneider","year":"2010","unstructured":"Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22, 349\u2013361 (2010)","journal-title":"Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91736-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:03:18Z","timestamp":1747864998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91736-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031917356","9783031917363"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91736-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delphi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.torontomu.ca\/sirocco-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}