发布求助
文献互助 智能选刊 最新文献

Colloquium on Structural Information & Communication Complexity最新文献

筛选
英文 中文
Constant-Space Self-stabilizing Token Distribution in Trees 树中的常空间自稳定令牌分布
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_4
Y. Sudo, A. Datta, L. Larmore, T. Masuzawa
{"title":"Constant-Space Self-stabilizing Token Distribution in Trees","authors":"Y. Sudo, A. Datta, L. Larmore, T. Masuzawa","doi":"10.1007/978-3-030-01325-7_4","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_4","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129155535","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
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract) 有向图容错一致性研究(扩展摘要)
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_10
Ashish Choudhury, Gayathri Garimella, A. Patra, D. Ravi, Pratik Sarkar
{"title":"Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)","authors":"Ashish Choudhury, Gayathri Garimella, A. Patra, D. Ravi, Pratik Sarkar","doi":"10.1007/978-3-030-01325-7_10","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_10","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126229156","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
One-Max Constant-Probability Networks: Results and Future Work 1 - max常概率网络:结果和未来工作
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_8
Mark Korenblit
{"title":"One-Max Constant-Probability Networks: Results and Future Work","authors":"Mark Korenblit","doi":"10.1007/978-3-030-01325-7_8","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_8","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121017856","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
Realizability of Graph Specifications: Characterizations and Algorithms 图形规范的可实现性:表征和算法
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_1
A. Bar-Noy, Keerti Choudhary, D. Peleg, Dror Rawitz
{"title":"Realizability of Graph Specifications: Characterizations and Algorithms","authors":"A. Bar-Noy, Keerti Choudhary, D. Peleg, Dror Rawitz","doi":"10.1007/978-3-030-01325-7_1","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_1","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127040765","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}
引用次数: 12
Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O(1) Clocks 偏置时钟:一种改进O(1)时钟执行谓词检测能力的新方法
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_29
Vidhya Tekken Valapil, S. Kulkarni
{"title":"Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O(1) Clocks","authors":"Vidhya Tekken Valapil, S. Kulkarni","doi":"10.1007/978-3-030-01325-7_29","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_29","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"397 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121336143","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}
引用次数: 4
Online Service with Delay on a Line 在线业务中存在线路延迟
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_22
Marcin Bienkowski, A. Kraska, Pawel Schmidt
{"title":"Online Service with Delay on a Line","authors":"Marcin Bienkowski, A. Kraska, Pawel Schmidt","doi":"10.1007/978-3-030-01325-7_22","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_22","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124921562","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}
引用次数: 20
Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN Make&Activate-Before-Break: SDN中保持无缝路由替换的策略
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_6
Yefim Dinitz, S. Dolev, D. Khankin
{"title":"Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN","authors":"Yefim Dinitz, S. Dolev, D. Khankin","doi":"10.1007/978-3-030-01325-7_6","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_6","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122296322","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
Time-Bounded Influence Diffusion with Incentives 具有激励的限时影响扩散
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_25
G. Cordasco, L. Gargano, J. Peters, A. A. Rescigno, U. Vaccaro
{"title":"Time-Bounded Influence Diffusion with Incentives","authors":"G. Cordasco, L. Gargano, J. Peters, A. A. Rescigno, U. Vaccaro","doi":"10.1007/978-3-030-01325-7_25","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_25","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679997","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
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree 能量交换移动代理分布在树上的广播
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_20
J. Czyzowicz, K. Diks, J. Moussi, W. Rytter
{"title":"Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree","authors":"J. Czyzowicz, K. Diks, J. Moussi, W. Rytter","doi":"10.1007/978-3-030-01325-7_20","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_20","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133906761","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}
引用次数: 4
Formalizing Compute-Aggregate Problems in Cloud Computing 云计算中计算聚合问题的形式化
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_31
P. Chuprikov, A. Davydow, Kirill Kogan, S. Nikolenko, Alexander Sirotkin
{"title":"Formalizing Compute-Aggregate Problems in Cloud Computing","authors":"P. Chuprikov, A. Davydow, Kirill Kogan, S. Nikolenko, Alexander Sirotkin","doi":"10.1007/978-3-030-01325-7_31","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_31","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"67 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125403551","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术官方微信