{"id":"https://openalex.org/W2028637266","doi":"https://doi.org/10.1109/sfcs.1981.6","title":"A fast probabilistic parallel sorting algorithm","display_name":"A fast probabilistic parallel sorting algorithm","publication_year":1981,"publication_date":"1981-10-01","ids":{"openalex":"https://openalex.org/W2028637266","doi":"https://doi.org/10.1109/sfcs.1981.6","mag":"2028637266"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1981.6","doi":"https://doi.org/10.1109/sfcs.1981.6","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1981.6","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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","observed_orcids":["https://orcid.org/0000-0003-2031-3664"]},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Rudiger Reischuk","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld, Bielefeld, Germany","IBM Research Laboratory, San Jose, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]},{"raw_affiliation_string":"IBM Research Laboratory, San Jose, CA, USA","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089868014"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I20121455"],"apc_list":null,"apc_paid":null,"fwci":3.7253,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.92444444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"219"},"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.8095999956130981,"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.8095999956130981,"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/T11269","display_name":"Algorithms and Data Compression","score":0.10819999873638153,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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.026499999687075615,"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/parallel-sorting","display_name":"parallel sorting","score":0.8690000176429749},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.9789999723434448},{"id":"https://openalex.org/keywords/information-theoretic-lower-bounds","display_name":"information-theoretic lower bounds","score":0.9160000085830688},{"id":"https://openalex.org/keywords/linear-orders","display_name":"linear orders","score":0.5519999861717224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7463282346725464},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7216368913650513},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7153663039207458},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7063605785369873},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6634128093719482},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828273296356201},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.530951201915741},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5290899276733398},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5159741044044495},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49434828758239746},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.45932337641716003},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.44632571935653687},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4403597414493561},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.373339980840683},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2056652009487152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20122593641281128},{"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/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","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/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.1109/sfcs.1981.6","doi":"https://doi.org/10.1109/sfcs.1981.6","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1981.6","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1972897119","https://openalex.org/W1989640573","https://openalex.org/W2089062581"],"related_works":["https://openalex.org/W2033191517","https://openalex.org/W2025260080","https://openalex.org/W2057697239","https://openalex.org/W2079181012","https://openalex.org/W2149410722","https://openalex.org/W2091605543","https://openalex.org/W7096998402","https://openalex.org/W2076357570","https://openalex.org/W7095691789","https://openalex.org/W2023518480"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,23,36],"probabilistic":[3],"parallel":[4,24],"algorithm":[5,18,55],"to":[6],"sort":[7],"n":[8,28],"keys":[9],"drawn":[10],"from":[11],"some":[12],"arbitrary":[13],"total":[14],"ordered":[15],"set.":[16],"This":[17],"can":[19],"be":[20],"implemented":[21],"on":[22],"computer":[25],"consisting":[26],"of":[27,39,58,62],"RAMs,":[29],"each":[30],"with":[31],"small":[32],"private":[33],"memory,":[34],"and":[35,60],"common":[37],"memory":[38],"size":[40],"O(n)":[41],"such":[42],"that":[43],"the":[44,56,65],"average":[45],"runtime":[46],"is":[47],"bounded":[48],"by":[49],"O(log":[50],"n).":[51],"Hence":[52],"for":[53,70],"this":[54],"product":[57],"time":[59],"number":[61],"processors":[63],"meets":[64],"information":[66],"theoretic":[67],"lower":[68],"bound":[69],"sorting.":[71]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}