{"id":"https://openalex.org/W2244586316","doi":"https://doi.org/10.1145/2833179.2833194","title":"How to match in parallel","display_name":"How to match in parallel","publication_year":2015,"publication_date":"2015-11-15","ids":{"openalex":"https://openalex.org/W2244586316","doi":"https://doi.org/10.1145/2833179.2833194","mag":"2244586316"},"language":"en","primary_location":{"id":"doi:10.1145/2833179.2833194","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2833179.2833194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5055182869","display_name":"Alex Pothen","orcid":"https://orcid.org/0000-0002-3421-3325"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alex Pothen","raw_affiliation_strings":["Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055182869"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"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.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"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/computer-science","display_name":"Computer science","score":0.8039822578430176},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7058936953544617},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5751604437828064},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5609167814254761},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5529895424842834},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49687889218330383},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4722810685634613},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43636447191238403},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39929160475730896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37117695808410645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1759796440601349},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.16280204057693481},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1443960964679718}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8039822578430176},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7058936953544617},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5751604437828064},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5609167814254761},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5529895424842834},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49687889218330383},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4722810685634613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43636447191238403},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39929160475730896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37117695808410645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1759796440601349},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.16280204057693481},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1443960964679718},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2833179.2833194","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2833179.2833194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1563554946","https://openalex.org/W2100882406"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W2371352078","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W4382724515","https://openalex.org/W2785998768","https://openalex.org/W2945016732","https://openalex.org/W2349908314","https://openalex.org/W4301272096","https://openalex.org/W2366714142"],"abstract_inverted_index":{"Computing":[0],"a":[1,4,64],"matching":[2,23],"in":[3,13,27,63],"graph":[5],"is":[6,17,44],"one":[7],"of":[8,22],"\"the":[9],"hardest":[10],"simple":[11,18],"problems\"":[12],"computer":[14],"science.":[15],"It":[16,43],"since":[19,54],"most":[20],"variants":[21],"can":[24],"be":[25],"solved":[26],"polynomial":[28],"time,":[29],"yet":[30],"hard":[31],"because":[32],"the":[33,39],"running":[34],"times":[35],"are":[36,41],"high":[37],"and":[38,73],"algorithms":[40,51,56],"complex.":[42],"even":[45],"more":[46],"challenging":[47],"to":[48],"design":[49],"parallel":[50],"for":[52,60],"matching,":[53],"many":[55],"rely":[57],"on":[58],"searching":[59],"long":[61,71],"paths":[62],"graph,":[65],"or":[66],"implicitly":[67],"communicate":[68],"information":[69],"along":[70],"paths,":[72],"thus":[74],"have":[75],"little":[76],"concurrency.":[77]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}