{"id":"https://openalex.org/W1994613175","doi":"https://doi.org/10.1145/1073970.1073994","title":"Processor efficient parallel matching","display_name":"Processor efficient parallel matching","publication_year":2005,"publication_date":"2005-07-18","ids":{"openalex":"https://openalex.org/W1994613175","doi":"https://doi.org/10.1145/1073970.1073994","mag":"1994613175"},"language":"en","primary_location":{"id":"doi:10.1145/1073970.1073994","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual 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/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["Warsaw University, Banacha, Warsaw","Warsaw University, Banacha, Warsaw#TAB#"],"affiliations":[{"raw_affiliation_string":"Warsaw University, Banacha, Warsaw","institution_ids":[]},{"raw_affiliation_string":"Warsaw University, Banacha, Warsaw#TAB#","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025494465"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.5469,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83152636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965000152587891,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9961000084877014,"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.7386633157730103},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6631437540054321},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4710944592952728},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09659579396247864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7386633157730103},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6631437540054321},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4710944592952728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09659579396247864},{"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/1073970.1073994","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W1494735819","https://openalex.org/W1592014028","https://openalex.org/W1599026900","https://openalex.org/W1981234161","https://openalex.org/W1985061810","https://openalex.org/W1995653528","https://openalex.org/W2000520486","https://openalex.org/W2003813631","https://openalex.org/W2011594074","https://openalex.org/W2012857639","https://openalex.org/W2014302352","https://openalex.org/W2040699536","https://openalex.org/W2059608229","https://openalex.org/W2080063509","https://openalex.org/W2080132708","https://openalex.org/W2086095242","https://openalex.org/W2089939118","https://openalex.org/W2091299439","https://openalex.org/W2128978199","https://openalex.org/W2138560648","https://openalex.org/W2156281098","https://openalex.org/W2610729871","https://openalex.org/W4213035659","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"the":[5],"problem":[6],"of":[7,41,49],"finding":[8],"perfect":[9],"matchings":[10],"in":[11,21],"parallel.":[12],"We":[13],"present":[14],"a":[15,42],"RNC":[16,36],"algorithm":[17,31,37],"with":[18],"optimal":[19],"work":[20],"respect":[22],"to":[23],"sequential":[24],"algorithms,":[25],"i.e.,":[26],"it":[27],"uses":[28],"O(n\u03c9)":[29],"processors.Our":[30],"is":[32,48],"based":[33],"on":[34],"an":[35],"for":[38],"computing":[39],"determinant":[40],"degree":[43],"one":[44],"polynomial":[45],"matrix,":[46],"which":[47],"independent":[50],"interest.":[51]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}