{"id":"https://openalex.org/W1555422605","doi":null,"title":"Parallel Algorithms for Combinatorial Search Problems","display_name":"Parallel Algorithms for Combinatorial Search Problems","alternate_titles":[],"publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1555422605","mag":"1555422605"},"language":"en","primary_location":{"id":"pmh:oai:berkeley.edu:13030-hb287006p9","doi":null,"is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/CSD-89-543.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I95457486","host_organization_name":"University of California, Berkeley","host_organization_lineage":["https://openalex.org/I95457486"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"},"parent_works":[],"lineage":["https://openalex.org/W1555422605"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yanjun Zhang","orcid":"https://orcid.org/0000-0001-5611-3483","observed_orcids":["https://orcid.org/0000-0001-5611-3483"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yanjun Zhang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5611-3483","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068875104","display_name":"Richard M. Karp","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7192000150680542,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7192000150680542,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.13109999895095825,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.03909999877214432,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"combinatorial search","score":0.9520000219345093},{"id":"https://openalex.org/keywords/backtrack-search","display_name":"backtrack search","score":0.9020000100135803},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9380000233650208},{"id":"https://openalex.org/keywords/game-tree-search","display_name":"game tree search","score":0.8989999890327454},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.7509999871253967},{"id":"https://openalex.org/keywords/enumeration-problems","display_name":"counting problems","score":0.656000018119812},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.968999981880188},{"id":"https://openalex.org/keywords/and-or-trees","display_name":"AND/OR trees","score":0.8799999952316284},{"id":"https://openalex.org/keywords/alpha-beta-pruning","display_name":"alpha-beta pruning","score":0.949999988079071},{"id":"https://openalex.org/keywords/message-passing-networks","display_name":"message passing networks","score":0.5580000281333923}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6679995059967041},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6618349552154541},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5802024602890015},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5750171542167664},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.5602295994758606},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.553913950920105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5152873992919922},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.48335760831832886},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4533960819244385},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.45163142681121826},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.44238948822021484},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.43709596991539},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42871588468551636},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41390764713287354},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.39459094405174255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2982274293899536},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2398289144039154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09106254577636719},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:berkeley.edu:13030-hb287006p9","doi":null,"is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/CSD-89-543.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I95457486","host_organization_name":"University of California, Berkeley","host_organization_lineage":["https://openalex.org/I95457486"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"},{"id":"mag:1555422605","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=916986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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/W2019170199","https://openalex.org/W7096640457","https://openalex.org/W2012223233","https://openalex.org/W1502325501","https://openalex.org/W2064058359","https://openalex.org/W34076215","https://openalex.org/W3033762112","https://openalex.org/W2002198567","https://openalex.org/W2097144096","https://openalex.org/W2041232030"],"abstract_inverted_index":{"This":[0],"thesis":[1,15,178],"is":[2,33,48,57,111,158,238],"a":[3,34,45,64,83,88,115,133,162,170,192,221],"theoretical":[4],"study":[5,75,122,180],"of":[6,30,36,70,155,176,183,185,194,235,243,257],"parallel":[7,18,31,46,60,195],"algorithms":[8,19,61,97,196],"for":[9,20,92,98,126,140,202,211,254],"combinatorial":[10,84,128],"search":[11,77,96],"problems.":[12,101,130],"In":[13,173],"this":[14,109,156,177],"we":[16,179],"present":[17,132,191],"backtrack":[21,76,95],"search,":[22],"branch-and-bound":[23,124,143],"computation":[24,32],"and":[25,206],"game-tree":[26],"search.":[27],"Our":[28,41,55],"model":[29],"network":[35],"processors":[37,71,236],"communicating":[38],"via":[39],"messages.":[40],"primary":[42],"interest":[43],"in":[44,188],"algorithm":[47,201,210,219,227,259,264],"its":[49],"speed-up":[50,65,223,256],"over":[51,224,260],"the":[52,68,123,152,174,181,199,207,218,225,233,241,244,250,255,258,261],"sequential":[53,94,142],"ones.":[54],"goal":[56],"to":[58,67,82,113,160,240],"design":[59],"that":[62,78,197,217,249],"achieve":[63,114],"proportional":[66],"number":[69,234],"used.":[72],"We":[73,86,102,120,131,145,190,215,247],"first":[74],"enumerates":[79],"all":[80,107,150],"solutions":[81],"problem.":[85],"propose":[87],"simple":[89],"randomized":[90,134],"method":[91,110,125,135,157],"parallelizing":[93,141],"solving":[99,127],"enumeration":[100],"show":[103,146],"that,":[104,147],"uniformly":[105,148],"on":[106,149,228],"instances,":[108,151],"likely":[112],"nearly":[116],"best":[117],"possible":[118],"speed-up.":[119],"then":[121],"optimization":[129],"called":[136],"Local":[137],"Best-First":[138],"Search":[139],"algorithms.":[144],"execution":[153],"time":[154],"unlikely":[159],"exceed":[161],"certain":[163],"inherent":[164],"lower":[165],"bound":[166],"by":[167],"more":[168],"than":[169],"constant":[171],"factor.":[172],"rest":[175],"problem":[182],"evaluation":[184],"game":[186],"trees":[187,205,231],"parallel.":[189],"class":[193],"parallelize":[198],"\"left-to-right\"":[200],"evaluating":[203,212],"AND/OR":[204,230],"Alpha-Beta":[208,262],"pruning":[209,263],"MIN/MAX":[213],"trees.":[214],"prove":[216],"achieves":[220],"linear":[222],"left-to-right":[226],"uniform":[229],"when":[232],"used":[237],"close":[239],"height":[242],"input":[245],"tree.":[246],"conjecture":[248],"same":[251],"conclusion":[252],"holds":[253]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1555422605","counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
