{"id":"https://openalex.org/W7166319371","doi":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","title":"Structural Adaptation of Sorting Algorithms Based on Constructive Fragments","display_name":"Structural Adaptation of Sorting Algorithms Based on Constructive Fragments","publication_year":2024,"publication_date":"2024-10-26","ids":{"openalex":"https://openalex.org/W7166319371","doi":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf"},"language":"en","primary_location":{"id":"doi:10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","doi":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","is_oa":true,"landing_page_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","pdf_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","source":{"id":"https://openalex.org/S7407115268","display_name":"International Scientific and Practical Programming Conference (UkrPROG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CEUR Workshop Proceedings, Vol-3806: Proceedings of the 14th International Scientific and Practical Programming Conference (UkrPROG 2024)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W7166319371"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049438204","display_name":"Viktor Shynkarenko","orcid":"https://orcid.org/0000-0001-8738-7225","observed_orcids":["https://orcid.org/0000-0001-8738-7225"]},"institutions":[{"id":"https://openalex.org/I4387154586","display_name":"Ukrainian State University of Science and Technologies","ror":"https://ror.org/052pe2w94","country_code":"UA","type":"education","lineage":["https://openalex.org/I4387154586"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Viktor Shynkarenko","raw_affiliation_strings":["Ukrainian State University of Science and Technologies , Lazaryana str. 2 , Dnipro , 49010 , Ukraine"],"raw_orcid":"https://orcid.org/0000-0001-8738-7225","affiliations":[{"raw_affiliation_string":"Ukrainian State University of Science and Technologies , Lazaryana str. 2 , Dnipro , 49010 , Ukraine","institution_ids":["https://openalex.org/I4387154586"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033203386","display_name":"O.V. Makarov","orcid":"https://orcid.org/0009-0003-0921-155X","observed_orcids":["https://orcid.org/0009-0003-0921-155X"]},"institutions":[{"id":"https://openalex.org/I4387154586","display_name":"Ukrainian State University of Science and Technologies","ror":"https://ror.org/052pe2w94","country_code":"UA","type":"education","lineage":["https://openalex.org/I4387154586"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Oleksii Makarov","raw_affiliation_strings":["Ukrainian State University of Science and Technologies , Lazaryana str. 2 , Dnipro , 49010 , Ukraine"],"raw_orcid":"https://orcid.org/0009-0003-0921-155X","affiliations":[{"raw_affiliation_string":"Ukrainian State University of Science and Technologies , Lazaryana str. 2 , Dnipro , 49010 , Ukraine","institution_ids":["https://openalex.org/I4387154586"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4387154586"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"16","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9740999937057495,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9740999937057495,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.006399999838322401,"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/T11269","display_name":"Algorithms and Data Compression","score":0.006099999882280827,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/sorting-algorithms","display_name":"sorting algorithms","score":0.9259999990463257},{"id":"https://openalex.org/keywords/algorithm-synthesis","display_name":"algorithm synthesis","score":0.6269999742507935},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.5839999914169312},{"id":"https://openalex.org/keywords/meta-algorithms","display_name":"meta-algorithms","score":0.8169999718666077},{"id":"https://openalex.org/keywords/depth-first-traversal","display_name":"depth-first traversal","score":0.6029999852180481},{"id":"https://openalex.org/keywords/fitness-function","display_name":"fitness function","score":0.828000009059906},{"id":"https://openalex.org/keywords/adaptive-algorithms","display_name":"adaptive algorithms","score":0.6600000262260437}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7457000017166138},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6754000186920166},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.67330002784729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5365999937057495},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5019999742507935},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.4401000142097473},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4189999997615814},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4049000144004822},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3716000020503998},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.36649999022483826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36149999499320984},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33980000019073486},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.3212999999523163},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.30799999833106995},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.2671000063419342},{"id":"https://openalex.org/C2554327","wikidata":"https://www.wikidata.org/wiki/Q2698599","display_name":"Coalescent theory","level":4,"score":0.25690001249313354},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","doi":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","is_oa":true,"landing_page_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","pdf_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","source":{"id":"https://openalex.org/S7407115268","display_name":"International Scientific and Practical Programming Conference (UkrPROG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CEUR Workshop Proceedings, Vol-3806: Proceedings of the 14th International Scientific and Practical Programming Conference (UkrPROG 2024)","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","doi":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","is_oa":true,"landing_page_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","pdf_url":"https://doi.org/10.55056/ceur-ws.org/vol-3806/s_47_shynkarenko_makarov.pdf","source":{"id":"https://openalex.org/S7407115268","display_name":"International Scientific and Practical Programming Conference (UkrPROG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CEUR Workshop Proceedings, Vol-3806: Proceedings of the 14th International Scientific and Practical Programming Conference (UkrPROG 2024)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166319371.pdf","grobid_xml":"https://content.openalex.org/works/W7166319371.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W2024425422","https://openalex.org/W2118382442","https://openalex.org/W2477534788","https://openalex.org/W2503958529","https://openalex.org/W3177099962","https://openalex.org/W3199801527"],"related_works":["https://openalex.org/W4407427578","https://openalex.org/W7160216341","https://openalex.org/W4416356941","https://openalex.org/W7164422090","https://openalex.org/W2062060002","https://openalex.org/W2954853010","https://openalex.org/W2381261464","https://openalex.org/W2468855777","https://openalex.org/W2169257920","https://openalex.org/W202035092"],"abstract_inverted_index":{"Modern":[0],"information":[1],"technologies":[2],"are":[3,58],"based":[4],"on":[5],"processing":[6],"large":[7],"volumes":[8],"of":[9,17,44,51,80,84,97,106,108,117,123,151,155,175,179,195,201,221,241,246,254,287,312,323],"data.":[10],"At":[11],"the":[12,15,37,69,72,77,104,113,118,121,138,144,149,152,163,172,180,196,217,252,285,288,292,307,313,321,324],"same":[13,227],"time,":[14],"task":[16],"developing":[18],"and":[19,55,177,193,276,291,303,315],"applying":[20],"effective":[21],"algorithms":[22,54,270,299],"for":[23,60,191,229],"data":[24,274,325],"processing,":[25],"in":[26,120,232,267,300],"particular":[27],"sorting,":[28],"remains":[29],"relevant.":[30],"Constructive-synthesizing":[31],"modeling":[32],"was":[33,65,281,318],"applied":[34,266],"to":[35,67,103,136,170,251,271,283,295,326],"form":[36,122,130,296],"sorting":[38,53,99,146,165,181,198,219,224,269,298],"algorithm":[39,43,64,70,88,132,182],"code.":[40],"The":[41,82,211,244,261],"meta-":[42],"program":[45],"code":[46],"generation":[47],"is":[48,127,134,159,168,189,214,259],"presented.":[49],"Parts":[50],"existing":[52,164],"auxiliary":[56],"utilities":[57],"used":[59,66],"generation.":[61],"A":[62],"genetic":[63,87],"select":[68],"with":[71],"maximum":[73],"time":[74,220],"efficiency":[75],"under":[76],"given":[78],"conditions":[79],"use.":[81],"use":[83,105,245],"a":[85,90,94,115,124,202,206],"standard":[86],"faces":[89],"problem":[91],"caused":[92],"by":[93,161],"different":[95,109,301],"number":[96,253],"elementary":[98],"operations,":[100],"which":[101,167],"leads":[102],"chromosomes":[107],"lengths.":[110],"To":[111,129],"solve":[112],"problem,":[114],"representation":[116,204],"chromosome":[119,184],"binary":[125],"tree":[126,208],"proposed.":[128],"an":[131],"that":[133],"guaranteed":[135,169],"sort":[137],"array,":[139],"all":[140,230],"leaf":[141],"nodes":[142],"include":[143],"final":[145],"gene":[147,158],"at":[148],"end":[150],"initial":[153],"sequence":[154],"genes.":[156],"This":[157],"decoded":[160],"calling":[162],"algorithm,":[166],"perform":[171],"sorting.":[173],"Mechanisms":[174],"coding":[176],"decoding":[178,192],"from":[183],"have":[185],"been":[186],"implemented.":[187],"Linearization":[188],"performed":[190,282,308],"formation":[194,200],"appropriate":[197],"algorithm:":[199],"textual":[203],"using":[205],"depth-first":[207],"traversal":[209],"algorithm.":[210],"fitness":[212,248],"function":[213],"defined":[215],"as":[216],"median":[218],"randomly":[222],"generated":[223],"arrays":[225,228],"(the":[226],"chromosomes)":[231],"some":[233],"stable":[234,272],"environment,":[235],"taking":[236],"into":[237],"account":[238],"certain":[239],"features":[240,322],"these":[242],"arrays.":[243],"other":[247],"functions":[249],"related":[250],"calculations,":[255],"comparisons":[256],"or":[257],"permutations":[258],"foreseen.":[260],"developed":[262,289],"software":[263,294,304,316],"should":[264],"be":[265,327],"adapting":[268],"input":[273],"streams":[275],"usage":[277],"environments.":[278,305],"An":[279],"experiment":[280],"verify":[284],"ability":[286],"method":[290],"corresponding":[293],"time-efficient":[297],"hardware":[302,314],"In":[306],"experiments,":[309],"one":[310],"component":[311],"environment":[317],"varied,":[319],"namely":[320],"sorted.":[328]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-06-28T00:00:00"}