Communication Complexity最新文献

筛选
英文 中文
Numbers on Foreheads 额上的数字
Communication Complexity Pub Date : 2020-02-01 DOI: 10.1017/9781108671644.007
Anup Rao, A. Yehudayoff
{"title":"Numbers on Foreheads","authors":"Anup Rao, A. Yehudayoff","doi":"10.1017/9781108671644.007","DOIUrl":"https://doi.org/10.1017/9781108671644.007","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431101","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
Memory Size 内存大小
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.014
H. Bingol
{"title":"Memory Size","authors":"H. Bingol","doi":"10.1017/9781108671644.014","DOIUrl":"https://doi.org/10.1017/9781108671644.014","url":null,"abstract":"It is a fact that there are many web pages for one to know all. Similarly there are many songs than we can keep in our mp3 players. It is not very difficult to increase examples of \"too many itemstoo little memory\" cases. We try to model the case where the memory is too small to keep all the items. We consider agents with a limited memory of size m. We let them interact by means of recommending web pages among the ones that they know. The giver agent \"remembers\" an item that is stored in its memory. The giver recommends the item to the taker agent. Since the taker does not have empty space in its memory, it \"forgets\" something and uses the emptied slot for the item recommended. We surprisingly observed that this process leads to many items become completely forgotten by the society while a few of them become extremely well known as the ratio of the memory size to the number of items decreases. We interpret this result as the emergence of fame. This may explain why there are so many web pages but only a small percentage is widely known. We also observed that some metrics such as the percentage of completely forgotten items, maximum fame, minimum fame changes linearly with the memory ratio.","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"395 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132346660","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
Index 指数
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.019
{"title":"Index","authors":"","doi":"10.1017/9781108671644.019","DOIUrl":"https://doi.org/10.1017/9781108671644.019","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116251363","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
Compressing Communication 压缩通信
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.010
{"title":"Compressing Communication","authors":"","doi":"10.1017/9781108671644.010","DOIUrl":"https://doi.org/10.1017/9781108671644.010","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125812095","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
Deterministic Protocols 确定的协议
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.004
{"title":"Deterministic Protocols","authors":"","doi":"10.1017/9781108671644.004","DOIUrl":"https://doi.org/10.1017/9781108671644.004","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121641904","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
Randomized Protocols 随机的协议
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.006
{"title":"Randomized Protocols","authors":"","doi":"10.1017/9781108671644.006","DOIUrl":"https://doi.org/10.1017/9781108671644.006","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122583617","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
Circuits and Proofs 电路与证明
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.013
{"title":"Circuits and Proofs","authors":"","doi":"10.1017/9781108671644.013","DOIUrl":"https://doi.org/10.1017/9781108671644.013","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123122228","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
Data Structures 数据结构
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.015
K. Mehlhorn, A. Tsakalidis
{"title":"Data Structures","authors":"K. Mehlhorn, A. Tsakalidis","doi":"10.1017/9781108671644.015","DOIUrl":"https://doi.org/10.1017/9781108671644.015","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127884228","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}
引用次数: 45
Discrepancy 差异
Communication Complexity Pub Date : 2020-01-31 DOI: 10.1017/9781108671644.008
{"title":"Discrepancy","authors":"","doi":"10.1017/9781108671644.008","DOIUrl":"https://doi.org/10.1017/9781108671644.008","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134338973","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
Distributed Computing 分布式计算
Communication Complexity Pub Date : 2015-07-06 DOI: 10.1017/9781108671644.017
U. Agarwal
{"title":"Distributed Computing","authors":"U. Agarwal","doi":"10.1017/9781108671644.017","DOIUrl":"https://doi.org/10.1017/9781108671644.017","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126482242","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
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学术官方微信