{"id":"https://openalex.org/W2068078228","doi":"https://doi.org/10.1145/1290672.1290675","title":"Optimal parallel selection","display_name":"Optimal parallel selection","publication_year":2007,"publication_date":"2007-11-01","ids":{"openalex":"https://openalex.org/W2068078228","doi":"https://doi.org/10.1145/1290672.1290675","mag":"2068078228"},"language":"en","primary_location":{"id":"doi:10.1145/1290672.1290675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1290672.1290675","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5091329448","display_name":"Yijie Han","orcid":"https://orcid.org/0000-0003-1305-6815"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yijie Han","raw_affiliation_strings":["University of Missouri at Kansas City, Kansas City, MO"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Missouri at Kansas City, Kansas City, MO","institution_ids":["https://openalex.org/I75421653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091329448"],"corresponding_institution_ids":["https://openalex.org/I75421653"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.14337176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"3","issue":"4","first_page":"38","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9994999766349792,"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.9993000030517578,"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/selection","display_name":"Selection (genetic algorithm)","score":0.800666093826294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6425778865814209},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5685189962387085},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5368747115135193},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.513827383518219},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4795234501361847},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42932820320129395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3998068571090698},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34195342659950256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3214404582977295},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16934525966644287}],"concepts":[{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.800666093826294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6425778865814209},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5685189962387085},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5368747115135193},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.513827383518219},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4795234501361847},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42932820320129395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3998068571090698},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34195342659950256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3214404582977295},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16934525966644287},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1290672.1290675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1290672.1290675","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W52866718","https://openalex.org/W1580560707","https://openalex.org/W1870020915","https://openalex.org/W1968870561","https://openalex.org/W1985478601","https://openalex.org/W1996641400","https://openalex.org/W1999736539","https://openalex.org/W2005608544","https://openalex.org/W2018729969","https://openalex.org/W2022394721","https://openalex.org/W2029386996","https://openalex.org/W2032230430","https://openalex.org/W2033191517","https://openalex.org/W2057567504","https://openalex.org/W2070570981","https://openalex.org/W2072783164","https://openalex.org/W2089062581","https://openalex.org/W2131644182","https://openalex.org/W2610637368","https://openalex.org/W2912298798","https://openalex.org/W2914795306","https://openalex.org/W4255005259"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W2743938404","https://openalex.org/W2099271296","https://openalex.org/W1838063489","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W2025220494","https://openalex.org/W1577155814","https://openalex.org/W1545170796"],"abstract_inverted_index":{"We":[0,40],"present":[1],"an":[2],"optimal":[3],"parallel":[4,33],"selection":[5,34],"algorithm":[6,12],"on":[7,35],"the":[8,28,36],"EREW":[9,37],"PRAM.":[10],"This":[11,25],"runs":[13],"in":[14],"O":[15],"(log":[16],"n":[17,21,23],")":[18],"time":[19],"with":[20],"/log":[22],"processors.":[24],"complexity":[26],"matches":[27],"known":[29],"lower":[30],"bound":[31],"for":[32,49],"PRAM":[38],"model.":[39],"therefore":[41],"close":[42],"this":[43],"problem":[44],"which":[45],"has":[46],"been":[47],"open":[48],"more":[50],"than":[51],"a":[52],"decade.":[53]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}