{"id":"https://openalex.org/W2038993989","doi":"https://doi.org/10.1007/bf01379315","title":"A join algorithm for combining AND parallel solutions in AND/OR parallel systems","display_name":"A join algorithm for combining AND parallel solutions in AND/OR parallel systems","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2038993989","doi":"https://doi.org/10.1007/bf01379315","mag":"2038993989"},"language":"en","primary_location":{"id":"doi:10.1007/bf01379315","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01379315","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/A5103373696","display_name":"Balkrishna Ramkumar","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balkrishna Ramkumar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Iowa, 52242, Iowa City, Iowa","Department of Electrical and Computer Engineering, University of Iowa, Iowa City"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Iowa, 52242, Iowa City, Iowa","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Iowa, Iowa City","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111749496","display_name":"Laxmikant V. Kal\ufffd","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laxmikant V. Kal\ufffd","raw_affiliation_strings":["Dept. of Computer Science, University of Illinois, Urbana#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Illinois, Urbana#TAB#","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1164,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81527832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"1","first_page":"67","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9918000102043152,"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/computer-science","display_name":"Computer science","score":0.8851093053817749},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6571283340454102},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6306567192077637},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6202065944671631},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6119716167449951},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.5543585419654846},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5237572193145752},{"id":"https://openalex.org/keywords/implicit-parallelism","display_name":"Implicit parallelism","score":0.47788846492767334},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.459827184677124},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4238699674606323},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4147263765335083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41170576214790344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30502796173095703},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2976214587688446}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8851093053817749},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6571283340454102},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6306567192077637},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6202065944671631},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6119716167449951},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.5543585419654846},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5237572193145752},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.47788846492767334},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.459827184677124},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4238699674606323},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4147263765335083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41170576214790344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30502796173095703},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2976214587688446},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01379315","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01379315","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":[{"id":"https://metadata.un.org/sdg/16","score":0.550000011920929,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309532","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02"},{"id":"https://openalex.org/F4320338284","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W9866328","https://openalex.org/W111909449","https://openalex.org/W126163047","https://openalex.org/W136416057","https://openalex.org/W136576737","https://openalex.org/W196564791","https://openalex.org/W316597490","https://openalex.org/W1502605899","https://openalex.org/W1525488258","https://openalex.org/W1551554715","https://openalex.org/W1766658279","https://openalex.org/W1974531365","https://openalex.org/W1975943297","https://openalex.org/W2017072711","https://openalex.org/W2018195830","https://openalex.org/W2047008023","https://openalex.org/W2049616070","https://openalex.org/W2106730449","https://openalex.org/W2145812623","https://openalex.org/W2148389812","https://openalex.org/W2752885492","https://openalex.org/W2913475966","https://openalex.org/W4247516469","https://openalex.org/W6718118034"],"related_works":["https://openalex.org/W2003935582","https://openalex.org/W4240606930","https://openalex.org/W2526302199","https://openalex.org/W74409296","https://openalex.org/W2494130044","https://openalex.org/W1972271823","https://openalex.org/W2950520577","https://openalex.org/W1483753031","https://openalex.org/W3189160234","https://openalex.org/W2085021212"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}