{"id":"https://openalex.org/W4404849328","doi":"https://doi.org/10.1109/focs61266.2024.00049","title":"An Optimal Algorithm for Sorting Pattern-Avoiding Sequences","display_name":"An Optimal Algorithm for Sorting Pattern-Avoiding Sequences","publication_year":2024,"publication_date":"2024-10-27","ids":{"openalex":"https://openalex.org/W4404849328","doi":"https://doi.org/10.1109/focs61266.2024.00049"},"language":"en","primary_location":{"id":"doi:10.1109/focs61266.2024.00049","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs61266.2024.00049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-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/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Michal Opler","raw_affiliation_strings":["Czech Technical University in Prague,Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague,Czechia","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006649123"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.2778,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64697643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"689","last_page":"699"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9574999809265137,"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.9574999809265137,"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/computer-science","display_name":"Computer science","score":0.7133177518844604},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.67399662733078},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5664530396461487},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4738647937774658},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.41782280802726746}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7133177518844604},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.67399662733078},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5664530396461487},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4738647937774658},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.41782280802726746}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs61266.2024.00049","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs61266.2024.00049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1515964912","https://openalex.org/W1956214747","https://openalex.org/W1965525854","https://openalex.org/W1993875587","https://openalex.org/W2037022974","https://openalex.org/W2091015960","https://openalex.org/W2091505308","https://openalex.org/W2130055503","https://openalex.org/W2397978869","https://openalex.org/W2950143318","https://openalex.org/W2963787010","https://openalex.org/W2983155364","https://openalex.org/W2999007559","https://openalex.org/W3216575656","https://openalex.org/W4242724277","https://openalex.org/W4316652367","https://openalex.org/W4390575932","https://openalex.org/W4390575957","https://openalex.org/W4399522310"],"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],"present":[1],"a":[2,10,25,63,68],"deterministic":[3],"comparison-based":[4],"algorithm":[5,51,70],"that":[6],"sorts":[7],"sequences":[8],"avoiding":[9],"fixed":[11],"permutation":[12],"<tex":[13,21,38],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[14,22,39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\pi$</tex>":[15,23,40],"in":[16],"linear":[17],"time,":[18],"even":[19],"if":[20],"is":[24,49],"priori":[26],"unkown.":[27],"Moreover,":[28],"the":[29,32,36,42,59],"dependence":[30],"of":[31,74],"multiplicative":[33],"constant":[34],"on":[35,58],"pattern":[37],"matches":[41],"information-theoretic":[43],"lower":[44],"bound.":[45],"A":[46],"crucial":[47],"ingredient":[48],"an":[50],"for":[52,71],"performing":[53],"efficient":[54],"multi-way":[55],"merge":[56],"based":[57],"Marcus-Tardos":[60],"theorem.":[61],"As":[62],"direct":[64],"corollary,":[65],"we":[66],"obtain":[67],"linear-time":[69],"sorting":[72],"permutations":[73],"bounded":[75],"twin-width.":[76]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}