{"id":"https://openalex.org/W3176789478","doi":"https://doi.org/10.1109/saci51354.2021.9465619","title":"Synthesis of Merging algorithms on binary trees using multisets in Theorema","display_name":"Synthesis of Merging algorithms on binary trees using multisets in Theorema","publication_year":2021,"publication_date":"2021-05-19","ids":{"openalex":"https://openalex.org/W3176789478","doi":"https://doi.org/10.1109/saci51354.2021.9465619","mag":"3176789478"},"language":"en","primary_location":{"id":"doi:10.1109/saci51354.2021.9465619","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci51354.2021.9465619","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)","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/A5001991801","display_name":"Isabela Dr\u0103mnesc","orcid":"https://orcid.org/0000-0003-4686-2864"},"institutions":[{"id":"https://openalex.org/I3121153395","display_name":"West University of Timi\u015foara","ror":"https://ror.org/0583a0t97","country_code":"RO","type":"education","lineage":["https://openalex.org/I3121153395"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Isabela Dramnesc","raw_affiliation_strings":["West University, Timi\u01f5oara, Romania"],"affiliations":[{"raw_affiliation_string":"West University, Timi\u01f5oara, Romania","institution_ids":["https://openalex.org/I3121153395"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021113261","display_name":"Tudor Jebelean","orcid":"https://orcid.org/0000-0002-2247-2151"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Tudor Jebelean","raw_affiliation_strings":["Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001991801"],"corresponding_institution_ids":["https://openalex.org/I3121153395"],"apc_list":null,"apc_paid":null,"fwci":0.148,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50133943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"1","issue":null,"first_page":"000497","last_page":"000502"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"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.9796000123023987,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.7501987218856812},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6425032019615173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6348280906677246},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5758640766143799},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5638794302940369},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5585943460464478},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5567401647567749},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4952673017978668},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47754988074302673},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4611753225326538},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.41113144159317017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36807912588119507},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3206750154495239},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26345446705818176}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7501987218856812},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6425032019615173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6348280906677246},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5758640766143799},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5638794302940369},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5585943460464478},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5567401647567749},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4952673017978668},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47754988074302673},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4611753225326538},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.41113144159317017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36807912588119507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3206750154495239},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26345446705818176},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/saci51354.2021.9465619","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci51354.2021.9465619","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W64540772","https://openalex.org/W1848963184","https://openalex.org/W1981663184","https://openalex.org/W2012436850","https://openalex.org/W2089340995","https://openalex.org/W2113352466","https://openalex.org/W2254208305","https://openalex.org/W2294809995","https://openalex.org/W2295470151","https://openalex.org/W2752853835","https://openalex.org/W2805273157","https://openalex.org/W2971618036","https://openalex.org/W3011039584","https://openalex.org/W3034065188","https://openalex.org/W3034339593","https://openalex.org/W3035858516","https://openalex.org/W3105181945","https://openalex.org/W3108194029","https://openalex.org/W4206007682","https://openalex.org/W6638998260","https://openalex.org/W6691590370","https://openalex.org/W6774585445","https://openalex.org/W6786163660"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W4376140277","https://openalex.org/W2091985989","https://openalex.org/W4367055576","https://openalex.org/W2077383771","https://openalex.org/W2011933350","https://openalex.org/W2914983903","https://openalex.org/W1971148082","https://openalex.org/W2019778981","https://openalex.org/W2146997899"],"abstract_inverted_index":{"We":[0,64],"present":[1],"the":[2,5,60,66,72,77,86,101,107,126,133,137,141,151,177,188],"principles":[3],"and":[4,179],"experiments":[6,156],"of":[7,11,28,36,52,79,92,136,150,173],"deduction":[8],"based":[9,124],"synthesis":[10,81,142],"merging":[12,51,163],"algorithms":[13,25,152,170],"for":[14,26,99,171,180],"binary":[15,29],"trees.":[16],"Merging":[17],"is":[18,74],"an":[19,174],"auxiliary":[20],"function":[21],"used":[22],"in":[23,44,96,158],"certain":[24,195],"sorting":[27],"trees,":[30],"however":[31],"we":[32],"also":[33,42,111],"address":[34],"concatenation":[35,160],"unsorted":[37],"trees":[38,54,105,130],"(the":[39],"result":[40,157],"will":[41],"be":[43],"general":[45],"not":[46],"sorted)":[47],"as":[48,50,57,59,165,167],"well":[49,58,166],"sorted":[53],"(both":[55],"inputs":[56],"output":[61],"are":[62,153],"sorted).":[63],"follow":[65],"classical":[67],"approach":[68,94],"to":[69,114],"deductive":[70],"synthesis:":[71],"algorithm":[73],"extracted":[75],"from":[76],"proof":[78,118],"a":[80,182,194],"conjecture,":[82],"which":[83,110],"asserts":[84],"that":[85,103],"merged":[87],"object":[88],"exists.":[89],"The":[90,155],"novelty":[91],"our":[93],"consists":[95],"using":[97,122],"multisets":[98],"expressing":[100],"fact":[102],"two":[104,185],"have":[106],"same":[108],"content,":[109],"allows":[112],"us":[113],"develop":[115],"new":[116],"powerful":[117],"techniques,":[119],"mostly":[120],"by":[121,132],"induction":[123],"on":[125,145],"Noetherian":[127],"ordering":[128],"among":[129],"induced":[131],"strict":[134],"inclusion":[135],"corresponding":[138],"multisets.":[139],"As":[140],"proofs":[143],"proceed":[144],"different":[146],"alternatives,":[147],"several":[148],"versions":[149],"produced.":[154],"24":[159],"algorithms,":[161,164],"4":[162],"some":[168],"sub-auxiliary":[169],"insertion":[172],"element":[175],"into":[176,184],"tree":[178,183],"splitting":[181],"sub-trees":[186],"having":[187],"elements":[189],"smaller,":[190],"respectively":[191],"bigger,":[192],"than":[193],"value.":[196]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}