{"id":"https://openalex.org/W2053583257","doi":"https://doi.org/10.1109/ewdts.2014.7027091","title":"Decomposition tree - based compaction procedure with iteration steps for interconversional layouts of tasks","display_name":"Decomposition tree - based compaction procedure with iteration steps for interconversional layouts of tasks","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2053583257","doi":"https://doi.org/10.1109/ewdts.2014.7027091","mag":"2053583257"},"language":"en","primary_location":{"id":"doi:10.1109/ewdts.2014.7027091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ewdts.2014.7027091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of IEEE East-West Design &amp; Test Symposium (EWDTS 2014)","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/A5065881096","display_name":"V. Andreeva","orcid":"https://orcid.org/0000-0003-1691-3448"},"institutions":[{"id":"https://openalex.org/I196355604","display_name":"National Research Tomsk State University","ror":"https://ror.org/02he2nc27","country_code":"RU","type":"education","lineage":["https://openalex.org/I196355604"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Valentina Andreeva","raw_affiliation_strings":["Department of Applied Mathematics and Cybernetics, Tomsk State University, Tomsk, Russia","Department of Applied Mathematics and Cybernetics, Tomsk state university, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Cybernetics, Tomsk State University, Tomsk, Russia","institution_ids":["https://openalex.org/I196355604"]},{"raw_affiliation_string":"Department of Applied Mathematics and Cybernetics, Tomsk state university, Russia","institution_ids":["https://openalex.org/I196355604"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032299562","display_name":"Kirill A. Sorudeykin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166207","display_name":"Research & Development Corporation","ror":"https://ror.org/05rjdm522","country_code":"CA","type":"facility","lineage":["https://openalex.org/I4210166207"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kirill A. Sorudeykin","raw_affiliation_strings":["Relevance Research & Development Corporation, Kharkov National University of Radio Electronics","Kharkov National University of Radio Electronics, Relevance Research & Development Corporation, Ukraina"],"affiliations":[{"raw_affiliation_string":"Relevance Research & Development Corporation, Kharkov National University of Radio Electronics","institution_ids":["https://openalex.org/I4210166207"]},{"raw_affiliation_string":"Kharkov National University of Radio Electronics, Relevance Research & Development Corporation, Ukraina","institution_ids":["https://openalex.org/I4210166207"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065881096"],"corresponding_institution_ids":["https://openalex.org/I196355604"],"apc_list":null,"apc_paid":null,"fwci":0.9194,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75359234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9865000247955322,"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/decomposition","display_name":"Decomposition","score":0.857517421245575},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.73501056432724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6284940242767334},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5910148024559021},{"id":"https://openalex.org/keywords/compaction","display_name":"Compaction","score":0.5895968079566956},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5455058217048645},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5117077827453613},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4773671329021454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42393168807029724},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3706962466239929},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35281410813331604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.324160635471344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12982627749443054},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09471535682678223},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09108874201774597},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08375459909439087},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07644885778427124},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.060520052909851074}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.857517421245575},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.73501056432724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6284940242767334},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5910148024559021},{"id":"https://openalex.org/C196715460","wikidata":"https://www.wikidata.org/wiki/Q1414356","display_name":"Compaction","level":2,"score":0.5895968079566956},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5455058217048645},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5117077827453613},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4773671329021454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42393168807029724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3706962466239929},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35281410813331604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.324160635471344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12982627749443054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09471535682678223},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09108874201774597},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08375459909439087},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07644885778427124},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.060520052909851074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C187320778","wikidata":"https://www.wikidata.org/wiki/Q1349130","display_name":"Geotechnical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ewdts.2014.7027091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ewdts.2014.7027091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of IEEE East-West Design &amp; Test Symposium (EWDTS 2014)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1991599544","https://openalex.org/W2079750733","https://openalex.org/W2169430754","https://openalex.org/W3098401940"],"related_works":["https://openalex.org/W2071459461","https://openalex.org/W2093885745","https://openalex.org/W2351266481","https://openalex.org/W2132547887","https://openalex.org/W2516987005","https://openalex.org/W2907786475","https://openalex.org/W2963447120","https://openalex.org/W4289082820","https://openalex.org/W2092152400","https://openalex.org/W2963196945"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"a":[5,24],"further":[6],"development":[7,20],"of":[8,11,18,47,53],"compaction":[9],"procedure":[10],"based":[12],"on":[13],"decomposition":[14,25,54],"tree.":[15],"The":[16],"goal":[17],"the":[19,32,51],"is":[21,41],"to":[22,30,44],"simplify":[23],"tree,":[26],"in":[27,50],"other":[28],"words":[29],"reduce":[31],"number":[33],"Local":[34],"Don't":[35],"Care":[36],"sets":[37],"(LDCs).":[38],"A":[39],"simplification":[40],"achieved":[42],"due":[43],"an":[45],"introduction":[46],"iteration":[48],"step":[49],"process":[52],"tree":[55],"creation.":[56]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
