{"id":"https://openalex.org/W2013188079","doi":"https://doi.org/10.1137/0206001","title":"Optimal Polyphase Sorting","display_name":"Optimal Polyphase Sorting","publication_year":1977,"publication_date":"1977-03-01","ids":{"openalex":"https://openalex.org/W2013188079","doi":"https://doi.org/10.1137/0206001","mag":"2013188079"},"language":"en","primary_location":{"id":"doi:10.1137/0206001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206001","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5019903364","display_name":"Derek A. Zave","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Derek A. Zave","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019903364"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8185,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.94709432,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"1","first_page":"1","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996999979019165,"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.996999979019165,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9916999936103821,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9502000212669373,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polyphase-system","display_name":"Polyphase system","score":0.9099144339561462},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.8398059606552124},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.8176758289337158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6250423192977905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5444238781929016},{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.5077794194221497},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.48150429129600525},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.407576322555542},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.38527098298072815},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36743298172950745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3628607392311096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3210582435131073},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13470733165740967}],"concepts":[{"id":"https://openalex.org/C96157337","wikidata":"https://www.wikidata.org/wiki/Q391639","display_name":"Polyphase system","level":2,"score":0.9099144339561462},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.8398059606552124},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.8176758289337158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6250423192977905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5444238781929016},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.5077794194221497},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.48150429129600525},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.407576322555542},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.38527098298072815},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36743298172950745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3628607392311096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3210582435131073},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13470733165740967},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206001","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1600795850","https://openalex.org/W1993449345","https://openalex.org/W2017874412","https://openalex.org/W2129889116","https://openalex.org/W2913552036","https://openalex.org/W2989713547","https://openalex.org/W3198160809","https://openalex.org/W4239614637","https://openalex.org/W4403225013"],"related_works":["https://openalex.org/W2925598649","https://openalex.org/W2020874007","https://openalex.org/W4320925713","https://openalex.org/W2190513794","https://openalex.org/W2540352350","https://openalex.org/W2140238930","https://openalex.org/W2552439138","https://openalex.org/W2765396134","https://openalex.org/W2011379812","https://openalex.org/W3002580575"],"abstract_inverted_index":{"A":[0],"read-forward":[1],"polyphase":[2,10],"merge":[3,11,42],"algorithm":[4,19,52,67,72],"is":[5,29,33,68,78],"described":[6],"which":[7,39],"performs":[8],"the":[9,21,41,55],"starting":[12],"from":[13],"an":[14],"arbitrary":[15],"string":[16],"distribution.":[17],"This":[18],"minimizes":[20],"volume":[22,28],"of":[23,57],"information":[24],"moved.":[25],"Since":[26],"this":[27,66],"easily":[30],"computed,":[31],"it":[32],"possible":[34],"to":[35,59,93],"construct":[36],"dispersion":[37,46],"algorithms":[38,90],"anticipate":[40],"algorithm.":[43],"Two":[44],"such":[45,75],"techniques":[47],"are":[48,86,91],"described.":[49],"The":[50,70],"first":[51],"requires":[53],"that":[54],"number":[56],"strings":[58],"be":[60,62,94],"dispersed":[61],"known":[63],"in":[64],"advance;":[65],"optimal.":[69,81,96],"second":[71],"makes":[73],"no":[74],"requirement,":[76],"but":[77],"not":[79],"always":[80],"In":[82],"addition,":[83],"performance":[84],"estimates":[85],"derived":[87],"and":[88],"both":[89],"shown":[92],"asymptotically":[95]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}