{"id":"https://openalex.org/W1502651785","doi":null,"title":"Practical sorting algorithms for hypercube computers.","display_name":"Practical sorting algorithms for hypercube computers.","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W1502651785","mag":"1502651785"},"language":"en","primary_location":{"id":"pmh:oai:deepblue.lib.umich.edu:2027.42/105304","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/2027.42/105304","pdf_url":null,"source":{"id":"https://openalex.org/S4306400393","display_name":"Deep Blue (University of Michigan)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I27837315","host_organization_name":"University of Michigan","host_organization_lineage":["https://openalex.org/I27837315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5010444057","display_name":"Bruce Alan Wagar","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bruce Alan Wagar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5010444057"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9613999724388123,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9613999724388123,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.023399999365210533,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.003100000089034438,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypercube-multiprocessors","display_name":"hypercube multiprocessors","score":0.7070000171661377},{"id":"https://openalex.org/keywords/parallel-sorting","display_name":"parallel sorting","score":0.8450000286102295},{"id":"https://openalex.org/keywords/parallel-machines","display_name":"parallel machines","score":0.35100001096725464}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7272354364395142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7254192233085632},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7122036218643188},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6532094478607178},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47181689739227295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4677923619747162},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36608877778053284}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:deepblue.lib.umich.edu:2027.42/105304","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/2027.42/105304","pdf_url":null,"source":{"id":"https://openalex.org/S4306400393","display_name":"Deep Blue (University of Michigan)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I27837315","host_organization_name":"University of Michigan","host_organization_lineage":["https://openalex.org/I27837315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"mag:1502651785","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/2027.42/105304","pdf_url":null,"source":{"id":"https://openalex.org/S4306400393","display_name":"Deep Blue (University of Michigan)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I27837315","host_organization_name":"University of Michigan","host_organization_lineage":["https://openalex.org/I27837315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Deep Blue (University of Michigan)","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2263276488","https://openalex.org/W2096109925","https://openalex.org/W2263875077","https://openalex.org/W1999472119","https://openalex.org/W2091549875","https://openalex.org/W1982359878","https://openalex.org/W2205929644","https://openalex.org/W1940307099","https://openalex.org/W1984877584","https://openalex.org/W1973942643"],"abstract_inverted_index":{"We":[0,33,75],"consider":[1],"the":[2,22,39,85,133],"problem":[3],"of":[4,17,38,65],"designing":[5],"a":[6,95],"practical":[7],"and":[8,46,79],"efficient":[9],"sorting":[10],"algorithm":[11,135],"for":[12],"hypercube":[13,19],"computers.":[14],"The":[15],"advent":[16],"commercial":[18],"machines":[20],"in":[21,30,125],"past":[23],"several":[24],"years":[25],"has":[26,83],"sparked":[27],"much":[28],"interest":[29],"this":[31],"problem.":[32],"came":[34],"up":[35,110],"with":[36,58],"one":[37],"first":[40],"such":[41],"algorithms,":[42],"hyperquicksort.":[43,62],"Its":[44],"description":[45],"implementation":[47],"are":[48,106],"very":[49],"straightforward.":[50],"Still":[51],"other":[52,142],"algorithms":[53],"were":[54],"devised,":[55],"either":[56],"concurrently":[57],"or":[59],"later":[60],"than":[61],"Substantial":[63],"amounts":[64],"empirical":[66,92],"analysis":[67,105],"have":[68],"been":[69],"carried":[70],"out":[71],"on":[72,141],"their":[73],"behavior.":[74],"summarize":[76],"these":[77],"results":[78],"show":[80],"how":[81],"hyperquicksort":[82,120],"outperformed":[84],"other,":[86],"often":[87],"more":[88],"sophisticated,":[89],"algorithms.":[90],"Extensive":[91],"results--obtained":[93],"from":[94],"custom":[96],"software":[97],"simulation":[98],"package--as":[99],"well":[100],"as":[101],"some":[102],"rigorous":[103],"theoretical":[104],"provided":[107],"to":[108,119,121,132,139],"back":[109],"our":[111],"claims.":[112],"In":[113],"addition,":[114],"we":[115,129],"present":[116],"possible":[117],"enhancements":[118],"improve":[122],"its":[123],"performance":[124],"special":[126],"situations.":[127],"Finally,":[128],"explain":[130],"modifications":[131],"basic":[134],"that":[136],"allow":[137],"it":[138],"run":[140],"parallel":[143],"machines,":[144],"not":[145],"just":[146],"hypercubes.":[147]},"counts_by_year":[],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}