{"id":"https://openalex.org/W2074140156","doi":"https://doi.org/10.1142/s0218126614500157","title":"A PARALLEL ALGORITHM FOR MINIMIZING ESOP EXPRESSIONS","display_name":"A PARALLEL ALGORITHM FOR MINIMIZING ESOP EXPRESSIONS","publication_year":2013,"publication_date":"2013-12-16","ids":{"openalex":"https://openalex.org/W2074140156","doi":"https://doi.org/10.1142/s0218126614500157","mag":"2074140156"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126614500157","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126614500157","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","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/A5091386217","display_name":"G. Papakonstantinou","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"GEORGE PAPAKONSTANTINOU","raw_affiliation_strings":["School of Electrical and Computer Engineering, National Technical University of Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091386217"],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":null,"apc_paid":null,"fwci":0.2349,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.616723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":"01","first_page":"1450015","last_page":"1450015"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9638000130653381,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11797","display_name":"graph theory and CDMA systems","score":0.9638000130653381,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10142","display_name":"Formal Methods in Verification","score":0.9190999865531921,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9067000150680542,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/minification","display_name":"Minification","score":0.582621157169342},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5564673542976379},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5537567734718323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5367160439491272},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5181897282600403},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.5167221426963806},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4858939051628113},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4827108085155487},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.42697829008102417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36992347240448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3401261568069458},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20007646083831787}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.582621157169342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5564673542976379},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5537567734718323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5367160439491272},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5181897282600403},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.5167221426963806},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4858939051628113},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4827108085155487},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.42697829008102417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36992347240448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3401261568069458},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20007646083831787},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126614500157","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126614500157","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","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":13,"referenced_works":["https://openalex.org/W585070693","https://openalex.org/W1481714151","https://openalex.org/W1538138125","https://openalex.org/W1985624015","https://openalex.org/W1996351852","https://openalex.org/W2021321939","https://openalex.org/W2039098229","https://openalex.org/W2051044287","https://openalex.org/W2054925107","https://openalex.org/W2058451772","https://openalex.org/W2098878195","https://openalex.org/W2124869406","https://openalex.org/W2143806343"],"related_works":["https://openalex.org/W2075715347","https://openalex.org/W2952066610","https://openalex.org/W1802780793","https://openalex.org/W2006644440","https://openalex.org/W2140898227","https://openalex.org/W2102128707","https://openalex.org/W1979643447","https://openalex.org/W11362091","https://openalex.org/W2354717923","https://openalex.org/W2074140156"],"abstract_inverted_index":{"Two":[0],"parallel":[1],"algorithms":[2],"are":[3],"proposed":[4,38,62],"in":[5],"this":[6],"paper":[7],"for":[8,21,40,48,80],"solving":[9],"the":[10,57],"problem":[11,28],"of":[12,17,52,56,59,73,83],"finding":[13],"exact":[14],"exclusive-or":[15],"sum":[16],"products":[18],"(ESOP)":[19],"expressions":[20],"an":[22],"arbitrary":[23],"Boolean":[24],"function.":[25],"This":[26],"minimization":[27],"is":[29,55,64],"a":[30,65,71,81],"very":[31],"difficult":[32],"one":[33,67],"and":[34,70],"solutions":[35],"have":[36],"been":[37],"only":[39],"up":[41],"to":[42],"seven":[43,53],"variables.":[44],"The":[45,61],"processing":[46],"time":[47],"some":[49],"symmetric":[50],"functions":[51],"variables":[54],"order":[58],"weeks.":[60],"algorithm":[63],"hybrid":[66],"(OpenMP,":[68],"MPI)":[69],"speed-up":[72],"more":[74],"than":[75],"nine":[76],"could":[77],"be":[78],"achieved,":[79],"cluster":[82],"three":[84],"nodes":[85],"with":[86],"four":[87],"cores":[88],"each.":[89]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}