{"id":"https://openalex.org/W1616503698","doi":"https://doi.org/10.1109/ispan.2002.1004305","title":"Block sorting is hard","display_name":"Block sorting is hard","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1616503698","doi":"https://doi.org/10.1109/ispan.2002.1004305","mag":"1616503698"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2002.1004305","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","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/A5081125543","display_name":"Wolfgang Bein","orcid":"https://orcid.org/0000-0001-7159-9880"},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W.W. Bein","raw_affiliation_strings":["Department of Computer Science, University of Nevada, Las Vegas, NV","Department of Computer Science, University of Nevada, Las Vegas, NV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nevada, Las Vegas, NV","institution_ids":["https://openalex.org/I133999245"]},{"raw_affiliation_string":"Department of Computer Science, University of Nevada, Las Vegas, NV, USA","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038877069","display_name":"Lawrence L. Larmore","orcid":null},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L.L. Larmore","raw_affiliation_strings":["Department of Computer Science, University of Nevada, Las Vegas, NV","Department of Computer Science, University of Nevada, Las Vegas, NV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nevada, Las Vegas, NV","institution_ids":["https://openalex.org/I133999245"]},{"raw_affiliation_string":"Department of Computer Science, University of Nevada, Las Vegas, NV, USA","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050903344","display_name":"S. Latifi","orcid":"https://orcid.org/0009-0002-6771-8001"},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Latifi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Uni-versity of Nevada, Las Vegas, NV"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Uni-versity of Nevada, Las Vegas, NV","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061707475","display_name":"I. Hal Sudborough","orcid":"https://orcid.org/0000-0002-7192-9891"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I.H. Sudborough","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.176,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.56226712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"349","last_page":"354"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9962999820709229,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9957000017166138,"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/sorting","display_name":"Sorting","score":0.8731163740158081},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.802582859992981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6954311728477478},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6137460470199585},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.4948734641075134},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4485350251197815},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43787795305252075},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.4245303273200989},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40381619334220886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36032021045684814},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20107024908065796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19587454199790955},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14838513731956482}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8731163740158081},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.802582859992981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6954311728477478},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6137460470199585},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.4948734641075134},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4485350251197815},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43787795305252075},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.4245303273200989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40381619334220886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36032021045684814},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20107024908065796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19587454199790955},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14838513731956482},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispan.2002.1004305","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","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":10,"referenced_works":["https://openalex.org/W1973518576","https://openalex.org/W1980815056","https://openalex.org/W2011039300","https://openalex.org/W2023749136","https://openalex.org/W2025402252","https://openalex.org/W2054344911","https://openalex.org/W2070449673","https://openalex.org/W2157622572","https://openalex.org/W2159784428","https://openalex.org/W6668006114"],"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":{"Block":[0],"sorting":[1,28,62],"is":[2,29],"used":[3],"in":[4,21],"connection":[5],"with":[6,32],"optical":[7],"character":[8],"recognition":[9],"(OCR).":[10],"Recent":[11],"work":[12,20],"has":[13],"focused":[14],"on":[15],"finding":[16],"good":[17],"strategies":[18],"which":[19],"practice.":[22],"We":[23,47],"show":[24,56],"that":[25,57],"optimizing":[26],"block":[27,61],"NP-hard.":[30],"Along":[31],"this":[33,66],"result,":[34],"we":[35],"give":[36],"new":[37],"non-trivial":[38],"lower":[39],"bounds.":[40],"These":[41],"bounds":[42],"can":[43],"be":[44],"computed":[45],"efficiently.":[46],"define":[48],"the":[49],"concept":[50],"of":[51],"local":[52],"property":[53],"algorithms":[54,63],"and":[55],"several":[58],"previously":[59],"published":[60],"fall":[64],"into":[65],"class.":[67]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}