{"id":"https://openalex.org/W2033191517","doi":"https://doi.org/10.1137/0214030","title":"Probabilistic Parallel Algorithms for Sorting and Selection","display_name":"Probabilistic Parallel Algorithms for Sorting and Selection","publication_year":1985,"publication_date":"1985-05-01","ids":{"openalex":"https://openalex.org/W2033191517","doi":"https://doi.org/10.1137/0214030","mag":"2033191517"},"language":"en","primary_location":{"id":"doi:10.1137/0214030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214030","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5089868014","display_name":"R\u00fcdiger Reischuk","orcid":"https://orcid.org/0000-0003-2031-3664"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R\u00fcdiger Reischuk","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089868014"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2234,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.89948179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"396","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9947999715805054,"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/T11567","display_name":"semigroups and automata theory","score":0.9940999746322632,"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/sorting","display_name":"Sorting","score":0.7405162453651428},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7299941182136536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.613413393497467},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5800256729125977},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5447697043418884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.485910564661026},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.47145208716392517},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46220824122428894},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45963770151138306},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4576302170753479},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.4480118751525879},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.44198888540267944},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4406462609767914},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4301396310329437},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4272571802139282},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4228944480419159},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4178914725780487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36417141556739807},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3511509299278259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33786290884017944},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14719387888908386},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13107964396476746}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7405162453651428},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7299941182136536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.613413393497467},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5800256729125977},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5447697043418884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.485910564661026},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.47145208716392517},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46220824122428894},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45963770151138306},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4576302170753479},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.4480118751525879},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44198888540267944},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4406462609767914},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4301396310329437},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4272571802139282},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4228944480419159},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4178914725780487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36417141556739807},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3511509299278259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33786290884017944},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14719387888908386},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13107964396476746},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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.1137/0214030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214030","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1972897119","https://openalex.org/W1989640573","https://openalex.org/W2015188932","https://openalex.org/W2089062581"],"related_works":["https://openalex.org/W2092071701","https://openalex.org/W1984090248","https://openalex.org/W1605628549","https://openalex.org/W2261051882","https://openalex.org/W2125060070","https://openalex.org/W4297807200","https://openalex.org/W2950857952","https://openalex.org/W1589531489","https://openalex.org/W2391825842","https://openalex.org/W2033191517"],"abstract_inverted_index":{"Probabilistic":[0],"parallel":[1,24,59],"algorithms":[2,78],"are":[3],"described":[4],"to":[5,10],"sort":[6],"n":[7,63],"keys":[8],"and":[9,38,70],"select":[11],"the":[12,39,80],"k-smallest":[13],"element":[14],"among":[15],"them.":[16],"For":[17],"each":[18,65],"problem":[19],"we":[20],"construct":[21],"a":[22,57,71],"probabilistic":[23,58],"decision":[25],"tree.":[26],"The":[27,46],"tree":[28,41],"for":[29,50],"selection":[30],"finishes":[31],"with":[32,66],"high":[33],"probability":[34],"in":[35,42],"constant":[36],"time":[37,43,48],"sorting":[40,51],"$O(\\log":[44],"n)$.":[45],"same":[47],"bound":[49],"can":[52],"also":[53],"be":[54],"achieved":[55],"by":[56],"machine":[60],"consisting":[61],"of":[62,74],"RAMs,":[64],"small":[67],"private":[68],"memory,":[69],"common":[72],"memory":[73],"size":[75],"$O(n)$.":[76],"These":[77],"meet":[79],"information":[81],"theoretic":[82],"lower":[83],"bounds.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}