Inf. Process. Lett.最新文献

筛选
英文 中文
Key recovery attacks on reduced-round Joltik-BC in the single-key setting 在单键设置下对减圆Joltik-BC的键恢复攻击
Inf. Process. Lett. Pub Date : 2019-11-01 DOI: 10.1016/J.IPL.2019.105834
Rongjia Li, Chenhui Jin, Hongchen Pan
{"title":"Key recovery attacks on reduced-round Joltik-BC in the single-key setting","authors":"Rongjia Li, Chenhui Jin, Hongchen Pan","doi":"10.1016/J.IPL.2019.105834","DOIUrl":"https://doi.org/10.1016/J.IPL.2019.105834","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"128 1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87762729","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}
引用次数: 3
A new lower bound on the price of anarchy of selfish bin packing 自私的垃圾包装的无政府状态的价格的新下限
Inf. Process. Lett. Pub Date : 2019-10-01 DOI: 10.1016/J.IPL.2019.06.002
G. Dósa, L. Epstein
{"title":"A new lower bound on the price of anarchy of selfish bin packing","authors":"G. Dósa, L. Epstein","doi":"10.1016/J.IPL.2019.06.002","DOIUrl":"https://doi.org/10.1016/J.IPL.2019.06.002","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"52 1","pages":"6-12"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78286685","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}
引用次数: 5
Some properties of alternating group networks 交替群网络的一些性质
Inf. Process. Lett. Pub Date : 2019-10-01 DOI: 10.1016/j.ipl.2019.07.001
Yun-Ping Deng
{"title":"Some properties of alternating group networks","authors":"Yun-Ping Deng","doi":"10.1016/j.ipl.2019.07.001","DOIUrl":"https://doi.org/10.1016/j.ipl.2019.07.001","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"27 1","pages":"18-21"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72832104","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}
引用次数: 0
Optimal Circle Search Despite the Presence of Faulty Robots 存在故障机器人的最优圆搜索
Inf. Process. Lett. Pub Date : 2019-09-12 DOI: 10.1007/978-3-030-34405-4_11
Konstantinos Georgiou, E. Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis V. Papaioannou
{"title":"Optimal Circle Search Despite the Presence of Faulty Robots","authors":"Konstantinos Georgiou, E. Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis V. Papaioannou","doi":"10.1007/978-3-030-34405-4_11","DOIUrl":"https://doi.org/10.1007/978-3-030-34405-4_11","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"18 1","pages":"106391"},"PeriodicalIF":0.0,"publicationDate":"2019-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90496651","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}
引用次数: 14
Faster algorithms for cograph edge modification problems 图形边缘修正问题的快速算法
Inf. Process. Lett. Pub Date : 2019-08-03 DOI: 10.1016/j.ipl.2020.105946
Dekel Tsur
{"title":"Faster algorithms for cograph edge modification problems","authors":"Dekel Tsur","doi":"10.1016/j.ipl.2020.105946","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.105946","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"66 1","pages":"105946"},"PeriodicalIF":0.0,"publicationDate":"2019-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72860850","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}
引用次数: 6
Algorithms for deletion problems on split graphs 分割图上删除问题的算法
Inf. Process. Lett. Pub Date : 2019-06-24 DOI: 10.1016/j.ipl.2020.106066
Dekel Tsur
{"title":"Algorithms for deletion problems on split graphs","authors":"Dekel Tsur","doi":"10.1016/j.ipl.2020.106066","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106066","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"26 1","pages":"106066"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84479338","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}
引用次数: 0
A Constructive Proof of a Concentration Bound for Real-Valued Random Variables 实值随机变量集中界的构造性证明
Inf. Process. Lett. Pub Date : 2019-05-03 DOI: 10.1016/j.ipl.2020.105942
Wolfgang Mulzer, Natalia Shenkman
{"title":"A Constructive Proof of a Concentration Bound for Real-Valued Random Variables","authors":"Wolfgang Mulzer, Natalia Shenkman","doi":"10.1016/j.ipl.2020.105942","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.105942","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"59 1","pages":"105942"},"PeriodicalIF":0.0,"publicationDate":"2019-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85834149","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}
引用次数: 0
Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes 平衡超立方体的容错-规定哈密顿可缺性
Inf. Process. Lett. Pub Date : 2019-05-01 DOI: 10.1016/j.ipl.2019.01.002
Yuxing Yang, Lingling Zhang
{"title":"Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes","authors":"Yuxing Yang, Lingling Zhang","doi":"10.1016/j.ipl.2019.01.002","DOIUrl":"https://doi.org/10.1016/j.ipl.2019.01.002","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"258 1","pages":"11-15"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76191842","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}
引用次数: 8
Reductions in PPP 购买力平价下降
Inf. Process. Lett. Pub Date : 2019-05-01 DOI: 10.1016/j.ipl.2018.12.009
F. Ban, K. Jain, C. Papadimitriou, Alexandros Psomas, A. Rubinstein
{"title":"Reductions in PPP","authors":"F. Ban, K. Jain, C. Papadimitriou, Alexandros Psomas, A. Rubinstein","doi":"10.1016/j.ipl.2018.12.009","DOIUrl":"https://doi.org/10.1016/j.ipl.2018.12.009","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"39 1","pages":"48-52"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74667321","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}
引用次数: 8
Hanano Puzzle is NP-hard 《Hanano Puzzle》是np难度的
Inf. Process. Lett. Pub Date : 2019-05-01 DOI: 10.1016/j.ipl.2019.01.003
Ziwen Liu, Chao Yang
{"title":"Hanano Puzzle is NP-hard","authors":"Ziwen Liu, Chao Yang","doi":"10.1016/j.ipl.2019.01.003","DOIUrl":"https://doi.org/10.1016/j.ipl.2019.01.003","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"14 3 1","pages":"6-10"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77564942","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}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信