{"id":"https://openalex.org/W2021655253","doi":"https://doi.org/10.2478/v10065-010-0049-1","title":"Parallelizing a new algorithm for the set partition problem","display_name":"Parallelizing a new algorithm for the set partition problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2021655253","doi":"https://doi.org/10.2478/v10065-010-0049-1","mag":"2021655253"},"language":"en","primary_location":{"id":"doi:10.2478/v10065-010-0049-1","is_oa":false,"landing_page_url":"https://doi.org/10.2478/v10065-010-0049-1","pdf_url":null,"source":{"id":"https://openalex.org/S4210184648","display_name":"Annales Universitatis Mariae Curie-Sklodowska sectio AI \u2013 Informatica","issn_l":"1732-1360","issn":["1732-1360","2083-3628"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales UMCS, Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://journals.umcs.pl/ai/article/view/3281","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075563612","display_name":"Ho\u00e0ng Ng\u1ecdc Thanh","orcid":"https://orcid.org/0000-0003-0279-9015"},"institutions":[{"id":"https://openalex.org/I67868205","display_name":"VNU University of Science","ror":"https://ror.org/05w54hk79","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841","https://openalex.org/I67868205"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Hoang Thanh","raw_affiliation_strings":["Department of Informatics, Hanoi University of Science, VNUH, 334-Nguyen Trai Rd., Thanh Xuan, Hanoi, Vietnam#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, Hanoi University of Science, VNUH, 334-Nguyen Trai Rd., Thanh Xuan, Hanoi, Vietnam#TAB#","institution_ids":["https://openalex.org/I67868205"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075563612"],"corresponding_institution_ids":["https://openalex.org/I67868205"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12681913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"10","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11428","display_name":"Advanced Mathematical Identities","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11428","display_name":"Advanced Mathematical Identities","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9406999945640564,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11166","display_name":"Analytic Number Theory Research","score":0.9158999919891357,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7827771902084351},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7651638388633728},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5405896902084351},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4946405589580536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49214810132980347},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3899543881416321},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.343961238861084},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20357516407966614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10856014490127563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08273780345916748}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7827771902084351},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7651638388633728},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5405896902084351},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4946405589580536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49214810132980347},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3899543881416321},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.343961238861084},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20357516407966614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10856014490127563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08273780345916748}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2478/v10065-010-0049-1","is_oa":false,"landing_page_url":"https://doi.org/10.2478/v10065-010-0049-1","pdf_url":null,"source":{"id":"https://openalex.org/S4210184648","display_name":"Annales Universitatis Mariae Curie-Sklodowska sectio AI \u2013 Informatica","issn_l":"1732-1360","issn":["1732-1360","2083-3628"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales UMCS, Informatica","raw_type":"journal-article"},{"id":"pmh:oai:ojs.umcsd.home.net.pl:article/3281","is_oa":true,"landing_page_url":"http://journals.umcs.pl/ai/article/view/3281","pdf_url":null,"source":{"id":"https://openalex.org/S4306402290","display_name":"Studia Iuridica Lublinensia (Uniwersytet Marii Curie-Sk\u0142odowskiej w Lublinie)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174183983","host_organization_name":"Maria Curie-Sk\u0142odowska University","host_organization_lineage":["https://openalex.org/I174183983"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annales Universitatis Mariae Curie-Sklodowska, sectio AI \u00e2\u0080\u0093 Informatica; Vol 10, No 2 (2010); 21-28","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ojs.umcsd.home.net.pl:article/3281","is_oa":true,"landing_page_url":"http://journals.umcs.pl/ai/article/view/3281","pdf_url":null,"source":{"id":"https://openalex.org/S4306402290","display_name":"Studia Iuridica Lublinensia (Uniwersytet Marii Curie-Sk\u0142odowskiej w Lublinie)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174183983","host_organization_name":"Maria Curie-Sk\u0142odowska University","host_organization_lineage":["https://openalex.org/I174183983"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annales Universitatis Mariae Curie-Sklodowska, sectio AI \u00e2\u0080\u0093 Informatica; Vol 10, No 2 (2010); 21-28","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.5099999904632568}],"awards":[],"funders":[{"id":"https://openalex.org/F4320337962","display_name":"Trung t\u00e2m H\u1ed7 tr\u1ee3 Nghi\u00ean c\u1ee9u Ch\u00e2u \u00c1, \u0110\u1ea1i h\u1ecdc Qu\u1ed1c gia H\u00e0 N\u1ed9i","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1651447848","https://openalex.org/W2140104995","https://openalex.org/W2153068117","https://openalex.org/W2169464770","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W6682665732"],"related_works":["https://openalex.org/W2025912669","https://openalex.org/W2057299700","https://openalex.org/W1549987457","https://openalex.org/W2014615094","https://openalex.org/W1977789739","https://openalex.org/W2351778335","https://openalex.org/W4240458717","https://openalex.org/W2497180562","https://openalex.org/W2379495598","https://openalex.org/W2047470742"],"abstract_inverted_index":{"We\u2019ve":[0,29],"built":[1],"this":[2],"digital":[3,15],"research":[4],"platform":[5,32],"to":[6,17],"provide":[7],"academics":[8],"everywhere":[9],"with":[10,36],"fast,":[11],"stable":[12],"and":[13,25,62],"secure":[14],"access":[16],"our":[18,57],"library":[19],"of":[20],"over":[21],"110,000":[22],"scholarly":[23],"books":[24],"800,000":[26],"journal":[27],"articles.":[28],"tested":[30],"the":[31],"in":[33],"close":[34],"cooperation":[35],"leading":[37],"academic":[38],"institutions.":[39],"If":[40],"you":[41,46],"have":[42],"any":[43],"questions":[44],"or":[45],"notice":[47],"something":[48],"doesn\u2019t":[49],"quite":[50],"work":[51],"as":[52],"it":[53],"should,":[54],"please":[55],"visit":[56],"<a":[58],"href=\"/publishing/faq?lang=en\"":[59],"class=\"text-primary\">Help/FAQ</a>":[60],"page":[61],"let":[63],"us":[64],"know.":[65]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}