{"id":"https://openalex.org/W4412480918","doi":"https://doi.org/10.1145/3694906.3743313","title":"Parallel Batch-Dynamic Maximal Matching with Constant Work per Update","display_name":"Parallel Batch-Dynamic Maximal Matching with Constant Work per Update","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480918","doi":"https://doi.org/10.1145/3694906.3743313"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743313","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743313","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743313","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","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/3694906.3743313","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0003-0224-9187","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026811793","display_name":"Andrew C. Brady","orcid":"https://orcid.org/0000-0002-6117-013X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew C. Brady","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0002-6117-013X","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033930662"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.3364,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83636036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9957000017166138,"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/constant","display_name":"Constant (computer programming)","score":0.7477656602859497},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6841863393783569},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.6222308874130249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5548831820487976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3090212941169739},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.18323540687561035},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09324786067008972},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08028608560562134}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7477656602859497},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6841863393783569},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.6222308874130249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5548831820487976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3090212941169739},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.18323540687561035},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09324786067008972},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08028608560562134},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743313","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743313","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743313","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743313","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743313","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743313","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2800917607","display_name":null,"funder_award_id":"CCF-2119352","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3590458404","display_name":null,"funder_award_id":"CCF-2119352,CCF-1919223","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G5360328037","display_name":"Collaborative Research: PPoSS: LARGE: Unifying Software and Hardware to Achieve Performant and Scalable Frictionless Parallelism in the Heterogeneous Future","funder_award_id":"2119352","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6550909468","display_name":null,"funder_award_id":"CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G82646606","display_name":"SPX: Parallel Models and Algorithms for Emerging Memory Systems","funder_award_id":"1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412480918.pdf","grobid_xml":"https://content.openalex.org/works/W4412480918.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W2096413587","https://openalex.org/W2146343385","https://openalex.org/W2151690061","https://openalex.org/W2152993997","https://openalex.org/W2183531780","https://openalex.org/W2436525433","https://openalex.org/W2993198966","https://openalex.org/W3006157595","https://openalex.org/W3013028797","https://openalex.org/W3035470141","https://openalex.org/W3037464308","https://openalex.org/W3041103022","https://openalex.org/W3041171185","https://openalex.org/W4233756358","https://openalex.org/W4285005134","https://openalex.org/W4372046852","https://openalex.org/W4400919804","https://openalex.org/W4412480918","https://openalex.org/W6686176709","https://openalex.org/W6747231970"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"work":[3,31,75],"optimal":[4],"algorithm":[5],"for":[6],"parallel":[7],"fully":[8],"batch-dynamic":[9],"maximal":[10],"matching":[11],"against":[12],"an":[13],"oblivious":[14],"adversary.":[15],"It":[16],"processes":[17],"batches":[18],"of":[19,25,50],"updates":[20],"(either":[21],"insertions":[22],"or":[23],"deletions":[24],"edges)":[26],"in":[27,36,52],"constant":[28],"expected":[29],"amortized":[30,74],"per":[32,41,76,83],"edge":[33],"update,":[34],"and":[35,66,78],"O":[37,71,79],"(log3":[38],"m)":[39,73,81],"depth":[40,82],"batch":[42],"whp,":[43],"where":[44],"m":[45],"is":[46],"the":[47,53,61],"maximum":[48],"number":[49],"edges":[51],"graph":[54],"over":[55],"time.":[56],"This":[57],"greatly":[58],"improves":[59],"on":[60],"recent":[62],"result":[63],"by":[64],"Ghaffari":[65],"Trygub":[67],"(2024)":[68],"that":[69],"requires":[70],"(log9":[72],"update":[77],"(log4":[80],"batch,":[84],"both":[85],"whp.":[86]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}