{"id":"https://openalex.org/W4399056078","doi":"https://doi.org/10.29007/lzks","title":"Minimizing Sorting Networks at the Sub-Comparator Level","display_name":"Minimizing Sorting Networks at the Sub-Comparator Level","publication_year":2024,"publication_date":"2024-05-27","ids":{"openalex":"https://openalex.org/W4399056078","doi":"https://doi.org/10.29007/lzks"},"language":"en","primary_location":{"id":"doi:10.29007/lzks","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/lzks","pdf_url":"https://easychair.org/publications/open/v6QM6","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/v6QM6","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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":["Dept. Mathematics and Computer Science University of Southern Denmark"],"affiliations":[{"raw_affiliation_string":"Dept. Mathematics and Computer Science University of Southern 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":true,"raw_author_name":"Peter Schneider-Kamp","raw_affiliation_strings":["Dept. Mathematics and Computer Science University of Southern Denmark"],"affiliations":[{"raw_affiliation_string":"Dept. Mathematics and Computer Science University of Southern Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058200123"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05737961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"100","issue":null,"first_page":"36","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.998199999332428,"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/T12029","display_name":"DNA and Biological Computing","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/comparator","display_name":"Comparator","score":0.8530627489089966},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7378647327423096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6891853213310242},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.43712109327316284},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.21948271989822388},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13007503747940063},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09959763288497925},{"id":"https://openalex.org/keywords/electrical-engineering","display_name":"Electrical engineering","score":0.09766140580177307},{"id":"https://openalex.org/keywords/voltage","display_name":"Voltage","score":0.0580730140209198}],"concepts":[{"id":"https://openalex.org/C155745195","wikidata":"https://www.wikidata.org/wiki/Q1164179","display_name":"Comparator","level":3,"score":0.8530627489089966},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7378647327423096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6891853213310242},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.43712109327316284},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.21948271989822388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13007503747940063},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09959763288497925},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.09766140580177307},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0580730140209198}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.29007/lzks","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/lzks","pdf_url":"https://easychair.org/publications/open/v6QM6","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/3e5bd2a9-a183-4360-a97a-7fee97467965","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/3e5bd2a9-a183-4360-a97a-7fee97467965","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cruz-Filipe , L &amp; Schneider-Kam , P 2024 , Minimizing Sorting Networks at the Sub-Comparator Level . in Proceedings of 25th Conference on Logic for Programming : Artificial Intelligence and Reasoning . EasyChair Publications , EPiC Series in Computing , vol. 100 , pp. 36-50 , 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2024 , Port Louis , Mauritius , 26/05/2024 . https://doi.org/10.29007/lzks","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.29007/lzks","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/lzks","pdf_url":"https://easychair.org/publications/open/v6QM6","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399056078.pdf","grobid_xml":"https://content.openalex.org/works/W4399056078.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W61634951","https://openalex.org/W83022104","https://openalex.org/W436212935","https://openalex.org/W997071912","https://openalex.org/W1497184866","https://openalex.org/W1531368310","https://openalex.org/W1608906437","https://openalex.org/W1698340567","https://openalex.org/W1726079515","https://openalex.org/W2013382394","https://openalex.org/W2017461851","https://openalex.org/W2051252048","https://openalex.org/W2059260192","https://openalex.org/W2066458832","https://openalex.org/W2104800284","https://openalex.org/W2141389982","https://openalex.org/W2147229907","https://openalex.org/W2149415591","https://openalex.org/W2152278102","https://openalex.org/W2155642174","https://openalex.org/W2168961888","https://openalex.org/W2208979138","https://openalex.org/W2548557305","https://openalex.org/W2584482282","https://openalex.org/W2622132947","https://openalex.org/W4280496378","https://openalex.org/W4288079114","https://openalex.org/W4292869481","https://openalex.org/W4379739787"],"related_works":["https://openalex.org/W2164888609","https://openalex.org/W2365998105","https://openalex.org/W1521404434","https://openalex.org/W2017461851","https://openalex.org/W2131956217","https://openalex.org/W2168577286","https://openalex.org/W2208979138","https://openalex.org/W2094179388","https://openalex.org/W2122685942","https://openalex.org/W4290075327"],"abstract_inverted_index":{"Sorting":[0],"networks":[1,25,78,147],"are":[2,26,35,56,93,102,154],"sorting":[3,24,50,77,146],"algorithms":[4],"that":[5,89,106],"execute":[6],"a":[7,62,66,96,113],"sequence":[8],"of":[9,13,44,47,75,95,116,145,148],"operations":[10],"indepen-":[11],"dently":[12],"the":[14,142,155],"input.":[15],"Since":[16],"they":[17,34,55],"can":[18,109,127],"be":[19,110],"implemented":[20],"directly":[21],"as":[22],"circuits,":[23],"easy":[27],"to":[28,41,81,131,140,151],"implement":[29],"in":[30,39,61,160],"hardware":[31],"\u2013":[32],"but":[33],"also":[36],"used":[37],"often":[38],"software":[40,161],"improve":[42,141],"performance":[43],"base":[45],"cases":[46],"standard":[48],"recursive":[49],"algorithms.":[51],"For":[52],"this":[53,85,107,129,137],"purpose,":[54],"translated":[57],"into":[58],"machine-code":[59],"instructions":[60,101],"systematic":[63],"way.":[64],"Recently,":[65],"deep-learning":[67],"system":[68],"discovered":[69],"better":[70],"implementations":[71,144],"than":[72],"previously":[73],"known":[74],"some":[76,100],"with":[79],"up":[80,150],"8":[82],"inputs.":[83],"In":[84],"article,":[86],"we":[87,126],"show":[88,105],"all":[90],"these":[91],"examples":[92],"instances":[94],"general":[97,138],"pattern":[98],"whereby":[99],"removed.":[103],"We":[104,134],"removal":[108],"done":[111],"when":[112],"particular":[114],"set":[115],"constraints":[117],"on":[118],"integers":[119],"is":[120],"satisfiable,":[121],"and":[122],"identify":[123],"conditions":[124],"where":[125],"reduce":[128],"problem":[130],"propositional":[132],"satisfiability.":[133],"systematically":[135],"apply":[136],"construction":[139],"best-known":[143],"size":[149],"128,":[152],"which":[153],"ones":[156],"most":[157],"commonly":[158],"found":[159],"implementations.":[162]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
