{"id":"https://openalex.org/W2548557305","doi":"https://doi.org/10.1007/s00165-016-0401-3","title":"Optimizing sorting algorithms by using sorting networks","display_name":"Optimizing sorting algorithms by using sorting networks","publication_year":2016,"publication_date":"2016-11-04","ids":{"openalex":"https://openalex.org/W2548557305","doi":"https://doi.org/10.1007/s00165-016-0401-3","mag":"2548557305"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-016-0401-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0401-3","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","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/A5063747415","display_name":"Michael Codish","orcid":"https://orcid.org/0000-0003-0394-5854"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Codish","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, Beersheba, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082561369","display_name":"Lu\u0131\u0301s Cruz-Filipe","orcid":"https://orcid.org/0000-0002-7866-7484"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lu\u00eds Cruz-Filipe","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024961278","display_name":"Markus E. Nebel","orcid":null},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Markus Nebel","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058200123","display_name":"Peter Schneider\u2013Kamp","orcid":"https://orcid.org/0000-0003-4000-5570"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Peter Schneider-Kamp","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5063747415"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.857,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8439881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"29","issue":"3","first_page":"559","last_page":"579"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994000196456909,"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/sorting-algorithm","display_name":"Sorting algorithm","score":0.7776540517807007},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7667350172996521},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6984662413597107},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.6377334594726562},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.628685712814331},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5948206186294556}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7776540517807007},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7667350172996521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6984662413597107},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.6377334594726562},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.628685712814331},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5948206186294556}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-016-0401-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0401-3","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/8a3c01a5-9ae5-490d-bcd2-01b847ec1dda","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/8a3c01a5-9ae5-490d-bcd2-01b847ec1dda","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Codish, M, Cruz-Filipe, L, Nebel, M & Schneider-Kamp, P 2017, 'Optimizing Sorting Algorithms by Using Sorting Networks', Formal Aspects of Computing, vol. 29, no. 3, pp. 559-579. https://doi.org/10.1007/s00165-016-0401-3","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1491961545","https://openalex.org/W1506585561","https://openalex.org/W1518055973","https://openalex.org/W1575587658","https://openalex.org/W1662328649","https://openalex.org/W1887311811","https://openalex.org/W1981177980","https://openalex.org/W2016573082","https://openalex.org/W2065074520","https://openalex.org/W2066458832","https://openalex.org/W2082385702","https://openalex.org/W2141389982","https://openalex.org/W2147229907","https://openalex.org/W2152285609","https://openalex.org/W2155119349","https://openalex.org/W2155720305","https://openalex.org/W2168961888","https://openalex.org/W2208979138","https://openalex.org/W2325315917","https://openalex.org/W2491166573","https://openalex.org/W3103616001","https://openalex.org/W3103995256","https://openalex.org/W3105294273","https://openalex.org/W3198160809","https://openalex.org/W4235295823","https://openalex.org/W4240180700","https://openalex.org/W4242894576"],"related_works":["https://openalex.org/W2396743875","https://openalex.org/W2094179388","https://openalex.org/W2126436988","https://openalex.org/W2325315917","https://openalex.org/W2372558933","https://openalex.org/W2385397541","https://openalex.org/W4391130025","https://openalex.org/W2054216114","https://openalex.org/W2374324126","https://openalex.org/W2381187503"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,105],"paper,":[3],"we":[4,75,95],"show":[5,84,173],"how":[6,138],"the":[7,30,48,51,78,88,153,184],"theory":[8],"of":[9,29,45,80,90,104,115,125,137,152,155],"sorting":[10,19,22,66,73,157,181],"networks":[11,182],"can":[12,76],"be":[13,143],"applied":[14,37],"to":[15,64,99,142,145,161],"synthesize":[16],"optimized":[17],"general-purpose":[18],"libraries.":[20],"Standard":[21],"libraries":[23,189],"are":[24,96,110,127],"often":[25,139],"based":[26],"on":[27],"combinations":[28],"classic":[31],"Quicksort":[32,188],"algorithm,":[33],"with":[34,71],"insertion":[35],"sort":[36],"as":[38,183],"base":[39,52,185],"case":[40,53,186],"for":[41,50,166,187],"small,":[42],"fixed,":[43],"numbers":[44],"inputs.":[46],"Unrolling":[47],"code":[49,62,176],"by":[54,86],"ignoring":[55],"loop":[56],"conditions":[57],"eliminates":[58],"branching,":[59],"resulting":[60],"in":[61,129,191],"equivalent":[63],"a":[65,134,149],"network.":[67],"By":[68],"replacing":[69],"it":[70],"faster":[72],"networks,":[74,158],"improve":[77],"performance":[79,154],"these":[81,179],"algorithms.":[82],"We":[83],"that":[85,174],"considering":[87],"number":[89],"comparisons":[91],"and":[92,119],"swaps":[93],"alone":[94],"not":[97],"able":[98],"predict":[100],"any":[101],"real":[102],"advantage":[103,114],"approach.":[106],"However,":[107],"significant":[108,192],"speed-ups":[109],"obtained":[111],"when":[112],"taking":[113],"instruction":[116],"level":[117],"parallelism":[118],"non-branching":[120],"conditional":[121],"assignment":[122],"instructions,":[123],"both":[124],"which":[126],"common":[128],"modern":[130],"CPU":[131],"architectures.":[132],"Furthermore,":[133],"close":[135],"control":[136],"registers":[140],"have":[141],"spilled":[144],"memory":[146],"gives":[147],"us":[148,160],"complete":[150],"explanation":[151],"different":[156],"allowing":[159],"choose":[162],"an":[163],"optimal":[164],"one":[165],"each":[167],"particular":[168],"architecture.":[169],"Our":[170],"experimental":[171],"results":[172,190],"using":[175],"synthesized":[177],"from":[178],"efficient":[180],"real-world":[193],"speed-ups.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}