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

Colloquium on Structural Information & Communication Complexity最新文献

筛选
英文 中文
Network Decomposition and Distributed Derandomization (Invited Paper) 网络分解与分布式非随机化(特邀论文)
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_1
M. Ghaffari
{"title":"Network Decomposition and Distributed Derandomization (Invited Paper)","authors":"M. Ghaffari","doi":"10.1007/978-3-030-54921-3_1","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_1","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"11 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134301912","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}
引用次数: 1
Communication Complexity of Wait-Free Computability in Dynamic Networks 动态网络中无等待可计算性的通信复杂度
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_17
C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum
{"title":"Communication Complexity of Wait-Free Computability in Dynamic Networks","authors":"C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum","doi":"10.1007/978-3-030-54921-3_17","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_17","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124200077","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
Distributed Testing of Distance-k Colorings 距离k着色的分布检验
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_16
P. Fraigniaud, M. Halldórsson, Alexandre Nolin
{"title":"Distributed Testing of Distance-k Colorings","authors":"P. Fraigniaud, M. Halldórsson, Alexandre Nolin","doi":"10.1007/978-3-030-54921-3_16","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_16","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953539","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
Cops and Robbers on Dynamic Graphs: Offline and Online Case 动态图表上的警察和劫匪:离线和在线案例
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_12
Stefan Balev, J. L. Laredo, I. Lamprou, Yoann Pigné, Éric Sanlaville
{"title":"Cops and Robbers on Dynamic Graphs: Offline and Online Case","authors":"Stefan Balev, J. L. Laredo, I. Lamprou, Yoann Pigné, Éric Sanlaville","doi":"10.1007/978-3-030-54921-3_12","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_12","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129032967","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
Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents 初始分散移动代理对同步环形网络的黑病毒去污
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_13
Nikos Giachoudis, M. Kokkou, Euripides Markou
{"title":"Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents","authors":"Nikos Giachoudis, M. Kokkou, Euripides Markou","doi":"10.1007/978-3-030-54921-3_13","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_13","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114333464","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
Improved Lower Bounds for Shoreline Search 改进了海岸线搜索的下限
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_5
S. Dobrev, Rastislav Kralovic, Dana Pardubská
{"title":"Improved Lower Bounds for Shoreline Search","authors":"S. Dobrev, Rastislav Kralovic, Dana Pardubská","doi":"10.1007/978-3-030-54921-3_5","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_5","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116880552","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
Exploration of Time-Varying Connected Graphs with Silent Agents 具有沉默代理的时变连通图的探索
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_9
S. Dobrev, Rastislav Kralovic, Dana Pardubská
{"title":"Exploration of Time-Varying Connected Graphs with Silent Agents","authors":"S. Dobrev, Rastislav Kralovic, Dana Pardubská","doi":"10.1007/978-3-030-54921-3_9","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_9","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133110122","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
Resource Burning for Permissionless Systems (Invited Paper) 为无需许可的系统燃烧资源(邀请文件)
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_2
Diksha Gupta, Jared Saia, Maxwell Young
{"title":"Resource Burning for Permissionless Systems (Invited Paper)","authors":"Diksha Gupta, Jared Saia, Maxwell Young","doi":"10.1007/978-3-030-54921-3_2","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_2","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122653237","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
Stateless Information Dissemination Algorithms 无状态信息传播算法
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_11
V. Turau
{"title":"Stateless Information Dissemination Algorithms","authors":"V. Turau","doi":"10.1007/978-3-030-54921-3_11","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_11","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611518","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
Non-strict Temporal Exploration 非严格时间探索
Colloquium on Structural Information & Communication Complexity Pub Date : 2020-06-29 DOI: 10.1007/978-3-030-54921-3_8
T. Erlebach, Jakob T. Spooner
{"title":"Non-strict Temporal Exploration","authors":"T. Erlebach, Jakob T. Spooner","doi":"10.1007/978-3-030-54921-3_8","DOIUrl":"https://doi.org/10.1007/978-3-030-54921-3_8","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"12 5-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114038190","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信