{"id":"https://openalex.org/W2908983407","doi":"https://doi.org/10.1145/3617360","title":"Exponentially Faster Massively Parallel Maximal Matching","display_name":"Exponentially Faster Massively Parallel Maximal Matching","publication_year":2023,"publication_date":"2023-08-25","ids":{"openalex":"https://openalex.org/W2908983407","doi":"https://doi.org/10.1145/3617360","mag":"2908983407"},"language":"en","primary_location":{"id":"doi:10.1145/3617360","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3617360","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["Khoury College of Computer Sciences, Northeastern University, USA"],"affiliations":[{"raw_affiliation_string":"Khoury College of Computer Sciences, Northeastern University, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammadtaghi Hajiaghayi","raw_affiliation_strings":["Department of Computer Science, University of Maryland, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101783327","display_name":"David G. Harris","orcid":"https://orcid.org/0000-0002-3021-3555"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. Harris","raw_affiliation_strings":["Department of Computer Science, University of Maryland, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025934584"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.5943,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.6845367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"70","issue":"5","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.6874582767486572},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6612671613693237},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5740158557891846},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5718885064125061},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.548879861831665},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5160853266716003},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.5140017867088318},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4827077388763428},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4539681077003479},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.43856820464134216},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41892439126968384},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4132882356643677},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4118122458457947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37870633602142334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32549792528152466},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2687505781650543},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.18480026721954346}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6874582767486572},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6612671613693237},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5740158557891846},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5718885064125061},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.548879861831665},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5160853266716003},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.5140017867088318},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4827077388763428},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4539681077003479},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.43856820464134216},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41892439126968384},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4132882356643677},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4118122458457947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37870633602142334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32549792528152466},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2687505781650543},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.18480026721954346},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3617360","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3617360","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1514707655","https://openalex.org/W1539682630","https://openalex.org/W1836916015","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1993913882","https://openalex.org/W2040820014","https://openalex.org/W2051586153","https://openalex.org/W2057082426","https://openalex.org/W2071114738","https://openalex.org/W2107600509","https://openalex.org/W2109330224","https://openalex.org/W2137118456","https://openalex.org/W2139535340","https://openalex.org/W2153977620","https://openalex.org/W2161176300","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2607666848","https://openalex.org/W2619776170","https://openalex.org/W2734687249","https://openalex.org/W2737112087","https://openalex.org/W2739022923","https://openalex.org/W2755229948","https://openalex.org/W2765269579","https://openalex.org/W2767578875","https://openalex.org/W2768882697","https://openalex.org/W2788015272","https://openalex.org/W2799344251","https://openalex.org/W2884123809","https://openalex.org/W2884132620","https://openalex.org/W2884459710","https://openalex.org/W2900062269","https://openalex.org/W2951940772","https://openalex.org/W2953271509","https://openalex.org/W2962710457","https://openalex.org/W2963298291","https://openalex.org/W2963629655","https://openalex.org/W2983623630","https://openalex.org/W4213146104","https://openalex.org/W4282006258","https://openalex.org/W4285518354"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672","https://openalex.org/W2950408827","https://openalex.org/W2403340448"],"abstract_inverted_index":{"The":[0,108],"study":[1],"of":[2,17,28,34,38,64,82,91,226],"approximate":[3,173,208],"matching":[4,30,49,123,152],"in":[5,160,177,217,222],"the":[6,35,111,115,134,179,186,218,223],"Massively":[7],"Parallel":[8],"Computations":[9],"(MPC)":[10],"model":[11,221],"has":[12],"recently":[13],"seen":[14],"a":[15,25,60,79,89,119,171],"burst":[16],"breakthroughs.":[18],"Despite":[19],"this":[20,71,75,130],"progress,":[21],"we":[22,73,169],"still":[23],"have":[24],"limited":[26],"understanding":[27],"maximal":[29,48,122,151],"which":[31,54,87,184],"is":[32,55,88,185],"one":[33],"central":[36],"problems":[37],"parallel":[39],"and":[40,103,117,182],"distributed":[41],"computing.":[42],"All":[43,210],"known":[44],"MPC":[45],"algorithms":[46],"for":[47,150,204],"either":[50],"take":[51],"polylogarithmic":[52],"time":[53],"considered":[56],"inefficient,":[57],"or":[58],"require":[59],"strictly":[61],"super-linear":[62],"space":[63,155],"n":[65,161],"1+\u03a9":[66],"(1)":[67],"per":[68],"machine.":[69],"In":[70],"work,":[72],"close":[74],"gap":[76],"by":[77,97],"providing":[78],"novel":[80],"analysis":[81],"an":[83,92,143,166,196],"extremely":[84],"simple":[85],"algorithm,":[86],"variant":[90],"algorithm":[93,109,131,149,203],"conjectured":[94],"to":[95,142],"work":[96],"Czumaj,":[98],"Lacki,":[99],"Madry,":[100],"Mitrovic,":[101],"Onak,":[102],"Sankowski":[104],"[":[105],"15":[106],"].":[107],"edge-samples":[110],"graph,":[112],"randomly":[113],"partitions":[114],"vertices,":[116],"finds":[118],"random":[120],"greedy":[121],"within":[124],"each":[125],"partition.":[126],"We":[127,193],"show":[128],"that":[129],"drastically":[132],"reduces":[133],"vertex":[135,175],"degrees.":[136],"This,":[137],"among":[138],"other":[139],"results,":[140],"leads":[141],"O":[144,198],"(log":[145,199],"log":[146,200],"\u0394)":[147,201],"round":[148,202],"with":[153],"O(n)":[154],"(or":[156],"even":[157],"mildly":[158],"sublinear":[159],"using":[162],"standard":[163,191],"techniques).":[164],"As":[165],"immediate":[167],"corollary,":[168],"get":[170,195],"2":[172],"minimum":[174],"cover":[176],"essentially":[178],"same":[180,224],"rounds":[181],"space,":[183],"optimal":[187],"approximation":[188],"factor":[189],"under":[190],"assumptions.":[192],"also":[194,214],"improved":[197],"1":[205],"+":[206],"\u03b5":[207],"matching.":[209],"these":[211],"results":[212],"can":[213],"be":[215],"implemented":[216],"congested":[219],"clique":[220],"number":[225],"rounds.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}