{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T20:14:29Z","timestamp":1775333669093,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["285721"],"award-info":[{"award-number":["285721"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210391","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"163-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Towards a Complexity Theory for the Congested Clique"],"prefix":"10.1145","author":[{"given":"Janne H.","family":"Korhonen","sequence":"first","affiliation":[{"name":"Aalto University, Helsinki, Finland"}]},{"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[{"name":"Aalto University, Helsinki, Finland"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626416500043"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. 34th Symposium on Theoretical Aspects of Computer Science (STACS","volume":"66","author":"Balliu Alkida","year":"2017"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188860"},{"key":"e_1_3_2_1_4_1","unstructured":"Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen . 2016. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. (2016). arXiv:1607.05127 {cs.DC}.  Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen . 2016. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. (2016). arXiv:1607.05127 {cs.DC}."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 31st International Symposium on Distributed Computing (DISC","author":"Becker Ruben","year":"2017"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.04.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897570"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087833"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222038"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767414"},{"key":"e_1_3_2_1_11_1","unstructured":"Keren Censor-Hillel Merav Parter and Gregory Schwartzman . 2016. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. (2016). arXiv:1608.01689 {cs.DC}.  Keren Censor-Hillel Merav Parter and Gregory Schwartzman . 2016. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. (2016). arXiv:1608.01689 {cs.DC}."},{"key":"e_1_3_2_1_12_1","volume-title":"An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model Proc. 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS","author":"Chang Yi-Jun","year":"2016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.23"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Marek Cygan Fedor V. Fomin Aukasz Kowalik Daniel Lokshtanov Daniel Marx Marcin Pilipczuk Micha\u0142 Pilipczuk and Saket Saurabh . 2015. Parameterized Algorithms. Springer.   Marek Cygan Fedor V. Fomin Aukasz Kowalik Daniel Lokshtanov Daniel Marx Marcin Pilipczuk Micha\u0142 Pilipczuk and Saket Saurabh . 2015. Parameterized Algorithms. Springer.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993686"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797327908"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Rodney G. Downey and Michael R. Fellows . 2012. Parameterized complexity. Springer.   Rodney G. Downey and Michael R. Fellows . 2012. Parameterized complexity. Springer.","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 31st International Symposium on Distributed Computing (DISC","author":"Even Guy","year":"2017"},{"key":"e_1_3_2_1_21_1","first-page":"41","article-title":"Survey of Distributed Decision","volume":"119","author":"Feuilloley Laurent","year":"2016","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. 43rd International Colloquium on Automata, Languages, and Programming (ICALP","volume":"55","author":"Feuilloley Laurent","year":"2016"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.17"},{"key":"e_1_3_2_1_24_1","volume-title":"23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Frischknecht Silvio","year":"2012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933103"},{"key":"e_1_3_2_1_27_1","volume-title":"28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Ghaffari Mohsen","year":"2017"},{"key":"e_1_3_2_1_28_1","first-page":"1","article-title":"Locally Checkable Proofs in Distributed Computing","volume":"12","author":"G\u00f6\u00f6s Mika","year":"2016","journal-title":"Theory of Computing"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"James W. Hegeman and Sriram V. Pemmaraju . 2014. Lessons from the Congested Clique Applied to MapReduce Proc. 21st Colloquium on Structural Information and Communication Complexity (SIROCCO 2014). 149--164.  James W. Hegeman and Sriram V. Pemmaraju . 2014. Lessons from the Congested Clique Applied to MapReduce Proc. 21st Colloquium on Structural Information and Communication Complexity (SIROCCO 2014). 149--164.","DOI":"10.1007\/978-3-319-09620-9_13"},{"key":"e_1_3_2_1_32_1","volume-title":"28th International Symposium on Distributed Computing (DISC","author":"Hegeman James W.","year":"2014"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321362"},{"key":"e_1_3_2_1_34_1","volume-title":"30th International Symposium on Distributed Computing (DISC","author":"Korhonen Janne H.","year":"2016"},{"key":"e_1_3_2_1_35_1","volume-title":"21st Conference on Principles of Distributed Systems (OPODIS","author":"Janne","year":"2017"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11947950_12"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0025-1"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0095-3"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118226.3118474"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_5"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484262"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441848"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_1_49_1","unstructured":"Gopal Pandurangan Peter Robinson and Michele Scquizzato . 2016. Tight bounds for distributed graph computations. (2016). arXiv:1602.08481 {cs.DC}.  Gopal Pandurangan Peter Robinson and Michele Scquizzato . 2016. Tight bounds for distributed graph computations. (2016). arXiv:1602.08481 {cs.DC}."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.27"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Vienna Austria","acronym":"SPAA '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":51,"alternative-id":["10.1145\/3210377.3210391","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210391","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}