{"id":"https://openalex.org/W4387126966","doi":"https://doi.org/10.1145/3565287.3617979","title":"Poster: Dynamic and NM1-Right Selection for the Parallel Iterative Improvement Stable Matching Algorithm","display_name":"Poster: Dynamic and NM1-Right Selection for the Parallel Iterative Improvement Stable Matching Algorithm","publication_year":2023,"publication_date":"2023-09-28","ids":{"openalex":"https://openalex.org/W4387126966","doi":"https://doi.org/10.1145/3565287.3617979"},"language":"en","primary_location":{"id":"doi:10.1145/3565287.3617979","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3565287.3617979","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3565287.3617979&file=p568-kyritsis-supp.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3565287.3617979&file=p568-kyritsis-supp.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092959169","display_name":"Alec Kyritsis","orcid":"https://orcid.org/0009-0008-4593-2377"},"institutions":[{"id":"https://openalex.org/I195575238","display_name":"Middlebury College","ror":"https://ror.org/0217hb928","country_code":"US","type":"education","lineage":["https://openalex.org/I195575238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alec Kyritsis","raw_affiliation_strings":["Middlebury College, Middlebury, Vermont, USA"],"raw_orcid":"https://orcid.org/0009-0008-4593-2377","affiliations":[{"raw_affiliation_string":"Middlebury College, Middlebury, Vermont, USA","institution_ids":["https://openalex.org/I195575238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025411202","display_name":"S Wynn","orcid":"https://orcid.org/0009-0001-8060-5610"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott Wynn","raw_affiliation_strings":["University of Washington, Seattle, Seattle, Washington, United States of America"],"raw_orcid":"https://orcid.org/0009-0001-8060-5610","affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, Seattle, Washington, United States of America","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092959170","display_name":"Stephora Alberi","orcid":"https://orcid.org/0009-0001-9110-0909"},"institutions":[{"id":"https://openalex.org/I9364636","display_name":"Salisbury University","ror":"https://ror.org/029gwvs11","country_code":"US","type":"education","lineage":["https://openalex.org/I9364636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephora Cesar Alberi","raw_affiliation_strings":["Salisbury University, Salisbury, Maryland, USA"],"raw_orcid":"https://orcid.org/0009-0001-9110-0909","affiliations":[{"raw_affiliation_string":"Salisbury University, Salisbury, Maryland, USA","institution_ids":["https://openalex.org/I9364636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061179713","display_name":"Enyue Lu","orcid":"https://orcid.org/0009-0008-7283-4617"},"institutions":[{"id":"https://openalex.org/I9364636","display_name":"Salisbury University","ror":"https://ror.org/029gwvs11","country_code":"US","type":"education","lineage":["https://openalex.org/I9364636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Enyue Lu","raw_affiliation_strings":["Salisbury University, Salisbury, Maryland, United States of America"],"raw_orcid":"https://orcid.org/0009-0008-7283-4617","affiliations":[{"raw_affiliation_string":"Salisbury University, Salisbury, Maryland, United States of America","institution_ids":["https://openalex.org/I9364636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15109186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"568","last_page":"570"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6915075182914734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6600709557533264},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6207177042961121},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5970032215118408},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5772498250007629},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.47007614374160767},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.4515296220779419},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4443405866622925},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.44245415925979614},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.41145238280296326},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38357073068618774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28228235244750977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18939527869224548}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6915075182914734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6600709557533264},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6207177042961121},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5970032215118408},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5772498250007629},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.47007614374160767},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.4515296220779419},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4443405866622925},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.44245415925979614},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41145238280296326},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38357073068618774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28228235244750977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18939527869224548},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3565287.3617979","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3565287.3617979","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3565287.3617979&file=p568-kyritsis-supp.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3565287.3617979","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3565287.3617979","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3565287.3617979&file=p568-kyritsis-supp.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5192126221","display_name":"REU Site: EXERCISE - Explore Emerging Computing in Science and Engineering","funder_award_id":"2149591","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387126966.pdf","grobid_xml":"https://content.openalex.org/works/W4387126966.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W2068115726","https://openalex.org/W2604880797"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W4301594054","https://openalex.org/W2794488505","https://openalex.org/W3125889879","https://openalex.org/W3124422538","https://openalex.org/W2295467472","https://openalex.org/W3046451053","https://openalex.org/W2097909533","https://openalex.org/W2144398666","https://openalex.org/W3125188128"],"abstract_inverted_index":{"Sequential":[0],"algorithms":[1],"for":[2,76],"the":[3,12,52,79,103,123],"Stable":[4],"Matching":[5],"Problem":[6],"are":[7],"often":[8],"too":[9],"slow":[10],"in":[11,29,42,65,78,113],"context":[13],"of":[14,68,116],"some":[15],"large":[16],"scale":[17],"applications":[18],"like":[19],"switch":[20],"scheduling.":[21],"Parallel":[22,53],"architectures":[23],"can":[24,119],"offer":[25],"a":[26,33,62],"notable":[27],"reduction":[28],"complexity.":[30],"We":[31,70,100],"propose":[32],"stable":[34,63],"matching":[35,64],"algorithm":[36,47,88,110],"using":[37],"n2":[38],"processors":[39],"that":[40,89],"converges":[41,91,97,112],"O(nlog(n))":[43],"average":[44],"runtime.":[45],"The":[46],"is":[48],"structurally":[49],"based":[50],"on":[51],"Iterative":[54],"Improvement":[55],"(PII)":[56],"Algorithm":[57],"[3],":[58],"which":[59,111],"successfully":[60],"finds":[61],"approximately":[66,114],"90%":[67],"cases.":[69],"suggest":[71,102],"an":[72,87,109],"alternative":[73],"selection":[74,105],"method":[75],"pairs":[77],"PII":[80],"algorithm,":[81],"called":[82],"Dynamic":[83],"Selection,":[84],"leading":[85,107],"to":[86,108,131],"fully":[90],"over":[92],"200,000":[93],"trials":[94],"and":[95,118,128],"generally":[96],"much":[98],"faster.":[99],"also":[101],"Right-Minimum":[104],"method,":[106],"99.9%":[115],"cases":[117],"be":[120],"combined":[121],"with":[122],"PII-SC":[124],"algorithm's":[125],"cycle":[126],"detection":[127],"Gale-Shapley":[129],"Initiation":[130],"remove":[132],"all":[133],"cycles":[134],"observed":[135],"thus":[136],"far.":[137]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}