{"id":"https://openalex.org/W2008218666","doi":"https://doi.org/10.1007/bf02577788","title":"Probabilistic performance analysis for parallel search techniques","display_name":"Probabilistic performance analysis for parallel search techniques","publication_year":1995,"publication_date":"1995-04-01","ids":{"openalex":"https://openalex.org/W2008218666","doi":"https://doi.org/10.1007/bf02577788","mag":"2008218666"},"language":"en","primary_location":{"id":"doi:10.1007/bf02577788","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02577788","pdf_url":null,"source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","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/A5101582615","display_name":"Wei-Ming Lin","orcid":"https://orcid.org/0000-0002-9350-6646"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wei-Ming Lin","raw_affiliation_strings":["Division of Engineering, University of Texas at San Antonio, 78249-0665, San Antonio, Texas","Division of Engineering, University of Texas at San Antonio, San Antonio"],"affiliations":[{"raw_affiliation_string":"Division of Engineering, University of Texas at San Antonio, 78249-0665, San Antonio, Texas","institution_ids":["https://openalex.org/I45438204"]},{"raw_affiliation_string":"Division of Engineering, University of Texas at San Antonio, San Antonio","institution_ids":["https://openalex.org/I45438204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085276522","display_name":"Bo Yang","orcid":"https://orcid.org/0000-0001-7439-192X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bo Yang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101582615"],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17305852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"2","first_page":"161","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9854999780654907,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8831286430358887},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7503278851509094},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6562248468399048},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6347891688346863},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.6107649803161621},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5879590511322021},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5366015434265137},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45591461658477783},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4488832354545593},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.42078182101249695},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4104839563369751},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40989628434181213},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.3759424686431885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3028826117515564},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15176281332969666},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12045124173164368},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08371317386627197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8831286430358887},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7503278851509094},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6562248468399048},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6347891688346863},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.6107649803161621},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5879590511322021},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5366015434265137},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45591461658477783},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4488832354545593},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.42078182101249695},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4104839563369751},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40989628434181213},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3759424686431885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3028826117515564},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15176281332969666},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12045124173164368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08371317386627197},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02577788","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02577788","pdf_url":null,"source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","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":18,"referenced_works":["https://openalex.org/W1493733731","https://openalex.org/W1508886014","https://openalex.org/W1521982276","https://openalex.org/W1550402024","https://openalex.org/W1979622972","https://openalex.org/W1980584633","https://openalex.org/W1988185570","https://openalex.org/W1988845780","https://openalex.org/W2003306963","https://openalex.org/W2017518635","https://openalex.org/W2068852367","https://openalex.org/W2095624907","https://openalex.org/W2099266627","https://openalex.org/W2143182795","https://openalex.org/W2276319489","https://openalex.org/W3156146620","https://openalex.org/W4230870880","https://openalex.org/W4248045051"],"related_works":["https://openalex.org/W1586380695","https://openalex.org/W1578329712","https://openalex.org/W1981558729","https://openalex.org/W2357113990","https://openalex.org/W2266782682","https://openalex.org/W2120490947","https://openalex.org/W206295951","https://openalex.org/W3082558912","https://openalex.org/W1551221054","https://openalex.org/W2618995073"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}