{"id":"https://openalex.org/W1890752145","doi":"https://doi.org/10.1145/2743020","title":"Optimal Partitioning for Dual-Pivot Quicksort","display_name":"Optimal Partitioning for Dual-Pivot Quicksort","publication_year":2015,"publication_date":"2015-11-17","ids":{"openalex":"https://openalex.org/W1890752145","doi":"https://doi.org/10.1145/2743020","mag":"1890752145"},"language":"en","primary_location":{"id":"doi:10.1145/2743020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2743020","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","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/A5072434673","display_name":"Martin Aum\u00fcller","orcid":"https://orcid.org/0000-0002-7212-6476"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Aum\u00fcller","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067257613","display_name":"Martin Dietzfelbinger","orcid":"https://orcid.org/0000-0001-5484-3474"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Dietzfelbinger","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072434673"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":null,"apc_paid":null,"fwci":2.1572,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89817066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"2","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9948999881744385,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9879000186920166,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quicksort","display_name":"Quicksort","score":0.9959036707878113},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6364623308181763},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5756364464759827},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.535382866859436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5150513648986816},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4750808775424957},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.4575776755809784},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4514145851135254},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.41724666953086853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3440989851951599},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.10272416472434998},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09465759992599487},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06626293063163757},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.06567338109016418},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05683845281600952}],"concepts":[{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.9959036707878113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6364623308181763},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5756364464759827},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.535382866859436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5150513648986816},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4750808775424957},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.4575776755809784},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4514145851135254},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.41724666953086853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3440989851951599},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.10272416472434998},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09465759992599487},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06626293063163757},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.06567338109016418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05683845281600952},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2743020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2743020","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.757.5311","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.757.5311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1303.5217.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W139284288","https://openalex.org/W1480523691","https://openalex.org/W1491961545","https://openalex.org/W1497382427","https://openalex.org/W1507039213","https://openalex.org/W1966637680","https://openalex.org/W1989274820","https://openalex.org/W2000538582","https://openalex.org/W2040046786","https://openalex.org/W2057843273","https://openalex.org/W2125378108","https://openalex.org/W2137661354","https://openalex.org/W2301248961","https://openalex.org/W2395137269","https://openalex.org/W2396145993","https://openalex.org/W2731437525","https://openalex.org/W2752885492","https://openalex.org/W2952270454","https://openalex.org/W3100606013","https://openalex.org/W3105073936","https://openalex.org/W3145128584","https://openalex.org/W3198160809","https://openalex.org/W4235295823","https://openalex.org/W4298072523"],"related_works":["https://openalex.org/W1772474011","https://openalex.org/W1493296159","https://openalex.org/W2065192940","https://openalex.org/W2908348257","https://openalex.org/W76067348","https://openalex.org/W4320925713","https://openalex.org/W2389598404","https://openalex.org/W2551623537","https://openalex.org/W2607162667","https://openalex.org/W2522913298"],"abstract_inverted_index":{"Dual-pivot":[0],"quicksort":[1,7,51,172,181,205],"refers":[2],"to":[3,17,33,41,84,138,197],"variants":[4],"of":[5,88,130,170,187,207],"classical":[6,174],"where":[8],"in":[9,28,53],"the":[10,19,49,127,155,158,201],"partitioning":[11],"step":[12],"two":[13],"pivots":[14,159],"are":[15,160],"used":[16],"split":[18],"input":[20,87],"into":[21],"three":[22],"segments.":[23],"This":[24,142],"can":[25],"be":[26],"done":[27],"different":[29,34],"ways,":[30],"giving":[31],"rise":[32],"algorithms.":[35],"Recently,":[36],"a":[37,109,117,139,163,168,184],"dual-pivot":[38,114,123,171,180],"algorithm":[39,52,66,199,206],"due":[40],"Yaroslavskiy":[42],"received":[43],"much":[44],"attention,":[45],"because":[46],"it":[47,72],"replaced":[48],"well-engineered":[50],"Oracle\u2019s":[54],"Java":[55],"7":[56],"runtime":[57],"library.":[58],"Nebel":[59],"and":[60,67,120,173,194,200],"Wild":[61],"(ESA":[62],"2012)":[63],"analyzed":[64],"this":[65],"showed":[68],"that":[69,111,125,157,179],"on":[70],"average":[71,128],"uses":[73,96],"1.9":[74],"n":[75,77,81,90,98,100,104,146,148,152],"ln":[76,99,147],"+":[78,101,149],"O":[79,102,150],"(":[80,103,151],")":[82,105],"comparisons":[83,132],"sort":[85],"an":[86],"size":[89],",":[91],"beating":[92],"standard":[93],"quicksort,":[94],"which":[95],"2":[97],"comparisons.":[106],"We":[107,189],"introduce":[108],"model":[110],"captures":[112],"all":[113,134],"algorithms,":[115],"give":[116],"unified":[118],"analysis,":[119],"identify":[121],"new":[122],"algorithms":[124,136,193],"minimize":[126],"number":[129],"key":[131],"among":[133],"possible":[135],"up":[137],"linear":[140],"term.":[141],"minimum":[143],"is":[144],"1.8":[145],").":[153],"For":[154],"case":[156],"chosen":[161],"from":[162,183],"small":[164],"sample,":[165],"we":[166,177],"include":[167],"comparison":[169],"quicksort.":[175],"Specifically,":[176],"show":[178],"benefits":[182],"skewed":[185],"choice":[186],"pivots.":[188],"experimentally":[190],"evaluate":[191],"our":[192],"compare":[195],"them":[196],"Yaroslavskiy\u2019s":[198],"recently":[202],"described":[203],"3-pivot":[204],"Kushagra":[208],"et":[209],"al.":[210],"(ALENEX":[211],"2014).":[212]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}