{"id":"https://openalex.org/W2091172700","doi":"https://doi.org/10.1016/0304-3975(86)90033-2","title":"The automated proof of a trace transformation for a bitonic sort","display_name":"The automated proof of a trace transformation for a bitonic sort","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W2091172700","doi":"https://doi.org/10.1016/0304-3975(86)90033-2","mag":"2091172700"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(86)90033-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(86)90033-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5113513871","display_name":"Chua-Huang Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chua-Huang Huang","raw_affiliation_strings":["Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712, U.S.A","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001151726","display_name":"Christian Lengauer","orcid":"https://orcid.org/0000-0002-2717-3417"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christian Lengauer","raw_affiliation_strings":["Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712, U.S.A","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":2.3274,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91154117,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"46","issue":null,"first_page":"261","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.8082876205444336},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6743896007537842},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6139587163925171},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5764309167861938},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.4250907897949219},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41903722286224365},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.390055775642395},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3832724690437317},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.38240450620651245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3346879482269287}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8082876205444336},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6743896007537842},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6139587163925171},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5764309167861938},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.4250907897949219},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41903722286224365},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.390055775642395},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3832724690437317},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.38240450620651245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3346879482269287},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(86)90033-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(86)90033-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1590828018","https://openalex.org/W1657911928","https://openalex.org/W1831168438","https://openalex.org/W1968865821","https://openalex.org/W1969429016","https://openalex.org/W2032889498","https://openalex.org/W2050468996","https://openalex.org/W2103953153","https://openalex.org/W2115783276","https://openalex.org/W3145843332","https://openalex.org/W3148428321","https://openalex.org/W4206362261","https://openalex.org/W6636902702","https://openalex.org/W6638588729","https://openalex.org/W6662923337","https://openalex.org/W6675350323","https://openalex.org/W6675436430"],"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/W4239051739","https://openalex.org/W2374324126","https://openalex.org/W2381187503","https://openalex.org/W2054216114"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}