{"id":"https://openalex.org/W2064537947","doi":"https://doi.org/10.1137/0221004","title":"The Average Complexity of Parallel Comparison Merging","display_name":"The Average Complexity of Parallel Comparison Merging","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2064537947","doi":"https://doi.org/10.1137/0221004","mag":"2064537947"},"language":"en","primary_location":{"id":"doi:10.1137/0221004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221004","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/A5031550661","display_name":"Mih\u00e1ly Ger\u00e9b-Graus","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mih\u00e1ly Ger\u00e9b-Graus","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058262792","display_name":"Danny Kriz\u0327anc","orcid":"https://orcid.org/0000-0002-0941-4010"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danny Krizanc","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031550661"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7963,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67380721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"1","first_page":"43","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11166","display_name":"Analytic Number Theory Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.6243552565574646},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6107255816459656},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5332263112068176},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5179644823074341},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5084947347640991},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43819957971572876},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43570783734321594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38497695326805115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3412790596485138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3177048861980438},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23795893788337708}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6243552565574646},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6107255816459656},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5332263112068176},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5179644823074341},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5084947347640991},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43819957971572876},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43570783734321594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38497695326805115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3412790596485138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3177048861980438},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23795893788337708},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0221004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221004","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1587590810","https://openalex.org/W1973732321","https://openalex.org/W2000872165","https://openalex.org/W2025558913","https://openalex.org/W2027679733","https://openalex.org/W2033191517","https://openalex.org/W2069489095","https://openalex.org/W2072783164","https://openalex.org/W2089062581","https://openalex.org/W2164530213","https://openalex.org/W2912298798"],"related_works":["https://openalex.org/W4360764540","https://openalex.org/W2115140794","https://openalex.org/W2041120224","https://openalex.org/W4231657010","https://openalex.org/W2395986200","https://openalex.org/W1504320321","https://openalex.org/W1994552539","https://openalex.org/W2007917622","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"An":[0],"optimal":[1],"lower":[2],"bound":[3],"on":[4,17],"the":[5],"average":[6],"time":[7],"required":[8],"by":[9],"any":[10],"algorithm":[11],"that":[12],"merges":[13],"two":[14],"sorted":[15],"lists":[16],"Valiant\u2019s":[18],"parallel":[19],"computation":[20],"tree":[21],"model":[22],"is":[23],"proven.MSC":[24],"codes68P1068Q10Keywordsmergingparallel":[25],"comparison":[26],"treeaverage":[27],"case":[28],"complexity":[29]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}