{"id":"https://openalex.org/W2110776243","doi":"https://doi.org/10.1142/s179383091450061x","title":"A randomized sorting algorithm on the BSP model","display_name":"A randomized sorting algorithm on the BSP model","publication_year":2014,"publication_date":"2014-08-20","ids":{"openalex":"https://openalex.org/W2110776243","doi":"https://doi.org/10.1142/s179383091450061x","mag":"2110776243"},"language":"en","primary_location":{"id":"doi:10.1142/s179383091450061x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091450061x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5010296758","display_name":"Alexandros V. Gerbessiotis","orcid":"https://orcid.org/0000-0003-3268-1579"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alexandros V. Gerbessiotis","raw_affiliation_strings":["Computer Science Department, New Jersey Institute of Technology, Newark, NJ 07102, USA","Computer Science Department, New Jersey Institute of Technology, Newark, NJ, 07102, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"Computer Science Department, New Jersey Institute of Technology, Newark, NJ, 07102, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064579630","display_name":"Constantinos J. Siniolakis","orcid":null},"institutions":[{"id":"https://openalex.org/I230915877","display_name":"The American College of Greece","ror":"https://ror.org/03vkake80","country_code":"GR","type":"nonprofit","lineage":["https://openalex.org/I230915877"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Constantinos J. Siniolakis","raw_affiliation_strings":["The American College of Greece, 6 Gravias St., Aghia Paraskevi, Athens 15342, Greece"],"affiliations":[{"raw_affiliation_string":"The American College of Greece, 6 Gravias St., Aghia Paraskevi, Athens 15342, Greece","institution_ids":["https://openalex.org/I230915877"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010296758"],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17125211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"06","issue":"04","first_page":"1450061","last_page":"1450061"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/speedup","display_name":"Speedup","score":0.8157168626785278},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7176347374916077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7128332257270813},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5908453464508057},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5681661367416382},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.565672755241394},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5651794672012329},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5631759762763977},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.554785430431366},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5242717266082764}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8157168626785278},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7176347374916077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7128332257270813},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5908453464508057},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5681661367416382},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.565672755241394},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5651794672012329},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5631759762763977},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.554785430431366},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5242717266082764},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383091450061x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091450061x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1756674692","https://openalex.org/W1975934607","https://openalex.org/W1977171954","https://openalex.org/W1977908721","https://openalex.org/W1978583881","https://openalex.org/W2013206009","https://openalex.org/W2023518480","https://openalex.org/W2025913682","https://openalex.org/W2027637765","https://openalex.org/W2031019393","https://openalex.org/W2033191517","https://openalex.org/W2041097097","https://openalex.org/W2045271686","https://openalex.org/W2047528205","https://openalex.org/W2060999145","https://openalex.org/W2061496873","https://openalex.org/W2092574257","https://openalex.org/W2097755092","https://openalex.org/W2137239103","https://openalex.org/W4235295823"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W797244100","https://openalex.org/W4298155039","https://openalex.org/W2801186172","https://openalex.org/W2367560286","https://openalex.org/W2181812531","https://openalex.org/W2368845094"],"abstract_inverted_index":{"An":[0],"oversampling-based":[1],"randomized":[2,96,140],"algorithm":[3,31,149,173,214],"is":[4,32,61,163],"introduced":[5],"for":[6,34,74,80,103,151],"sorting":[7,48,97,213],"n":[8,115,136],"keys":[9,200],"of":[10,19,69,84,86,106,111,132,156,170,180,195,206,210],"any":[11],"abstract":[12],"data":[13],"type":[14],"on":[15,108,125,175],"the":[16,44,70,109,126,167,171,176,193,198,204,207,211],"p":[17,87,133],"processors":[18],"a":[20,26,63,81,147,154],"latency-tolerant":[21,104,139],"parallel":[22,28,59,112],"system":[23],"such":[24,152,191],"as":[25,192],"bulk-synchronous":[27],"computer.":[29],"The":[30],"asymptotically,":[33],"large":[35],"n,":[36],"optimal":[37,121],"in":[38,188],"computation":[39,107],"and":[40,123,203],"communication":[41],"compared":[42],"to":[43,89,119,135,217],"best":[45],"available":[46],"sequential":[47,72],"algorithm,":[49],"even":[50],"when":[51],"constant":[52],"factors":[53],"are":[54,184,201],"taken":[55],"into":[56,146],"consideration.":[57],"Its":[58],"time":[60],"within":[62],"(1":[64],"+":[65,161],"o(1))/p":[66],"multiplicative":[67],"factor":[68],"corresponding":[71],"method":[73],"sorting,":[75,182],"improving":[76],"upon":[77,94],"other":[78,95,138],"approaches":[79],"wider":[82],"range":[83],"values":[85,131],"relative":[88],"n.":[90],"It":[91],"also":[92],"improves":[93],"algorithms":[98],"that":[99,215],"have":[100],"been":[101],"developed":[102],"models":[105],"amount":[110],"slack":[113],"(ratio":[114],"over":[116],"p)":[117],"required":[118],"achieve":[120],"speedup":[122,155],"also,":[124],"associated":[127],"failure":[128],"probability.":[129],"For":[130],"closer":[134],"than":[137,159],"approaches,":[141],"it":[142],"can":[143],"be":[144],"turned":[145],"PRAM-like":[148],"but":[150],"cases":[153],"O(p)":[157],"rather":[158],"p/(1":[160],"o(1))":[162],"then":[164],"achievable.":[165],"Although":[166],"general":[168],"framework":[169],"proposed":[172],"relies":[174],"well-established":[177],"prior":[178],"idea":[179],"sample-based":[181],"there":[183],"some":[185],"novel":[186],"features":[187],"its":[189,218],"design":[190],"choice":[194],"splitter":[196],"size,":[197],"way":[199],"split,":[202],"handling":[205],"base":[208],"case":[209],"recursive":[212],"contribute":[216],"performance.":[219]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}