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

Colloquium on Structural Information & Communication Complexity最新文献

筛选
英文 中文
Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup 服务器分配中的混合容错:强化与备份的结合
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_23
Tal Navon, D. Peleg
{"title":"Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup","authors":"Tal Navon, D. Peleg","doi":"10.1007/978-3-030-01325-7_23","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_23","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"19 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":"117302391","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
Distributed Counting Along Lossy Paths Without Feedback 无反馈的有损路径分布计数
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_5
Vitalii Demianiuk, Sergey Gorinsky, S. Nikolenko, Kirill Kogan
{"title":"Distributed Counting Along Lossy Paths Without Feedback","authors":"Vitalii Demianiuk, Sergey Gorinsky, S. Nikolenko, Kirill Kogan","doi":"10.1007/978-3-030-01325-7_5","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_5","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"23 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":"133607883","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
Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection 基于瞬时稳定静止检测的高效自稳定变压器
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_3
Anaïs Durand, S. Kutten
{"title":"Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection","authors":"Anaïs Durand, S. Kutten","doi":"10.1007/978-3-030-01325-7_3","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_3","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"25 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131957990","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
Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique 广播拥塞团中的连通性和最小切割逼近
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_28
T. Jurdzinski, Krzysztof Nowicki
{"title":"Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique","authors":"T. Jurdzinski, Krzysztof Nowicki","doi":"10.1007/978-3-030-01325-7_28","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_28","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":"126533715","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}
引用次数: 10
Deterministic Distributed Ruling Sets of Line Graphs 线形图的确定性分布统治集
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-05-18 DOI: 10.1007/978-3-030-01325-7_19
F. Kuhn, Yannic Maus, Simon Weidner
{"title":"Deterministic Distributed Ruling Sets of Line Graphs","authors":"F. Kuhn, Yannic Maus, Simon Weidner","doi":"10.1007/978-3-030-01325-7_19","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_19","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"515 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116566414","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}
引用次数: 23
Balanced Allocations and Global Clock in Population Protocols: An Accurate Analysis 人口协议中的均衡分配和全球时钟:一个准确的分析
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-05-14 DOI: 10.1007/978-3-030-01325-7_26
Yves Mocquard, B. Sericola, E. Anceaume
{"title":"Balanced Allocations and Global Clock in Population Protocols: An Accurate Analysis","authors":"Yves Mocquard, B. Sericola, E. Anceaume","doi":"10.1007/978-3-030-01325-7_26","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_26","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127337610","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
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks 有界属网络中直径的能量复杂度及最小割计算
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-05-10 DOI: 10.1007/978-3-031-32733-9_12
Yi-Jun Chang
{"title":"The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks","authors":"Yi-Jun Chang","doi":"10.1007/978-3-031-32733-9_12","DOIUrl":"https://doi.org/10.1007/978-3-031-32733-9_12","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028642","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
Symmetric Rendezvous With Advice: How to Rendezvous in a Disk 带通知的对称会合:如何在磁盘中会合
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-05-09 DOI: 10.1007/978-3-030-01325-7_14
Konstantinos Georgiou, Jay Griffiths, Yuval Yakubov
{"title":"Symmetric Rendezvous With Advice: How to Rendezvous in a Disk","authors":"Konstantinos Georgiou, Jay Griffiths, Yuval Yakubov","doi":"10.1007/978-3-030-01325-7_14","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_14","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014542","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
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log Nlog varDelta /log ^2log varDelta ) Rounds O(log Nlog varDelta /log ^2log varDelta)轮中加权顶点覆盖的确定性分布2逼近
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-04-04 DOI: 10.1007/978-3-030-01325-7_21
R. Ben-Basat, G. Even, K. Kawarabayashi, Gregory Schwartzman
{"title":"A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log Nlog varDelta /log ^2log varDelta ) Rounds","authors":"R. Ben-Basat, G. Even, K. Kawarabayashi, Gregory Schwartzman","doi":"10.1007/978-3-030-01325-7_21","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_21","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126510575","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
Gathering in the Plane of Location-Aware Robots in the Presence of Spies 间谍存在下的位置感知机器人平面聚集
Colloquium on Structural Information & Communication Complexity Pub Date : 2017-12-07 DOI: 10.1007/978-3-030-01325-7_30
J. Czyzowicz, R. Killick, E. Kranakis, D. Krizanc, Oscar Morales-Ponce
{"title":"Gathering in the Plane of Location-Aware Robots in the Presence of Spies","authors":"J. Czyzowicz, R. Killick, E. Kranakis, D. Krizanc, Oscar Morales-Ponce","doi":"10.1007/978-3-030-01325-7_30","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_30","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128003230","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
首页 上一页 下一页 尾页
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学术官方微信