{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:25:58Z","timestamp":1747866358074,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_5","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"41-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Distributed Symmetry-Breaking Algorithms for Congested Cliques"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Barenboim","sequence":"first","affiliation":[]},{"given":"Victor","family":"Khazanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 25\u201334 (2008)","DOI":"10.1145\/1400751.1400757"},{"issue":"5","key":"5_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2027216.2027221","volume":"58","author":"L Barenboim","year":"2011","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23 (2011)","journal-title":"J. ACM"},{"key":"5_CR3","unstructured":"Barenboim, L., Khazanov, V.: Distributed symmetry-breaking in congested cliques. https:\/\/arxiv.org\/pdf\/1802.07209.pdf"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Kaski, P., Korhonenz, J., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing, pp. 143\u2013152 (2015)","DOI":"10.1145\/2767386.2767414"},{"key":"5_CR5","unstructured":"Censor-Hillel, K., Parter, M., Schwartzman, G.: Derandomizing local distributed algorithms under bandwidth restrictions. In: Proceedings of the 31st International Symposium on Distributed Computing (2016)"},{"key":"5_CR6","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":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: Distributed MIS via All-to-All communication. In: Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, pp. 141\u2013149 (2017)","DOI":"10.1145\/3087801.3087830"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Parter, M.: MST in log-star rounds of congested clique. In: 35th ACM Symposium on Principles of Distributed Computing (PODC), pp. 19\u201328 (2016)","DOI":"10.1145\/2933057.2933103"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0401044","volume":"1","author":"A Goldberg","year":"1988","unstructured":"Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1(4), 434\u2013446 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Hegeman, J., Pandurangan, G., Pemmaraju, S., Sardeshmukh, V., Scquizzato, M., Toward optimal bounds in the congested clique: graph connectivity and MST. In: Proceedings 34th ACM Symposium on Principles of Distributed Computing, pp. 91\u2013100 (2015)","DOI":"10.1145\/2767386.2767434"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.tcs.2015.09.029","volume":"608","author":"J Hegeman","year":"2015","unstructured":"Hegeman, J., Pemmaraju, S.: Lessons from the congested clique applied to mapreduce. Theor. Comput. Sci. 608, 268\u2013281 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Nowicki, K.: MST in $$O(1)$$ rounds of the congested clique. In: Proceedings of 29th ACM-SIAM Symposium on Discrete Algorithms, pp. 2620\u20132632 (2018)","DOI":"10.1137\/1.9781611975031.167"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In Proceedings of 25th ACM Symposium on Principles of Distributed Computing, pp. 7\u201315 (2006)","DOI":"10.1145\/1146381.1146387"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Proceedings 32nd ACM Symposium on Principles of Distributed Computing, pp. 42\u201350 (2013)","DOI":"10.1145\/2484239.2501983"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SICOMP 21(1), 193\u2013201 (1992)","journal-title":"SICOMP"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: MST construction in $$O(\\log \\log n)$$ communication rounds. In: the Proceedings of the Symposium on Parallel Algorithms and Architectures, pp. 94\u2013100. ACM (2003)","DOI":"10.1145\/777426.777428"},{"key":"5_CR17","unstructured":"Pemmaraju, S., Sardeshmukh, V.: Minimum-weight spanning tree construction in $$O(\\log \\log \\log n)$$ rounds on the congested clique. http:\/\/arxiv.org\/abs\/1412.2333"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:29:26Z","timestamp":1710242966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}