{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:38Z","timestamp":1742912138895,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030795269"},{"type":"electronic","value":"9783030795276"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79527-6_4","type":"book-chapter","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:43Z","timestamp":1624100623000},"page":"50-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-Optimal Scheduling in the Congested 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\/0000-0003-4062-6991","authenticated-orcid":false,"given":"Yannic","family":"Maus","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8127-7399","authenticated-orcid":false,"given":"Volodymyr","family":"Polosukhin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Censor-Hillel, K., Dory, M., Korhonen, J.H., Leitersdorf, D.: Fast approximate shortest paths in the congested clique. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 74\u201383 (2019). https:\/\/doi.org\/10.1145\/3293611.3331633","DOI":"10.1145\/3293611.3331633"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Censor-Hillel, K., Gall, F.L., Leitersdorf, D.: On distributed listing of cliques. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 474\u2013482 (2020). https:\/\/doi.org\/10.1145\/3382734.3405742","DOI":"10.1145\/3382734.3405742"},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00446-016-0270-2","volume":"32","author":"K Censor-Hillel","year":"2016","unstructured":"Censor-Hillel, K., Kaski, P., Korhonen, J.H., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. Distrib. Comput. 32(6), 461\u2013478 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0270-2","journal-title":"Distrib. Comput."},{"key":"4_CR4","unstructured":"Censor-Hillel, K., Maus, Y., Polosukhin, V.: Near-optimal scheduling in the congested clique (2021). arXiv:2102.07221"},{"issue":"3\u20134","key":"4_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-020-00376-1","volume":"33","author":"K Censor-Hillel","year":"2020","unstructured":"Censor-Hillel, K., Parter, M., Schwartzman, G.: Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33(3\u20134), 349\u2013366 (2020). https:\/\/doi.org\/10.1007\/s00446-020-00376-1","journal-title":"Distributed Comput."},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Chang, Y., Pettie, S., Zhang, H.: Distributed triangle detection via expander decomposition. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 821\u2013840 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.51","DOI":"10.1137\/1.9781611975482.51"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Czumaj, A., Davies, P., Parter, M.: Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 309\u2013318 (2020). https:\/\/doi.org\/10.1145\/3382734.3405751","DOI":"10.1145\/3382734.3405751"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-33651-5_14","volume-title":"Distributed Computing","author":"D Dolev","year":"2012","unstructured":"Dolev, D., Lenzen, C., Peled, S.: \u201cTri, tri again\u201d: finding triangles and small subgraphs in a distributed setting. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 195\u2013209. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_14"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-662-53426-7_5","volume-title":"Distributed Computing","author":"F Le Gall","year":"2016","unstructured":"Le Gall, F.: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 57\u201370. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_5"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Ghaffari, M.: Near-optimal scheduling of distributed algorithms. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 3\u201312 (2015). https:\/\/doi.org\/10.1145\/2767386.2767417","DOI":"10.1145\/2767386.2767417"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Ghaffari, M.: Distributed MIS via all-to-all communication. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 141\u2013149 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.142","DOI":"10.4230\/LIPIcs.ICALP.2019.142"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Gouleakis, T., Konrad, C., Mitrovic, S., Rubinfeld, R.: Improved massively parallel computation algorithms for MIS, matching, and vertex cover. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 129\u2013138 (2018). https:\/\/doi.org\/10.1145\/3212734.3212743","DOI":"10.1145\/3212734.3212743"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Nowicki, K.: Congested clique algorithms for the minimum cut problem. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 357\u2013366 (2018)","DOI":"10.1145\/3212734.3212750"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Nowicki, K., Thorup, M.: Faster algorithms for edge connectivity via random 2-out contractions. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1260\u20131279 (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.77","DOI":"10.1137\/1.9781611975994.77"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Parter, M.: MST in log-star rounds of congested clique. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 19\u201328 (2016). https:\/\/doi.org\/10.1145\/2933057.2933103","DOI":"10.1145\/2933057.2933103"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Hegeman, J.W., Pandurangan, G., Pemmaraju, S.V., Sardeshmukh, V.B., Scquizzato, M.: Toward optimal bounds in the congested clique: graph connectivity and MST. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 91\u2013100 (2015). https:\/\/doi.org\/10.1145\/2767386.2767434","DOI":"10.1145\/2767386.2767434"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Hirschberg, D.S.: Parallel algorithms for the transitive closure and the connected component problems. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 55\u201357 (1976). https:\/\/doi.org\/10.1145\/800113.803631","DOI":"10.1145\/800113.803631"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Izumi, T., Gall, F.L.: Triangle finding and listing in CONGEST networks. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 381\u2013389 (2017). https:\/\/doi.org\/10.1145\/3087801.3087811","DOI":"10.1145\/3087801.3087811"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Jurdzinski, T., Nowicki, K.: MST in O(1) rounds of congested clique. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2620\u20132632 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.167","DOI":"10.1137\/1.9781611975031.167"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 938\u2013948 (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.76","DOI":"10.1137\/1.9781611973075.76"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Klauck, H., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed computation of large-scale graph problems. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 391\u2013410 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.28","DOI":"10.1137\/1.9781611973730.28"},{"key":"4_CR22","unstructured":"Korhonen, J.H.: Deterministic MST sparsification in the congested clique (2016). arXiv:1605.02022"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"FT Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.: Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica 14(2), 167\u2013186 (1994). https:\/\/doi.org\/10.1007\/BF01215349","journal-title":"Combinatorica"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 42\u201350 (2013). https:\/\/doi.org\/10.1145\/2484239.2501983","DOI":"10.1145\/2484239.2501983"},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/S0097539704441848","volume":"35","author":"Z Lotker","year":"2005","unstructured":"Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in O(log log n) communication rounds. SIAM J. Comput. 35(1), 120\u2013131 (2005). https:\/\/doi.org\/10.1137\/S0097539704441848","journal-title":"SIAM J. Comput."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Nowicki, K.: A deterministic algorithm for the MST problem in constant rounds of congested clique. In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (2021). arXiv:1912.04239","DOI":"10.1145\/3406325.3451136"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: On the distributed complexity of large-scale graph computations. In: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architecture (SPAA), pp. 405\u2013414 (2018). https:\/\/doi.org\/10.1145\/3210377.3210409","DOI":"10.1145\/3210377.3210409"}],"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-030-79527-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:56Z","timestamp":1624100636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79527-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030795269","9783030795276"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79527-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2021.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}