{"id":"https://openalex.org/W2067669259","doi":"https://doi.org/10.1080/00207160304673","title":"Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers","display_name":"Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2067669259","doi":"https://doi.org/10.1080/00207160304673","mag":"2067669259"},"language":"en","primary_location":{"id":"doi:10.1080/00207160304673","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160304673","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5070128994","display_name":"Hong Shen","orcid":"https://orcid.org/0000-0002-3663-6591"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hong Shen","raw_affiliation_strings":["\n                   \n               Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa, 923-1292, Japan","Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-1292, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa, 923-1292, Japan","institution_ids":["https://openalex.org/I177738480"]},{"raw_affiliation_string":"Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-1292, Japan#TAB#","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"middle","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":false,"raw_author_name":"Yijie Han","raw_affiliation_strings":["\n                   \n               Computer Science and Telecommunication Program, University of Missouri, Kansas City, Kansas City, MO, 64110-2499, USA","Computer Science and Telecommunication Program , University of Missouri , Kansas City, Kansas City, MO, 64110-2499, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Computer Science and Telecommunication Program, University of Missouri, Kansas City, Kansas City, MO, 64110-2499, USA","institution_ids":["https://openalex.org/I75421653"]},{"raw_affiliation_string":"Computer Science and Telecommunication Program , University of Missouri , Kansas City, Kansas City, MO, 64110-2499, USA","institution_ids":["https://openalex.org/I75421653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101465265","display_name":"Yi Pan","orcid":"https://orcid.org/0000-0002-2766-3096"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi Pan","raw_affiliation_strings":["\n                   \n               Department of Computer Science, Georgia State University, Atlanta, GA, 30303, USA","Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA 30303, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Computer Science, Georgia State University, Atlanta, GA, 30303, USA","institution_ids":["https://openalex.org/I181565077"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA 30303, USA","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100768983","display_name":"David Evans","orcid":"https://orcid.org/0009-0001-8151-7946"},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David Evans","raw_affiliation_strings":["\n                   \n               Department of Computing, The Nottingham Trent University, Burton Street, Nottingham, NG1 4BU, UK","Department of Computing , The Nottingham Trent University , Burton Street, Nottingham , NG1 4BU , UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Computing, The Nottingham Trent University, Burton Street, Nottingham, NG1 4BU, UK","institution_ids":["https://openalex.org/I52590639"]},{"raw_affiliation_string":"Department of Computing , The Nottingham Trent University , Burton Street, Nottingham , NG1 4BU , UK","institution_ids":["https://openalex.org/I52590639"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.497,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72891895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"80","issue":"2","first_page":"165","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/mimd","display_name":"MIMD","score":0.7851948738098145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6225478649139404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5436069965362549},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49184417724609375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48340120911598206},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4473502039909363},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.42681872844696045},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4194886386394501},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34427207708358765},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2267870008945465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20286864042282104}],"concepts":[{"id":"https://openalex.org/C21032095","wikidata":"https://www.wikidata.org/wiki/Q1149237","display_name":"MIMD","level":2,"score":0.7851948738098145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6225478649139404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5436069965362549},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49184417724609375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48340120911598206},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4473502039909363},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.42681872844696045},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4194886386394501},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34427207708358765},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2267870008945465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20286864042282104}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/00207160304673","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160304673","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.4289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sice.umkc.edu/~hanyij/research/multisel.pdf","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/36756","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/36756","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1080/00207160304673","raw_type":"Journal article"},{"id":"pmh:oai:irep.ntu.ac.uk:5153","is_oa":false,"landing_page_url":"http://irep.ntu.ac.uk/id/eprint/5153/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400559","display_name":"Nottingham Trent University's Institutional Repository (Nottingham Trent Repository)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I52590639","host_organization_name":"Nottingham Trent University","host_organization_lineage":["https://openalex.org/I52590639"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1519425125","https://openalex.org/W1870020915","https://openalex.org/W1967794701","https://openalex.org/W1976284552","https://openalex.org/W1996641400","https://openalex.org/W2005608544","https://openalex.org/W2011579772","https://openalex.org/W2012216209","https://openalex.org/W2015102420","https://openalex.org/W2022394721","https://openalex.org/W2042224449","https://openalex.org/W2044732624","https://openalex.org/W2053422185","https://openalex.org/W2074499935","https://openalex.org/W2129066975","https://openalex.org/W2141389982","https://openalex.org/W2142605451","https://openalex.org/W2143957975","https://openalex.org/W2151407355","https://openalex.org/W2273959428","https://openalex.org/W2513846324","https://openalex.org/W2539879506","https://openalex.org/W4241977206"],"related_works":["https://openalex.org/W2164472685","https://openalex.org/W2115632251","https://openalex.org/W2380486102","https://openalex.org/W2068183895","https://openalex.org/W2018438084","https://openalex.org/W2318278047","https://openalex.org/W2047248243","https://openalex.org/W2006121197","https://openalex.org/W2400276029","https://openalex.org/W1598922803"],"abstract_inverted_index":{"Multiselection":[0],"is":[1,64,69,76,203,231],"the":[2,41,61,81,106,120,155,199,214],"problem":[3,122],"of":[4,14,55,165],"selecting":[5,40,159],"multiple":[6],"elements":[7,47,161,167],"at":[8],"specified":[9],"ranks":[10],"from":[11,45,162],"a":[12,49,142,163,169],"set":[13,164],"arbitrary":[15],"elements.":[16],"In":[17],"this":[18,139],"paper,":[19],"we":[20,145],"first":[21,62,179],"present":[22,147],"an":[23,114],"efficient":[24,79,149],"algorithm":[25,75,140,180,219],"for":[26,39,65,70,90,100,109,119,152,233],"single-element":[27],"selection":[28,121],"that":[29],"runs":[30,181,220],"in":[31,182,198,213,221],"<$>O(sqrt{p}":[32],"+(n/p)":[33],"log":[34,36,131,191,193,227],"p":[35],"(kp/n))<$>":[37],"time":[38,117,183,229],"kth":[42],"smallest":[43],"element":[44],"n":[46,166],"on":[48,123,154,168],"<$>sqrt{p}":[50,170],"times":[51,171],"sqrt{p}<$>":[52,172],"mesh-connected":[53,156],"computer":[54],"<$>p":[56,85,101,110,206],"leq":[57,176],"n<$>":[58],"processors,":[59],"where":[60],"component":[63],"communication":[66],"and":[67,230,236],"second":[68,218],"computation":[71,116],"(data":[72],"comparisons).":[73],"Our":[74],"more":[77],"computationally":[78],"than":[80],"existing":[82,107],"result":[83,99,108],"when":[84,205],"geq":[86],"n\u02c6{1/2":[87],"+":[88,135,185,223],"varepsilon}<$>":[89],"any":[91,234],"<$>0":[92],"lt":[93,95],"varepsilon":[94],"1/2<$>.":[96],"Combining":[97],"our":[98,178,217],"=":[102,111,128],"Omega":[103],"(sqrt{n})<$>":[104],"with":[105,195],"O(sqrt{n})<$>":[112],"yields":[113],"improved":[115],"complexity":[118],"mesh":[124],"<$>t_{rm":[125],"comp}\u02c6{rm":[126,187,225],"sel}":[127,188,226],"O(min":[129],"{(n/p)":[130],"plog":[132],"(kp/n),":[133],"(n/p":[134],"p)":[136],"log(n/p)})<$>.":[137],"Using":[138],"as":[141],"building":[143],"block,":[144],"then":[146],"two":[148],"parallel":[150],"algorithms":[151],"multiselection":[153],"computers.":[157],"For":[158],"r":[160,175,235],"mesh,":[173],"<$>p,":[174],"n<$>,":[177],"<$>O(p\u02c6{1/2}":[184,222],"t_{rm":[186,224],"min":[189],"{r":[190],"r,":[192],"p})<$>":[194],"processors":[196,210],"operating":[197],"SIMD":[200],"mode,":[201,216],"which":[202],"time-optimal":[204,232],"le":[207],"r<$>.":[208],"Allowing":[209],"to":[211],"operate":[212],"MIMD":[215],"r)<$>":[228],"p.":[237]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}