多通道图流下界的最新进展

Dan Alistarh
{"title":"多通道图流下界的最新进展","authors":"Dan Alistarh","doi":"10.1145/3623800.3623807","DOIUrl":null,"url":null,"abstract":"Overview. In this Fall edition of the column, we resume our coverage of \"hot topics\" in areas connected to distributed computing with a column by Sepehr Assadi, who is an Associate Professor at the Cheriton School of Computer Science, University of Waterloo. Sepehr's work was highlighted by the PODC community before, as he was the recipient of the 2019 PODC Doctoral Dissertation Award for his work on streaming algorithms, multiparty communication, and massively parallel computation on graphs, and features frequently in the proceedings of mainstream theory conferences such as FOCS, STOC, and SODA. In this column, Sepehr covers some of the recent progress on multi-pass graph streaming lower bounds, which includes a significant amount of his own work. Many thanks to Sepehr for his interesting contribution!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds\",\"authors\":\"Dan Alistarh\",\"doi\":\"10.1145/3623800.3623807\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Overview. In this Fall edition of the column, we resume our coverage of \\\"hot topics\\\" in areas connected to distributed computing with a column by Sepehr Assadi, who is an Associate Professor at the Cheriton School of Computer Science, University of Waterloo. Sepehr's work was highlighted by the PODC community before, as he was the recipient of the 2019 PODC Doctoral Dissertation Award for his work on streaming algorithms, multiparty communication, and massively parallel computation on graphs, and features frequently in the proceedings of mainstream theory conferences such as FOCS, STOC, and SODA. In this column, Sepehr covers some of the recent progress on multi-pass graph streaming lower bounds, which includes a significant amount of his own work. Many thanks to Sepehr for his interesting contribution!\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3623800.3623807\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3623800.3623807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

概述。在本专栏的秋季版中,我们将由滑铁卢大学Cheriton计算机科学学院的副教授Sepehr Assadi撰写一篇专栏文章,继续对分布式计算相关领域的“热门话题”进行报道。Sepehr的工作之前就受到了PODC社区的重视,因为他在流算法、多方通信和图上的大规模并行计算方面的工作获得了2019年PODC博士论文奖,并经常在主流理论会议(如FOCS、STOC和SODA)的论文集中发表。在本专栏中,Sepehr介绍了多通道图流下界的一些最新进展,其中包括他自己的大量工作。非常感谢Sepehr的有趣贡献!
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds
Overview. In this Fall edition of the column, we resume our coverage of "hot topics" in areas connected to distributed computing with a column by Sepehr Assadi, who is an Associate Professor at the Cheriton School of Computer Science, University of Waterloo. Sepehr's work was highlighted by the PODC community before, as he was the recipient of the 2019 PODC Doctoral Dissertation Award for his work on streaming algorithms, multiparty communication, and massively parallel computation on graphs, and features frequently in the proceedings of mainstream theory conferences such as FOCS, STOC, and SODA. In this column, Sepehr covers some of the recent progress on multi-pass graph streaming lower bounds, which includes a significant amount of his own work. Many thanks to Sepehr for his interesting contribution!
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信