N. Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
{"title":"PODC 2019 Review","authors":"N. Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf","doi":"10.1145/3374857.3374866","DOIUrl":null,"url":null,"abstract":"The 38th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2019) was held on July 29-August 2, 2019 at the Double Tree Hilton hotel in Toronto, Canada. With three keynotes, over 40 accepted papers, over 20 accepted brief announcements, two workshops, and roughly 150 attendants, PODC 2019 constituted a composition of fascinating improvements in many areas of distributed and parallel computing.\n On the evening of the 31st of July, the conference banquet was held on a cruise over beautiful Lake Ontario and included the best papers award ceremony. The best paper award went to Yi-Jun Chang, and Thatchaphol Saranurak for their work titled, \\Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration\" [19]; two best student paper awards were given to Yi-Jun Chang, Manuela Fischer, and Yufan Zheng for their work titled, \\The Complexity of (Δ + 1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation\" [17] which was co-authored with Mohsen Gha ari, and Jara Uitto, and to Michal Dory and Dean Leitersdorf for the work on \\Fast Approximate Shortest Paths in the Congested Clique\" [16] which was co-authored with Keren Censor-Hillel, and Janne H. Korhonen. Congratulations to all the awardees and a special congratulations to Yi-Jun Chang for having received both awards!\n This review would be incomplete without mentioning perhaps one of the most notable results in the eld in recent years which was uploaded to the online archive just days before the conference gathered, and which was not presented at PODC 2019 but a ected many works presented at the conference: the work titled, ¶olylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization\" [48] by Vaclav Rozhon, and Mohsen Gha ari. Throughout the entire conference there was talk regarding the implications of this work, culminating with perhaps one of the more memorable moments of PODC 2019, where Mohsen described this result during his talk on a di erent paper which he co-authored with Fabian Kuhn - Mohsen quoted from his and Kuhn's paper [31]: \\we provide results that are in some sense the strongest that one can achieve, barring a major breakthrough\", and on the next slide was that major breakthrough - a picture of Vaclav Rozhon along with the rst page of [48]. Congratulations to the authors on this work!\n We hope that this review will give readers the opportunity to experience some of PODC 2019 and potentially attend the conference in future years. Thank you to the organizers and authors for a captivating and though-provoking conference!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-12-04","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/3374857.3374866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

第38届ACM SIGACT-SIGOPS分布式计算原理研讨会(PODC 2019)于2019年7月29日至8月2日在加拿大多伦多双树希尔顿酒店举行。PODC 2019有三个主题演讲,40多篇被接受的论文,20多篇被接受的简短公告,两个研讨会,大约150名与会者,构成了分布式和并行计算许多领域的迷人改进的组成。7月31日晚,会议晚宴在美丽的安大略湖上举行,并举行了最佳论文颁奖典礼。最佳论文奖授予Chang Yi-Jun和Thatchaphol Saranurak,他们的论文题为“改进的分布式扩展器分解和近最优三角形枚举”[19];两项最佳学生论文奖授予Chang Yi-Jun, Manuela Fischer和Yufan Zheng,他们的论文题目是“(Δ + 1)在拥挤的团中,大规模并行计算和集中局部计算的复杂性”[17],这是与Mohsen Gha ari和Jara Uitto共同撰写的,以及michael Dory和Dean Leitersdorf的“拥挤团中的快速近似最短路径”[16],这是与Keren centor - hillel和Janne H. Korhonen共同撰写的。祝贺所有获奖者,并特别祝贺张怡君同时获得这两个奖项!如果不提到近年来该领域最值得注意的结果之一,那么这篇综述将是不完整的,该结果在会议召开前几天上传到了在线档案中,该结果没有在PODC 2019上发表,而是收录了会议上发表的许多作品:由Vaclav Rozhon和Mohsen Gha ari撰写的题为“多对数-时间确定性网络分解和分布式非随机化”[48]的作品。整个会议都在讨论这项工作的意义,最终可能是PODC 2019上最令人难忘的时刻之一,Mohsen在他与Fabian Kuhn合著的另一篇论文中描述了这一结果- Mohsen引用了他和Kuhn的论文[31]:“我们提供的结果在某种意义上是人们所能达到的最强大的结果,除非有重大突破”,下一张幻灯片就是那个重大突破——瓦茨拉夫·罗钟的照片,与文献[48]的第一页放在一起。祝贺这项工作的作者!我们希望这篇综述将使读者有机会体验PODC 2019的一些内容,并有可能在未来几年参加会议。感谢组织者和作者们,让我们有了这样一个精彩而又发人深省的会议!
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PODC 2019 Review
The 38th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2019) was held on July 29-August 2, 2019 at the Double Tree Hilton hotel in Toronto, Canada. With three keynotes, over 40 accepted papers, over 20 accepted brief announcements, two workshops, and roughly 150 attendants, PODC 2019 constituted a composition of fascinating improvements in many areas of distributed and parallel computing. On the evening of the 31st of July, the conference banquet was held on a cruise over beautiful Lake Ontario and included the best papers award ceremony. The best paper award went to Yi-Jun Chang, and Thatchaphol Saranurak for their work titled, \Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration" [19]; two best student paper awards were given to Yi-Jun Chang, Manuela Fischer, and Yufan Zheng for their work titled, \The Complexity of (Δ + 1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation" [17] which was co-authored with Mohsen Gha ari, and Jara Uitto, and to Michal Dory and Dean Leitersdorf for the work on \Fast Approximate Shortest Paths in the Congested Clique" [16] which was co-authored with Keren Censor-Hillel, and Janne H. Korhonen. Congratulations to all the awardees and a special congratulations to Yi-Jun Chang for having received both awards! This review would be incomplete without mentioning perhaps one of the most notable results in the eld in recent years which was uploaded to the online archive just days before the conference gathered, and which was not presented at PODC 2019 but a ected many works presented at the conference: the work titled, ¶olylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization" [48] by Vaclav Rozhon, and Mohsen Gha ari. Throughout the entire conference there was talk regarding the implications of this work, culminating with perhaps one of the more memorable moments of PODC 2019, where Mohsen described this result during his talk on a di erent paper which he co-authored with Fabian Kuhn - Mohsen quoted from his and Kuhn's paper [31]: \we provide results that are in some sense the strongest that one can achieve, barring a major breakthrough", and on the next slide was that major breakthrough - a picture of Vaclav Rozhon along with the rst page of [48]. Congratulations to the authors on this work! We hope that this review will give readers the opportunity to experience some of PODC 2019 and potentially attend the conference in future years. Thank you to the organizers and authors for a captivating and though-provoking conference!
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信