{"id":"https://openalex.org/W4378895317","doi":"https://doi.org/10.1145/3558481.3591093","title":"Optimal Parallel Sorting with Comparison Errors","display_name":"Optimal Parallel Sorting with Comparison Errors","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4378895317","doi":"https://doi.org/10.1145/3558481.3591093"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591093","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/cc6e37cb-c41f-4dff-beba-b298cac82e80","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["University of California, Irvine, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072095949","display_name":"Riko Jacob","orcid":"https://orcid.org/0000-0001-9470-1809"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Riko Jacob","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034971300"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":0.5219,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70425275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","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/T10237","display_name":"Cryptography and Data Security","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.9995999932289124,"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.9991999864578247,"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/sorting","display_name":"Sorting","score":0.6924768686294556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6415942907333374},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6321675181388855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6163570880889893},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5082147121429443},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4853323996067047},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4738010764122009},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4730719029903412},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3604598045349121},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2753840982913971},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09083521366119385},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07580742239952087}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6924768686294556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6415942907333374},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6321675181388855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6163570880889893},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5082147121429443},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4853323996067047},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4738010764122009},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4730719029903412},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3604598045349121},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2753840982913971},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09083521366119385},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07580742239952087},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3558481.3591093","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/cc6e37cb-c41f-4dff-beba-b298cac82e80","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/cc6e37cb-c41f-4dff-beba-b298cac82e80","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jacob, R & Goodrich, M T 2023, Optimal Parallel Sorting with Comparison Errors. in Proceedings SPAA '23. Association for Computing Machinery, pp. 355-365. https://doi.org/10.1145/3558481.3591093","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/cc6e37cb-c41f-4dff-beba-b298cac82e80","is_oa":true,"landing_page_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591093","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jacob, R & Goodrich, M T 2023, Optimal Parallel Sorting with Comparison Errors. in Proceedings SPAA '23. Association for Computing Machinery, pp. 355-365. https://doi.org/10.1145/3558481.3591093","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/cc6e37cb-c41f-4dff-beba-b298cac82e80","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/cc6e37cb-c41f-4dff-beba-b298cac82e80","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jacob, R & Goodrich, M T 2023, Optimal Parallel Sorting with Comparison Errors. in Proceedings SPAA '23. Association for Computing Machinery, pp. 355-365. https://doi.org/10.1145/3558481.3591093","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7210885136","display_name":null,"funder_award_id":"2212129","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1520726018","https://openalex.org/W1584086289","https://openalex.org/W1910851252","https://openalex.org/W1952872878","https://openalex.org/W1978583881","https://openalex.org/W1988695498","https://openalex.org/W2011039300","https://openalex.org/W2016350196","https://openalex.org/W2033191517","https://openalex.org/W2038435918","https://openalex.org/W2044712489","https://openalex.org/W2045086034","https://openalex.org/W2058389818","https://openalex.org/W2060690113","https://openalex.org/W2078003433","https://openalex.org/W2080770071","https://openalex.org/W2131306093","https://openalex.org/W2729560458","https://openalex.org/W2766453097","https://openalex.org/W2798931865","https://openalex.org/W2962892929","https://openalex.org/W2993963457","https://openalex.org/W3037464308","https://openalex.org/W3041171185","https://openalex.org/W3125425004","https://openalex.org/W3141585064","https://openalex.org/W3175892554","https://openalex.org/W4210653617","https://openalex.org/W4231916799","https://openalex.org/W4245065778","https://openalex.org/W4255005259","https://openalex.org/W4256289389","https://openalex.org/W4362606277","https://openalex.org/W6665859161","https://openalex.org/W6739075542","https://openalex.org/W6758228589","https://openalex.org/W7033316772"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W2085265870","https://openalex.org/W797244100","https://openalex.org/W1999431223","https://openalex.org/W2043772124","https://openalex.org/W2801186172","https://openalex.org/W2367560286"],"abstract_inverted_index":{"We":[0,14,264],"present":[1],"comparison-based":[2],"parallel":[3,138,181,216,229],"algorithms":[4,115,139,152,177,189,196,217,236],"for":[5,92,140,178,190,218,268,279,288],"sorting":[6,141],"n":[7],"comparable":[8],"items":[9],"subject":[10],"to":[11,17,20,100],"comparison":[12,26,46,76,143],"errors.":[13],"consider":[15],"errors":[16,144],"occur":[18],"according":[19],"a":[21,35,104,118,198,207],"well-studied":[22],"framework,":[23],"where":[24],"the":[25,31,39,42,45,56,69,72,75,109,127,130,146,164,179,191,213,219,223,227,247,250,269,275,280,284,289,297],"of":[27,44,47,62,66,74,77,80,87,126,158,166,200,249],"two":[28,48],"elements":[29,128],"returns":[30],"wrong":[32],"answer":[33],"with":[34,142,183,231,261,292],"fixed":[36],"probability.":[37,263],"In":[38,68,133,233],"persistent":[40,110,147,167,220,251,281],"model,":[41,71,111,252,272],"result":[43,73],"given":[49,105],"elements,":[50,81],"x":[51,82,93],"and":[52,59,83,94,122,148,170,203,211,222,257,283],"y,":[53,84],"always":[54,101],"has":[55],"same":[57],"result,":[58,210],"is":[60,85,97],"independent":[61,86],"all":[63,88],"other":[64],"pairs":[65],"elements.":[67],"non-persistent":[70,149,224,290],"each":[78],"pair":[79],"prior":[89],"comparisons,":[90],"including":[91,206],"y.":[95],"It":[96],"not":[98],"possible":[99],"correctly":[102],"sort":[103],"input":[106],"set":[107],"in":[108,129,145,156,163,226,246,296],"so":[112],"we":[113,136,186],"study":[114],"that":[116],"achieve":[117,265],"small":[119,123],"maximum":[120,169,255],"dislocation":[121,125,256],"total":[124,171,259],"output":[131],"permutation.":[132],"this":[134],"paper,":[135],"provide":[137,188],"models.":[150],"Our":[151,195],"are":[153,176,212,274],"asymptotically":[154],"optimal":[155,215,277,286],"terms":[157],"their":[159],"span,":[160,240],"work,":[161,244],"and,":[162,245],"case":[165,248],"errors,":[168],"dislocation.":[172],"The":[173],"main":[174],"results":[175,267,287],"binary-forking":[180,228],"model":[182,221,225,230,282,291],"atomics,":[184],"but":[185],"also":[187],"CREW":[192,270],"PRAM":[193,271],"model.":[194],"include":[197],"number":[199],"novel":[201],"techniques":[202],"analysis":[204],"tools,":[205],"PRAM-to-binary-forking-model":[208],"simulation":[209],"first":[214,276,285],"atomics.":[232],"particular,":[234],"our":[235],"have":[237],"O(log":[238,253],"n)":[239,243,254],"O(n":[241],"log":[242],"O(n)":[258],"dislocation,":[260],"high":[262],"similar":[266],"which":[273],"methods":[278],"reasonable":[293],"constant":[294],"factors":[295],"performance":[298],"bounds.":[299]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2023-06-01T00:00:00"}