{"id":"https://openalex.org/W4285013187","doi":"https://doi.org/10.1145/3490148.3538589","title":"Massively Parallel Algorithms for b-Matching","display_name":"Massively Parallel Algorithms for b-Matching","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285013187","doi":"https://doi.org/10.1145/3490148.3538589"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538589","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/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 Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101735840","display_name":"Christoph Grunau","orcid":"https://orcid.org/0000-0002-1057-9429"},"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":false,"raw_author_name":"Christoph Grunau","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["University of California, Davis, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.4382,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6406474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"44"},"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.9995999932289124,"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.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.800876259803772},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7332741022109985},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6632874011993408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5620262622833252},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5446429252624512},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5427359342575073},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5013213157653809},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4937814176082611},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4850739538669586},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4681088626384735},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4646237790584564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4626288115978241},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4127400517463684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33277377486228943}],"concepts":[{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.800876259803772},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7332741022109985},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6632874011993408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5620262622833252},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5446429252624512},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5427359342575073},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5013213157653809},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4937814176082611},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4850739538669586},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4681088626384735},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4646237790584564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4626288115978241},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4127400517463684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33277377486228943},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538589","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1518319036","https://openalex.org/W1947006564","https://openalex.org/W1964932074","https://openalex.org/W2057082426","https://openalex.org/W2100830825","https://openalex.org/W2149565746","https://openalex.org/W2153977620","https://openalex.org/W2173213060","https://openalex.org/W2275325805","https://openalex.org/W2734687249","https://openalex.org/W2765269579","https://openalex.org/W2788015272","https://openalex.org/W2951940772","https://openalex.org/W2962677563","https://openalex.org/W2963298291","https://openalex.org/W2963813153","https://openalex.org/W2971407628","https://openalex.org/W3041372643","https://openalex.org/W3185293089","https://openalex.org/W4213146104"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W4299801389","https://openalex.org/W2963158951"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,37],"O(log":[4],"log":[5],"\u0111)":[6],"round":[7],"massively":[8],"parallel":[9],"algorithm":[10],"for":[11],"1":[12],"+":[13],"\u03b5":[14,35],"approximation":[15],"of":[16,51,64],"maximum":[17],"weighted":[18],"b-matchings,":[19],"using":[20],"near-linear":[21],"memory":[22],"per":[23],"machine.":[24],"Here":[25],"\u0111":[26],"denotes":[27],"the":[28,32,46,52,68],"average":[29],"degree":[30],"in":[31,67],"graph":[33],"and":[34,48],"is":[36,45],"arbitrarily":[38],"small":[39],"positive":[40],"constant.":[41],"Recall":[42],"that":[43],"b-matching":[44],"natural":[47],"well-studied":[49],"generalization":[50],"matching":[53],"problem":[54],"where":[55],"different":[56,62],"vertices":[57],"are":[58],"allowed":[59],"to":[60],"have":[61],"numbers":[63],"incident":[65],"edges":[66],"matching.":[69]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}