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

Colloquium on Structural Information & Communication Complexity最新文献

筛选
英文 中文
Distributed Pattern Formation in a Ring 环中的分布式模式形成
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-05-21 DOI: 10.1007/978-3-030-24922-9_15
Anne-Laure Ehresmann, Manuel Lafond, L. Narayanan, J. Opatrny
{"title":"Distributed Pattern Formation in a Ring","authors":"Anne-Laure Ehresmann, Manuel Lafond, L. Narayanan, J. Opatrny","doi":"10.1007/978-3-030-24922-9_15","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_15","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114632673","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
How to Color a French Flag-Biologically Inspired Algorithms for Scale-Invariant Patterning 如何为法国国旗上色——尺度不变图案的生物学启发算法
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-05-01 DOI: 10.1007/978-3-030-24922-9_22
Alberto Ancona, Ayesha Bajwa, N. Lynch, Frederik Mallmann-Trenn
{"title":"How to Color a French Flag-Biologically Inspired Algorithms for Scale-Invariant Patterning","authors":"Alberto Ancona, Ayesha Bajwa, N. Lynch, Frederik Mallmann-Trenn","doi":"10.1007/978-3-030-24922-9_22","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_22","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"690 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134005854","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
Locality of not-so-weak coloring 非弱着色的局部性
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-04-11 DOI: 10.1007/978-3-030-24922-9_3
A. Balliu, J. Hirvonen, C. Lenzen, D. Olivetti, J. Suomela
{"title":"Locality of not-so-weak coloring","authors":"A. Balliu, J. Hirvonen, C. Lenzen, D. Olivetti, J. Suomela","doi":"10.1007/978-3-030-24922-9_3","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_3","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207356","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
A Characterization of t-Resilient Colorless Task Anonymous Solvability t弹性无色任务匿名可解性的表征
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_18
C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum, Nayuta Yanagisawa
{"title":"A Characterization of t-Resilient Colorless Task Anonymous Solvability","authors":"C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum, Nayuta Yanagisawa","doi":"10.1007/978-3-030-01325-7_18","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_18","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":"116336939","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
On the Strongest Message Adversary for Consensus in Directed Dynamic Networks 定向动态网络中共识的最强信息对手
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_13
U. Schmid, Manfred Schwarz, Kyrill Winkler
{"title":"On the Strongest Message Adversary for Consensus in Directed Dynamic Networks","authors":"U. Schmid, Manfred Schwarz, Kyrill Winkler","doi":"10.1007/978-3-030-01325-7_13","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_13","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"9 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":"131762952","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 in Vertex Partition Whiteboard Model 顶点划分白板模型的通信复杂度
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_24
T. Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki
{"title":"Communication Complexity in Vertex Partition Whiteboard Model","authors":"T. Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki","doi":"10.1007/978-3-030-01325-7_24","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_24","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"24 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":"131843899","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
On Knowledge and Communication Complexity in Distributed Systems 分布式系统中的知识和通信复杂性研究
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_27
Daniel Pfleger, U. Schmid
{"title":"On Knowledge and Communication Complexity in Distributed Systems","authors":"Daniel Pfleger, U. Schmid","doi":"10.1007/978-3-030-01325-7_27","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_27","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"120 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":"123230488","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
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model 在拥塞团模型中，重构任何图(类)都需要两轮
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_15
Pedro Montealegre, Sebastian Perez-Salazar, I. Rapaport, Ioan Todinca
{"title":"Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model","authors":"Pedro Montealegre, Sebastian Perez-Salazar, I. Rapaport, Ioan Todinca","doi":"10.1007/978-3-030-01325-7_15","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_15","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":"123672464","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 Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model 链接寄存器模型中最大匹配的自稳定算法
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_2
Johanne Cohen, George Manoussakis, Laurence Pilard, D. Sohier
{"title":"A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model","authors":"Johanne Cohen, George Manoussakis, Laurence Pilard, D. Sohier","doi":"10.1007/978-3-030-01325-7_2","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_2","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"76 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":"124103619","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
Brief Announcement: Fast Approximate Counting and Leader Election in Populations 简要公告:人口快速近似计数和领导人选举
Colloquium on Structural Information & Communication Complexity Pub Date : 2018-06-18 DOI: 10.1007/978-3-030-01325-7_7
O. Michail, P. Spirakis, Michail Theofilatos
{"title":"Brief Announcement: Fast Approximate Counting and Leader Election in Populations","authors":"O. Michail, P. Spirakis, Michail Theofilatos","doi":"10.1007/978-3-030-01325-7_7","DOIUrl":"https://doi.org/10.1007/978-3-030-01325-7_7","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"73 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":"126971500","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
首页 上一页 下一页 尾页
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学术官方微信