{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:58:40Z","timestamp":1781078320610,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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":[[2014,7,15]]},"DOI":"10.1145\/2611462.2611493","type":"proceedings-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T12:20:56Z","timestamp":1405426856000},"page":"367-376","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":114,"title":["On the power of the congested clique model"],"prefix":"10.1145","author":[{"given":"Andrew","family":"Drucker","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rotem","family":"Oshman","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.55"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.179355"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90052-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03338-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.46"},{"key":"e_1_3_2_1_7_1","volume-title":"Economic efficiency requires interaction. CoRR, abs\/1311.4721","author":"Dobzinski S.","year":"2013","unstructured":"S. Dobzinski , N. Nisan , and S. Oren . Economic efficiency requires interaction. CoRR, abs\/1311.4721 , 2013 . S. Dobzinski, N. Nisan, and S. Oren. Economic efficiency requires interaction. CoRR, abs\/1311.4721, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007407"},{"key":"e_1_3_2_1_10_1","first-page":"29","volume-title":"Extremal problems in graph theory. Theory of Graphs and its Applications","author":"Erd\u00f6s P.","year":"1985","unstructured":"P. Erd\u00f6s . Extremal problems in graph theory. Theory of Graphs and its Applications , pages 29 -- 36 , 1985 . P. Erd\u00f6s. Extremal problems in graph theory. Theory of Graphs and its Applications, pages 29--36, 1985."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579234"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095207"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Secure multi-party computation. unpublished manuscript","author":"Goldreich O.","year":"1998","unstructured":"O. Goldreich and A. Warning . Secure multi-party computation. unpublished manuscript , 1998 . O. Goldreich and A. Warning. Secure multi-party computation. unpublished manuscript, 1998."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402977"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90001-D"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0287-z"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01272517"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10068"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792282965"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0105-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060629"},{"key":"e_1_3_2_1_25_1","volume-title":"Zarankiewicz. Colloq. Math., 3: 50--57","author":"K\u00f6v\u00e1ri T.","year":"1954","unstructured":"T. K\u00f6v\u00e1ri , V. T. S\u00f3s , and P. Tur\u00e1n . On a problem of K . Zarankiewicz. Colloq. Math., 3: 50--57 , 1954 . T. K\u00f6v\u00e1ri, V. T. S\u00f3s, and P. Tur\u00e1n. On a problem of K. Zarankiewicz. Colloq. Math., 3:50--57, 1954."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075082"},{"key":"e_1_3_2_1_27_1","volume-title":"Communication complexity","author":"Kushilevitz E.","year":"1997","unstructured":"E. Kushilevitz and N. Nisan . Communication complexity . Cambridge University Press , 1997 . E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993639"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777428"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90030-X"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993851"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_35_1","first-page":"1065","volume-title":"Proc. 21st Symp. on Discrete Algorithms (SODA)","author":"Puatra\u015fcu M.","year":"2010","unstructured":"M. Puatra\u015fcu and R. Williams . On the possibility of faster SAT algorithms . In Proc. 21st Symp. on Discrete Algorithms (SODA) , pages 1065 -- 1075 , 2010 . M. Puatra\u015fcu and R. Williams. On the possibility of faster SAT algorithms. In Proc. 21st Symp. on Discrete Algorithms (SODA), pages 1065--1075, 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90041-7"},{"key":"e_1_3_2_1_38_1","volume-title":"Combinatorica","author":"Ruzsa I. Z.","year":"1976","unstructured":"I. Z. Ruzsa and E. Szemer\u00e9di . Triple systems with no six points carrying three triangles . Combinatorica , 1976 . I. Z. Ruzsa and E. Szemer\u00e9di. Triple systems with no six points carrying three triangles. Combinatorica, 1976."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/08071421X"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488725"},{"key":"e_1_3_2_1_42_1","first-page":"19","volume-title":"Proc. Adv. in Neural Inf. Proc. Sys. (NIPS)","author":"Siu K.-Y.","year":"1992","unstructured":"K.-Y. Siu , V. P. Roychowdhury , and T. Kailath . Computing with almost optimal size neural networks . In Proc. Adv. in Neural Inf. Proc. Sys. (NIPS) , pages 19 -- 26 , 1992 . K.-Y. Siu, V. P. Roychowdhury, and T. Kailath. Computing with almost optimal size neural networks. In Proc. Adv. in Neural Inf. Proc. Sys. (NIPS), pages 19--26, 1992."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2169042"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.023"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559903"}],"event":{"name":"PODC '14: ACM Symposium on Principles of Distributed Computing","location":"Paris France","acronym":"PODC '14","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2014 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611493","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2611462.2611493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:33Z","timestamp":1750230093000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":46,"alternative-id":["10.1145\/2611462.2611493","10.1145\/2611462"],"URL":"https:\/\/doi.org\/10.1145\/2611462.2611493","relation":{},"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"2014-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}