{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:20:23Z","timestamp":1771485623894,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1650733, CCF-1733808, CCF-1740751, IIS-1741137"],"award-info":[{"award-number":["CCF-1650733, CCF-1733808, CCF-1740751, IIS-1741137"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1147\/09"],"award-info":[{"award-number":["1147\/09"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N011163\/1"],"award-info":[{"award-number":["EP\/N011163\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,23]]},"DOI":"10.1145\/3212734.3212743","type":"proceedings-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T16:28:33Z","timestamp":1533054513000},"page":"129-138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":68,"title":["Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themis","family":"Gouleakis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Konrad","sequence":"additional","affiliation":[{"name":"University of Bristol, Bristol, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slobodan","family":"Mitrovi\u0107","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology & Tel Aviv University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 32Nd International Conference on International Conference on Machine Learning -","volume":"37","author":"Ahn Kook Jin","year":"2015","unstructured":"Kook Jin Ahn , Graham Cormode , Sudipto Guha , Andrew McGregor , and Anthony Wirth . 2015 . Correlation Clustering in Data Streams . In Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 (ICML'15). JMLR.org, 2237--2246. deftempurl%http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045356 tempurl Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, and Anthony Wirth . 2015. Correlation Clustering in Data Streams. In Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 (ICML'15). JMLR.org, 2237--2246. deftempurl%http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045356 tempurl"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755586"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_2_1_5_1","volume-title":"Simple Round Compression for Parallel Vertex Cover. CoRR","author":"Sepehr Assadi","year":"2017","unstructured":"Sepehr Assadi . 2017. Simple Round Compression for Parallel Vertex Cover. CoRR Vol. abs\/ 1709 .04599 (September . 2017 ). deftempurl%https:\/\/arxiv.org\/abs\/1709.04599 tempurl Sepehr Assadi . 2017. Simple Round Compression for Parallel Vertex Cover. CoRR Vol. abs\/1709.04599 (September . 2017). deftempurl%https:\/\/arxiv.org\/abs\/1709.04599 tempurl"},{"key":"e_1_3_2_1_6_1","volume-title":"Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR","volume":"1711","author":"Assadi Sepehr","year":"2017","unstructured":"Sepehr Assadi , MohammadHossein Bateni , Aaron Bernstein , Vahab S. Mirrokni , and Cliff Stein . 2017 . Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR Vol. abs\/ 1711 .03076 (2017). showeprint{arxiv}1711.03076deftempurl%http:\/\/arxiv.org\/abs\/1711.03076 tempurl Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, and Cliff Stein . 2017. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR Vol. abs\/1711.03076 (2017). showeprint{arxiv}1711.03076deftempurl%http:\/\/arxiv.org\/abs\/1711.03076 tempurl"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087581"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.60"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767447"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_39"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312058"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767414"},{"key":"e_1_3_2_1_14_1","unstructured":"Keren Censor-Hillel Merav Parter and Gregory Schwartzman . 2017. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions 31 International Symposium on Distributed Computing.  Keren Censor-Hillel Merav Parter and Gregory Schwartzman . 2017. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions 31 International Symposium on Distributed Computing."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188764"},{"key":"e_1_3_2_1_16_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters Proceedings of the 6th Conference on Symposium on Opearting Systems Design & Implementation","volume":"6","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . 2004 . MapReduce: Simplified Data Processing on Large Clusters Proceedings of the 6th Conference on Symposium on Opearting Systems Design & Implementation , Volume 6 (OSDI'04). USENIX Association, Berkeley, CA, USA, 10--10. deftempurl%http:\/\/dl.acm.org\/citation.cfm?id=1251254.1251264 tempurl Jeffrey Dean and Sanjay Ghemawat . 2004. MapReduce: Simplified Data Processing on Large Clusters Proceedings of the 6th Conference on Symposium on Opearting Systems Design & Implementation, Volume 6 (OSDI'04). USENIX Association, Berkeley, CA, USA, 10--10. deftempurl%http:\/\/dl.acm.org\/citation.cfm?id=1251254.1251264 tempurl"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175445"},{"key":"e_1_3_2_1_20_1","volume-title":"An Improved Distributed Algorithm for Maximal Independent Set Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA).","author":"Mohsen Ghaffari","year":"2016","unstructured":"Mohsen Ghaffari . 2016 . An Improved Distributed Algorithm for Maximal Independent Set Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA). Mohsen Ghaffari . 2016. An Improved Distributed Algorithm for Maximal Independent Set Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087830"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933103"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09620-9_13"},{"key":"e_1_3_2_1_26_1","volume-title":"Near-constant-time distributed algorithms on a congested clique Proc. of the Int'l Symp. on Dist. Comp. (DISC)","author":"Hegeman James W","unstructured":"James W Hegeman , Sriram V Pemmaraju , and Vivek B Sardeshmukh . 2014. Near-constant-time distributed algorithms on a congested clique Proc. of the Int'l Symp. on Dist. Comp. (DISC) . Springer , 514--530. James W Hegeman, Sriram V Pemmaraju, and Vivek B Sardeshmukh . 2014. Near-constant-time distributed algorithms on a congested clique Proc. of the Int'l Symp. on Dist. Comp. (DISC). Springer, 514--530."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90144-4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90141-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175472"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_33_1","volume-title":"Deterministic MST Sparsification in the Congested Clique. arXiv preprint arXiv:1605.02022","author":"Korhonen Janne H","year":"2016","unstructured":"Janne H Korhonen . 2016. Deterministic MST Sparsification in the Congested Clique. arXiv preprint arXiv:1605.02022 ( 2016 ). Janne H Korhonen . 2016. Deterministic MST Sparsification in the Congested Clique. arXiv preprint arXiv:1605.02022 (2016)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/080714403"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777428"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993851"},{"key":"e_1_3_2_1_43_1","volume-title":"Hadoop: The Definitive Guide","author":"Tom White","year":"2012","unstructured":"Tom White . 2012 . Hadoop: The Definitive Guide . O'Reilly Media, Inc. Tom White . 2012. Hadoop: The Definitive Guide. O'Reilly Media, Inc."},{"key":"e_1_3_2_1_44_1","volume-title":"Spark: Cluster Computing with Working Sets. In 2nd USENIX Workshop on Hot Topics in Cloud Computing, HotCloud'10","author":"Zaharia Matei","year":"2010","unstructured":"Matei Zaharia , Mosharaf Chowdhury , Michael J. Franklin , Scott Shenker , and Ion Stoica . 2010 . Spark: Cluster Computing with Working Sets. In 2nd USENIX Workshop on Hot Topics in Cloud Computing, HotCloud'10 , Boston, MA, USA, June 22. deftempurl%https:\/\/www.usenix.org\/conference\/hotcloud-10\/spark-cluster-computing-working-sets tempurl Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica . 2010. Spark: Cluster Computing with Working Sets. In 2nd USENIX Workshop on Hot Topics in Cloud Computing, HotCloud'10, Boston, MA, USA, June 22. deftempurl%https:\/\/www.usenix.org\/conference\/hotcloud-10\/spark-cluster-computing-working-sets tempurl"}],"event":{"name":"PODC '18: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '18","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212743","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212743","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:44Z","timestamp":1750212464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":44,"alternative-id":["10.1145\/3212734.3212743","10.1145\/3212734"],"URL":"https:\/\/doi.org\/10.1145\/3212734.3212743","relation":{},"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"2018-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}