{"id":"https://openalex.org/W2025856884","doi":"https://doi.org/10.1145/1330598.1330615","title":"Efficiency of parallel minimax algorithm for game tree search","display_name":"Efficiency of parallel minimax algorithm for game tree search","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2025856884","doi":"https://doi.org/10.1145/1330598.1330615","mag":"2025856884"},"language":"en","primary_location":{"id":"doi:10.1145/1330598.1330615","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1330598.1330615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 international conference on Computer systems and technologies  - CompSysTech '07","raw_type":"proceedings-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/A5033889948","display_name":"Pl\u0430m\u0435nk\u0430 Borovsk\u0430","orcid":null},"institutions":[{"id":"https://openalex.org/I31151848","display_name":"Technical University of Sofia","ror":"https://ror.org/052prhs50","country_code":"BG","type":"education","lineage":["https://openalex.org/I31151848"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Plamenka Borovska","raw_affiliation_strings":["Technical University of Sofia"],"affiliations":[{"raw_affiliation_string":"Technical University of Sofia","institution_ids":["https://openalex.org/I31151848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041739830","display_name":"Milena Lazarova","orcid":"https://orcid.org/0000-0002-8256-0831"},"institutions":[{"id":"https://openalex.org/I31151848","display_name":"Technical University of Sofia","ror":"https://ror.org/052prhs50","country_code":"BG","type":"education","lineage":["https://openalex.org/I31151848"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Milena Lazarova","raw_affiliation_strings":["Technical University of Sofia"],"affiliations":[{"raw_affiliation_string":"Technical University of Sofia","institution_ids":["https://openalex.org/I31151848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033889948"],"corresponding_institution_ids":["https://openalex.org/I31151848"],"apc_list":null,"apc_paid":null,"fwci":0.9659,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.81761059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9998000264167786,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9998000264167786,"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/T11197","display_name":"Digital Games and Media","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9660999774932861,"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/computer-science","display_name":"Computer science","score":0.7903860807418823},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.745414137840271},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7303482890129089},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6741332411766052},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6544206142425537},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5841346979141235},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5746045708656311},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5558021068572998},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5116655826568604},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.4869047701358795},{"id":"https://openalex.org/keywords/cost-efficiency","display_name":"Cost efficiency","score":0.4517854154109955},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.43366968631744385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4185165762901306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38570746779441833},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3253780007362366},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.2508692741394043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1705639660358429},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.15154320001602173}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7903860807418823},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.745414137840271},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7303482890129089},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6741332411766052},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6544206142425537},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5841346979141235},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5746045708656311},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5558021068572998},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5116655826568604},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.4869047701358795},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.4517854154109955},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.43366968631744385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4185165762901306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38570746779441833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3253780007362366},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.2508692741394043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1705639660358429},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.15154320001602173},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1330598.1330615","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1330598.1330615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 international conference on Computer systems and technologies  - CompSysTech '07","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.7898","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.7898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ecet.ecs.ru.acad.bg/cst07/Docs/cp/SII/II.7.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W140264448","https://openalex.org/W323844978","https://openalex.org/W1574653435","https://openalex.org/W1964182510","https://openalex.org/W1990000511","https://openalex.org/W2099765347"],"related_works":["https://openalex.org/W2001681191","https://openalex.org/W4323046389","https://openalex.org/W1613276115","https://openalex.org/W132537045","https://openalex.org/W2504380483","https://openalex.org/W2887785599","https://openalex.org/W2742300930","https://openalex.org/W2607998022","https://openalex.org/W2059382600","https://openalex.org/W79086587"],"abstract_inverted_index":{"The":[0,15,25,104],"paper":[1],"investigates":[2],"the":[3,39,48,80,83,89,92,99,109,116],"efficiency":[4,72],"of":[5,38,47,82,91,101,108,115],"parallel":[6,27,49,67,93,110],"minimax":[7,117],"algorithms":[8],"for":[9,35,61],"search":[10],"in":[11,77],"a":[12,19,23],"game":[13,16,40],"tree.":[14],"used":[17],"as":[18,73,75],"case":[20],"study":[21],"is":[22,43],"tic-tac-toe.":[24],"suggested":[26],"computational":[28],"model":[29],"exploits":[30],"tree":[31,41],"partitioning":[32],"at":[33],"width":[34],"each":[36],"level":[37],"and":[42,53,65,71,85,112],"based":[44],"on":[45,88,98],"combination":[46],"algorithmic":[50],"paradigms":[51],"\"manager-workers\"":[52],"\"asynchronous":[54],"iterations\".":[55],"Performance":[56],"comparison":[57],"has":[58,119],"been":[59,96,120],"made":[60],"hybrid":[62,111],"(multilevel,)":[63],"flat":[64,113],"multithreaded":[66],"programming":[68],"models.":[69],"Speedup":[70],"well":[74],"scalability":[76],"respect":[78],"to":[79],"size":[81],"multicomputer":[84],"its":[86],"impact":[87],"performance":[90],"system":[94],"have":[95],"estimated":[97],"basis":[100],"experimental":[102],"results.":[103],"communication/computation":[105],"ratio":[106],"(CCR)":[107],"implementations":[114],"algorithm":[118],"estimated.":[121]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}