{"id":"https://openalex.org/W2089062581","doi":"https://doi.org/10.1137/0204030","title":"Parallelism in Comparison Problems","display_name":"Parallelism in Comparison Problems","publication_year":1975,"publication_date":"1975-09-01","ids":{"openalex":"https://openalex.org/W2089062581","doi":"https://doi.org/10.1137/0204030","mag":"2089062581"},"language":"en","primary_location":{"id":"doi:10.1137/0204030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204030","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/A5015531084","display_name":"Leslie G. Valiant","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Leslie G. Valiant","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015531084"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3061,"has_fulltext":false,"cited_by_count":401,"citation_normalized_percentile":{"value":0.96472894,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"3","first_page":"348","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14470","display_name":"Advanced Data Processing Techniques","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14470","display_name":"Advanced Data Processing Techniques","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9193000197410583,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9151999950408936,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/sorting","display_name":"Sorting","score":0.7121959924697876},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6806678175926208},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6740196943283081},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6016536355018616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5982629060745239},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.507375180721283},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.465279757976532},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45601797103881836},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4492185115814209},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4408014118671417},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4222205579280853},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39409005641937256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38580214977264404},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3570014238357544},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.17409563064575195}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7121959924697876},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6806678175926208},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6740196943283081},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6016536355018616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5982629060745239},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.507375180721283},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.465279757976532},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45601797103881836},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4492185115814209},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4408014118671417},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4222205579280853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39409005641937256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38580214977264404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3570014238357544},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.17409563064575195},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0204030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204030","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":4,"referenced_works":["https://openalex.org/W947400629","https://openalex.org/W1996641400","https://openalex.org/W2577446513","https://openalex.org/W4403297121"],"related_works":["https://openalex.org/W2268046897","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W2055625272","https://openalex.org/W2036758175"],"abstract_inverted_index":{"The":[0,69],"worst-case":[1],"time":[2],"complexity":[3],"of":[4,25,34,41,52,55,83],"algorithms":[5],"for":[6,22,71,80],"multiprocessor":[7],"computers":[8],"with":[9,64],"binary":[10],"comparisons":[11],"as":[12],"the":[13,23,27,39,42,50,73],"basic":[14],"operations":[15],"is":[16,19,45,75],"investigated.":[17],"It":[18],"shown":[20,76],"that":[21],"problems":[24],"finding":[26,72],"maximum,":[28],"sorting,":[29],"and":[30,85],"merging":[31],"a":[32],"pair":[33],"sorted":[35],"lists,":[36],"if":[37],"n,":[38],"size":[40],"input":[43],"set,":[44],"not":[46],"less":[47],"than":[48],"k,":[49],"number":[51],"processors,":[53],"speedups":[54],"at":[56],"least":[57],"$O(k/\\log":[58],"\\log":[59],"k)$":[60],"can":[61],"be":[62,78],"achieved":[63],"respect":[65],"to":[66,77],"comparison":[67],"operations.":[68],"algorithm":[70],"maximum":[74],"optimal":[79],"all":[81],"values":[82],"k":[84],"n.":[86]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}