{"id":"https://openalex.org/W4405845699","doi":"https://doi.org/10.1145/3710795.3710805","title":"<scp>ExpoSort</scp> : Breaking the quasi-polynomial-time barrier for reluctant sorting","display_name":"<scp>ExpoSort</scp> : Breaking the quasi-polynomial-time barrier for reluctant sorting","publication_year":2024,"publication_date":"2024-12-27","ids":{"openalex":"https://openalex.org/W4405845699","doi":"https://doi.org/10.1145/3710795.3710805"},"language":"en","primary_location":{"id":"doi:10.1145/3710795.3710805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3710795.3710805","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5017343893","display_name":"Mikkel Abrahamsen","orcid":"https://orcid.org/0000-0003-2734-4690"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Mikkel Abrahamsen","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017343893"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2093717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"55","issue":"4","first_page":"108","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12238","display_name":"Green IT and Sustainability","score":0.9126999974250793,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12238","display_name":"Green IT and Sustainability","score":0.9126999974250793,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6349828243255615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46149927377700806},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36707040667533875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3300562798976898},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14311811327934265}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6349828243255615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46149927377700806},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36707040667533875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3300562798976898},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14311811327934265}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3710795.3710805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3710795.3710805","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/26fe875e-6356-49f1-a5bd-01271e99fa3e","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/26fe875e-6356-49f1-a5bd-01271e99fa3e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abrahamsen , M 2024 , ' ExpoSort : Breaking the quasi-polynomial-time barrier for reluctant sorting ' , S I G A C T News , vol. 55 , no. 4 , pp. 108-111 . https://doi.org/10.1145/3710795.3710805","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1992002174","https://openalex.org/W2084396335","https://openalex.org/W4372046852","https://openalex.org/W6750773130"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,26,29,36,46,60,64,85,113,139],"algorithm":[3,32,50],"ExpoSort,":[4],"a":[5,16,94,136,148],"groundbreaking":[6],"method":[7],"that":[8],"sorts":[9],"an":[10,102,108,158],"array":[11],"of":[12,28,45,84,112,122,132,138],"n":[13,20,41],"numbers":[14],"in":[15,151,155],"spectacularly":[17],"inefficient":[18],"\u0398(2":[19],")":[21,44],"time.":[22,76],"ExpoSort":[23,68,78,106,133],"proudly":[24],"claims":[25],"title":[27],"first":[30],"reluctant":[31],"to":[33,73],"decisively":[34],"surpass":[35],"quasi-polynomial":[37],"running":[38,120],"time":[39],"\u03a9(":[40],"log":[42],"n/(2+\u03b5)":[43],"notoriously":[47],"sluggish":[48],"SlowSort":[49],"by":[51],"Broder":[52],"and":[53,118,124],"Stolfi":[54],"[ACM":[55],"SIGACT":[56],"News,":[57],"1984].":[58],"In":[59],"ongoing":[61],"quest":[62],"for":[63],"slowest":[65],"possible":[66],"sort,":[67],"redefines":[69],"what":[70],"it":[71],"means":[72],"take":[74],"one's":[75],"Remarkably,":[77],"achieves":[79],"this":[80],"feat":[81],"with":[82,116],"one":[83,98],"simplest":[86],"pseudocodes":[87],"among":[88],"all":[89],"known":[90],"sorting":[91],"algorithms.":[92],"However,":[93],"slight":[95,149],"modification-merely":[96],"moving":[97],"recursive":[99],"call":[100],"inside":[101],"if":[103],"statement-":[104],"transforms":[105],"into":[107],"astonishingly":[109],"well-camouflaged":[110],"variant":[111],"classic":[114],"InsertionSort":[115],"best-":[117],"worst-case":[119],"times":[121],"\u0398(n)":[123],"\u0398(n":[125],"3":[126],"),":[127],"respectively.":[128],"This":[129],"dual":[130],"nature":[131],"serves":[134],"as":[135],"reminder":[137],"utmost":[140],"care":[141],"required":[142],"when":[143],"crafting":[144],"pessimal":[145],"algorithms,":[146],"where":[147],"lapse":[150],"judgment":[152],"could":[153],"result":[154],"accidentally":[156],"producing":[157],"embarrassingly":[159],"practical":[160],"algorithm.":[161]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}