Pub Date : 2022-12-30DOI: 10.1007/978-3-031-20796-9_6
Zhanghao Yao, Yukun Cheng, Zhiqi Xu
{"title":"Equilibrium Analysis of Block Withholding Attack: An Evolutionary Game Perspective","authors":"Zhanghao Yao, Yukun Cheng, Zhiqi Xu","doi":"10.1007/978-3-031-20796-9_6","DOIUrl":"https://doi.org/10.1007/978-3-031-20796-9_6","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122668433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-24DOI: 10.48550/arXiv.2204.11213
Ruixi Luo, Taikun Zhu, Kai Jin
We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words so that their repeating strings are non-decreasing (or non-increasing, respectively), where the repeating string of a word $A$ refers to the infinite string $AAAldots$. Moreover, for fixed size alphabet $Sigma$, we design an $O(L)$ time sorting algorithm of the words (in the mentioned orders), where $L$ denotes the total length of the input words. Hence we obtain an $O(L)$ time algorithm for the rearrangement problem. Finally, we point out that comparing primitive words via comparing their repeating strings leads to a total order, which can further be extended to a total order on the finite words (or all words).
我们研究以下重排问题:给定$n$个单词，重新排列并连接它们，使获得的字符串在字典顺序上分别是最小的(或最大的)。我们证明，这个问题可以简化为对给定的单词进行排序，使它们的重复字符串是非递减的(或分别是非递增的)，其中单词的重复字符串$ a $指的是无限字符串$AAAldots$。此外，对于固定大小的字母表$Sigma$，我们设计了$O(L)$时间排序算法(按照上述顺序)，其中$L$表示输入单词的总长度。因此，我们得到了一个$O(L)$ time的重排算法。最后，我们指出，通过比较原语单词的重复字符串来比较原语单词会导致一个总顺序，这个顺序可以进一步扩展到有限单词(或所有单词)上的总顺序。
{"title":"String Rearrangement Inequalities and a Total Order Between Primitive Words","authors":"Ruixi Luo, Taikun Zhu, Kai Jin","doi":"10.48550/arXiv.2204.11213","DOIUrl":"https://doi.org/10.48550/arXiv.2204.11213","url":null,"abstract":"We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words so that their repeating strings are non-decreasing (or non-increasing, respectively), where the repeating string of a word $A$ refers to the infinite string $AAAldots$. Moreover, for fixed size alphabet $Sigma$, we design an $O(L)$ time sorting algorithm of the words (in the mentioned orders), where $L$ denotes the total length of the input words. Hence we obtain an $O(L)$ time algorithm for the rearrangement problem. Finally, we point out that comparing primitive words via comparing their repeating strings leads to a total order, which can further be extended to a total order on the finite words (or all words).","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1007/978-3-030-59901-0_6
Felix Höhne, R. V. Stee
{"title":"Buffer Minimization with Conflicts on a Line","authors":"Felix Höhne, R. V. Stee","doi":"10.1007/978-3-030-59901-0_6","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_6","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125318540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-01DOI: 10.1007/978-3-030-59901-0_8
Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang
{"title":"Minimizing Energy on Homogeneous Processors with Shared Memory","authors":"Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang","doi":"10.1007/978-3-030-59901-0_8","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_8","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-19DOI: 10.1007/978-3-030-59901-0_7
Dehua Xu, Limin Xu, Zhijun Xu
{"title":"Single Machine Scheduling Problem with a Flexible Maintenance Revisited","authors":"Dehua Xu, Limin Xu, Zhijun Xu","doi":"10.1007/978-3-030-59901-0_7","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_7","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123210816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-01DOI: 10.1007/978-3-030-59901-0_9
N. Melissinos, Aris Pagourtzis, Theofilos Triommatis
{"title":"Approximation Schemes for Subset Sum Ratio Problems","authors":"N. Melissinos, Aris Pagourtzis, Theofilos Triommatis","doi":"10.1007/978-3-030-59901-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_9","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114185506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-21DOI: 10.1007/978-3-030-59901-0_1
You Chen, Ping Li, Xueliang Li, Yindi Weng
{"title":"Complexity results for the proper disconnection of graphs","authors":"You Chen, Ping Li, Xueliang Li, Yindi Weng","doi":"10.1007/978-3-030-59901-0_1","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-29DOI: 10.1007/978-3-030-18126-0_12
Wenxing Lai
{"title":"The Inapproximability of k-DominatingSet for Parameterized mathsf AC^0 AC 0 Circuits","authors":"Wenxing Lai","doi":"10.1007/978-3-030-18126-0_12","DOIUrl":"https://doi.org/10.1007/978-3-030-18126-0_12","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123728978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：