{"id":"https://openalex.org/W2788015272","doi":"https://doi.org/10.1145/3212734.3212743","title":"Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover","display_name":"Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover","publication_year":2018,"publication_date":"2018-07-23","ids":{"openalex":"https://openalex.org/W2788015272","doi":"https://doi.org/10.1145/3212734.3212743","mag":"2788015272"},"language":"en","primary_location":{"id":"doi:10.1145/3212734.3212743","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212743","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212743","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212743","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Z\u00fcrich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058035877","display_name":"Themis Gouleakis","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Themis Gouleakis","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054336577","display_name":"Christian Konrad","orcid":"https://orcid.org/0000-0003-1802-4011"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Christian Konrad","raw_affiliation_strings":["University of Bristol, Bristol, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, United Kingdom","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041567023","display_name":"Ronitt Rubinfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronitt Rubinfeld","raw_affiliation_strings":["Massachusetts Institute of Technology & Tel Aviv University, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology & Tel Aviv University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":15.1702,"has_fulltext":true,"cited_by_count":103,"citation_normalized_percentile":{"value":0.99311875,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.8426007032394409},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8267353177070618},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7149975895881653},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7038765549659729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5383658409118652},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5319785475730896},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.517639696598053},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4916854500770569},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.49052494764328003},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.46470800042152405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45894327759742737},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4583529829978943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44877469539642334},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.44771143794059753},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4454939663410187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4172661602497101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3249291181564331},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26137861609458923}],"concepts":[{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.8426007032394409},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8267353177070618},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7149975895881653},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7038765549659729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5383658409118652},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5319785475730896},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.517639696598053},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4916854500770569},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.49052494764328003},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.46470800042152405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45894327759742737},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4583529829978943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44877469539642334},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.44771143794059753},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4454939663410187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4172661602497101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3249291181564331},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26137861609458923},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3212734.3212743","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212743","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212743","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:266310","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/266310","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference proceedings"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/6af27278-c086-47af-a739-b3fd2df47e32","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/6af27278-c086-47af-a739-b3fd2df47e32","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ghaffari, M, Gouleakis, T, Konrad, C, Mitrovi\u0107, S & Rubinfeld, R 2018, Improved massively parallel computation algorithms for MIS, matching, and vertex cover. in PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, pp. 129-138. https://doi.org/10.1145/3212734.3212743","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3212734.3212743","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212743","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212743","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2719145697","display_name":null,"funder_award_id":"CCF-1733808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3046054759","display_name":null,"funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3204028192","display_name":null,"funder_award_id":"CCF-1650733, CCF-1733808, CCF-1740751, IIS-1741137","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3330119427","display_name":null,"funder_award_id":"EPSRC","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3970753504","display_name":null,"funder_award_id":"1147/09","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3976577995","display_name":"EAGER: Testing Pseudorandom Distributions","funder_award_id":"1650733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5075395233","display_name":"AitF: Collaborative Research: Fast, Accurate, and Practical: Adaptive Sublinear Algorithms for Scalable Visualization","funder_award_id":"1733808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5270222991","display_name":"BIGDATA: F: Testing High Dimensional Distributions without the Curse of Dimensionality","funder_award_id":"1741137","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5359182211","display_name":null,"funder_award_id":"CCF-1740751","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7685655407","display_name":null,"funder_award_id":"1740751","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8654818507","display_name":null,"funder_award_id":"Mathematics","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8657054497","display_name":"Sublinear Algorithms for Big Graphs","funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320279","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2788015272.pdf","grobid_xml":"https://content.openalex.org/works/W2788015272.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W816673839","https://openalex.org/W1503698146","https://openalex.org/W1514707655","https://openalex.org/W1598064945","https://openalex.org/W1666479227","https://openalex.org/W1816797629","https://openalex.org/W1836916015","https://openalex.org/W1845051857","https://openalex.org/W1866858131","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1985361054","https://openalex.org/W1992996565","https://openalex.org/W1993913882","https://openalex.org/W2008199814","https://openalex.org/W2040011014","https://openalex.org/W2051586153","https://openalex.org/W2056695987","https://openalex.org/W2057082426","https://openalex.org/W2073975876","https://openalex.org/W2100061495","https://openalex.org/W2100830825","https://openalex.org/W2107008873","https://openalex.org/W2107600509","https://openalex.org/W2107805020","https://openalex.org/W2112009244","https://openalex.org/W2139535340","https://openalex.org/W2151690061","https://openalex.org/W2153977620","https://openalex.org/W2161176300","https://openalex.org/W2163841653","https://openalex.org/W2173213060","https://openalex.org/W2174199856","https://openalex.org/W2189465200","https://openalex.org/W2344116943","https://openalex.org/W2347049918","https://openalex.org/W2488670996","https://openalex.org/W2619776170","https://openalex.org/W2734687249","https://openalex.org/W2739022923","https://openalex.org/W2755229948","https://openalex.org/W2767578875","https://openalex.org/W2776603735","https://openalex.org/W2950813619","https://openalex.org/W2952490263","https://openalex.org/W2953271509","https://openalex.org/W2961211810","https://openalex.org/W2964107726","https://openalex.org/W2995564009","https://openalex.org/W4239429564"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W2079263399","https://openalex.org/W1558145674","https://openalex.org/W2544075308","https://openalex.org/W1502186998","https://openalex.org/W2963353311","https://openalex.org/W2043560626","https://openalex.org/W1968635621"],"abstract_inverted_index":{"We":[0],"present":[1],"O(loglog":[2],"n)":[3],"-round":[4],"algorithms":[5],"in":[6],"the":[7,48,51],"Massively":[8],"Parallel":[9],"Computation":[10],"(MPC)":[11],"model,":[12],"with":[13],"\u00d5":[14],"(n)":[15],"memory":[16],"per":[17],"machine,":[18],"that":[19],"compute":[20],"a":[21,25,32],"maximal":[22],"independent":[23],"set,":[24],"1+\u03b5":[26],"approximation":[27],"of":[28,34,50],"maximum":[29],"matching,":[30],"and":[31,42],"2+\u03b5approximation":[33],"minimum":[35],"vertex":[36],"cover,":[37],"for":[38],"any":[39,43],"n-vertex":[40],"graph":[41],"constant":[44],"\\eps>0.":[45],"These":[46],"improve":[47],"state":[49],"art":[52],"as":[53],"follows:":[54]},"counts_by_year":[{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":6}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}