As this is the rst column I am editing, I would like to sincerely thank Jennifer Welch for inviting me as editor, and for being extremely helpful with the transition. I will do my best to maintain the very high standard set for the column by her, and by the previous editors. Following custom, the December issue is devoted to a review of some notable events related to distributed computing which occurred during the year. First, congratulations to Alessandro Panconesi and Aravind Srinivasan for being awarded the 2019 Edsger W. Dijkstra Prize in Distributed Computing for their paper Randomized Distributed Edge Coloring via an Extension of the Cherno Hoe ding Bounds," which appeared in the SIAM Journal on Computing in 1997. The prize is jointly sponsored by ACM and EATCS, and is given alternately at PODC1 and DISC2; this year it was awarded at DISC.
由于这是我编辑的第一个专栏，我衷心感谢詹妮弗·韦尔奇邀请我担任编辑，并在过渡期间提供了极大的帮助。我将尽我所能保持她和前几任编辑为专栏设定的高标准。按照惯例，12月号将专门回顾一年中发生的一些与分布式计算相关的重大事件。首先，祝贺Alessandro Panconesi和Aravind Srinivasan获得2019年Edsger W. Dijkstra分布式计算奖，他们的论文《通过Cherno Hoe ding边界的扩展随机分布边缘着色》发表在1997年的SIAM计算杂志上。该奖项由ACM和EATCS联合主办，在PODC1和DISC2上轮流颁发;今年，它在DISC获得了奖项。
{"title":"Distributed Computing Column 76: Annual Review 2019","authors":"Dan Alistarh","doi":"10.1145/3374857.3374865","DOIUrl":"https://doi.org/10.1145/3374857.3374865","url":null,"abstract":"As this is the rst column I am editing, I would like to sincerely thank Jennifer Welch for inviting me as editor, and for being extremely helpful with the transition. I will do my best to maintain the very high standard set for the column by her, and by the previous editors. Following custom, the December issue is devoted to a review of some notable events related to distributed computing which occurred during the year.\u0000 First, congratulations to Alessandro Panconesi and Aravind Srinivasan for being awarded the 2019 Edsger W. Dijkstra Prize in Distributed Computing for their paper Randomized Distributed Edge Coloring via an Extension of the Cherno Hoe ding Bounds,\" which appeared in the SIAM Journal on Computing in 1997. The prize is jointly sponsored by ACM and EATCS, and is given alternately at PODC1 and DISC2; this year it was awarded at DISC.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72969563","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}
The second Summer School on Practice and Theory of Distributed Computing (SPTDC 2019) took place on July 8-12, 2019, in Saint-Petersburg, Russia. In addition to graduate and undergraduate students from all around the world, the audience featured a considerable presence of industrial researchers and software engineers. The program offered a wide range of classes on practical and theoretical aspects of distributed systems, given by renowned experts: Leslie Lamport, Michael Scott, Maurice Herlihy, Eli Gafni, Danny Hendler, Achour Mostefaoui, Ittai Abraham, and Trevor Brown.
第二届分布式计算实践与理论暑期学校(SPTDC 2019)于2019年7月8日至12日在俄罗斯圣彼得堡举行。除了来自世界各地的研究生和本科生外，观众还包括相当多的工业研究人员和软件工程师。该计划提供了广泛的分布式系统实践和理论方面的课程，由知名专家授课:Leslie Lamport, Michael Scott, Maurice Herlihy, Eli Gafni, Danny Hendler, Achour Mostefaoui, Ittai Abraham和Trevor Brown。
{"title":"Review of the Second Sankt Petersburg Summer School on Practice and Theory of Distributed Computing (SPTDC 2019)","authors":"P. Kuznetsov","doi":"10.1145/3374857.3374868","DOIUrl":"https://doi.org/10.1145/3374857.3374868","url":null,"abstract":"The second Summer School on Practice and Theory of Distributed Computing (SPTDC 2019) took place on July 8-12, 2019, in Saint-Petersburg, Russia. In addition to graduate and undergraduate students from all around the world, the audience featured a considerable presence of industrial researchers and software engineers. The program offered a wide range of classes on practical and theoretical aspects of distributed systems, given by renowned experts: Leslie Lamport, Michael Scott, Maurice Herlihy, Eli Gafni, Danny Hendler, Achour Mostefaoui, Ittai Abraham, and Trevor Brown.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73709153","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}
N. Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
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!
{"title":"PODC 2019 Review","authors":"N. Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf","doi":"10.1145/3374857.3374866","DOIUrl":"https://doi.org/10.1145/3374857.3374866","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.\u0000 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!\u0000 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!\u0000 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.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83877750","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}
In this column, we will discuss some papers in online algorithms that appeared in 2019. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!
{"title":"SIGACT News Online Algorithms Column 35: 2019 in review","authors":"Felix Höhne, Sören Schmitt, R. V. Stee","doi":"10.1145/3374857.3374871","DOIUrl":"https://doi.org/10.1145/3374857.3374871","url":null,"abstract":"In this column, we will discuss some papers in online algorithms that appeared in 2019. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86316942","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}
The 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2019) took place in Amsterdam, The Netherlands, from July 1 to July 3, 2019, in conjunction with the 2019 ACM SIGMOD International Conference on Management of Data. PODS focuses on theoretical aspects of data management, and the co-location with SIGMOD stimulates interaction between theory-oriented and systems-oriented research. Since the first edition of the symposium in 1982, the PODS papers are distinguished by a rigorous approach to widely diverse problems in data management, often bringing to bear techniques from a variety of different areas, including computational logic, finite model theory, computational complexity, algorithm design and analysis, programming languages, and artificial intelligence.
{"title":"Database Theory Column Report on PODS 2019","authors":"Christoph E. Koch","doi":"10.1145/3374857.3374872","DOIUrl":"https://doi.org/10.1145/3374857.3374872","url":null,"abstract":"The 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2019) took place in Amsterdam, The Netherlands, from July 1 to July 3, 2019, in conjunction with the 2019 ACM SIGMOD International Conference on Management of Data. PODS focuses on theoretical aspects of data management, and the co-location with SIGMOD stimulates interaction between theory-oriented and systems-oriented research. Since the first edition of the symposium in 1982, the PODS papers are distinguished by a rigorous approach to widely diverse problems in data management, often bringing to bear techniques from a variety of different areas, including computational logic, finite model theory, computational complexity, algorithm design and analysis, programming languages, and artificial intelligence.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81374589","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}
Welcome to the Technical Reports Column. If your institution publishes technical reports that you'd like to have included here, please contact me at the email address above.
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3374857.3374862","DOIUrl":"https://doi.org/10.1145/3374857.3374862","url":null,"abstract":"Welcome to the Technical Reports Column. If your institution publishes technical reports that you'd like to have included here, please contact me at the email address above.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74551579","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}
In this column we review the following books: 1. Factor Man, by Matt Ginsberg. A fictional account of what might happen if it turns out that P=NP. Review by William Gasarch. 2. Kolmogorov Complexity and Algorithmic Randomness, by A. Shen, V. A. Uspensky, and N. Vereshchagin. A textbook on this important topic. Review by Hadi Shafei. As always, please contact me to write a review; choose from among the books listed on the next pages, or, if you are interested in anything not on the list, just send me a note.
在本专栏中，我们将回顾以下书籍:马特·金斯伯格(Matt Ginsberg)的《Factor Man》。一个虚构的故事，如果P=NP会发生什么。威廉·加萨奇评论。《Kolmogorov复杂度与算法随机性》，作者:A. Shen, V. A. Uspensky和N. Vereshchagin。一本关于这个重要话题的教科书。Hadi Shafei评论。一如既往，请联系我写评论;从下一页列出的书中选择，或者，如果你对清单上没有的任何书感兴趣，就给我发个短信。
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3374857.3374859","DOIUrl":"https://doi.org/10.1145/3374857.3374859","url":null,"abstract":"In this column we review the following books: 1. Factor Man, by Matt Ginsberg. A fictional account of what might happen if it turns out that P=NP. Review by William Gasarch. 2. Kolmogorov Complexity and Algorithmic Randomness, by A. Shen, V. A. Uspensky, and N. Vereshchagin. A textbook on this important topic. Review by Hadi Shafei. As always, please contact me to write a review; choose from among the books listed on the next pages, or, if you are interested in anything not on the list, just send me a note.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75896099","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}
This Issue's Column! This issue's Open Problem Column is by William Gasarch and is A Problem on Linked Sequences Inspired by an Oliver Roeder Column Request for Columns! I invite any reader who has knowledge of some area to contact me and arrange to write a column about open problems in that area. That area can be (1) broad or narrow or anywhere inbetween, and (2) really important or really unimportant or anywhere inbetween.
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3374857.3374863","DOIUrl":"https://doi.org/10.1145/3374857.3374863","url":null,"abstract":"This Issue's Column! This issue's Open Problem Column is by William Gasarch and is A Problem on Linked Sequences Inspired by an Oliver Roeder Column\u0000 Request for Columns! I invite any reader who has knowledge of some area to contact me and arrange to write a column about open problems in that area. That area can be (1) broad or narrow or anywhere inbetween, and (2) really important or really unimportant or anywhere inbetween.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83326065","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}
SETH vs Approximation Warmest thanks to Aviad Rubinstein and Virginia Vassilevska Williams for their guest column. As you can see, it not only is excitingly covering a lot of exciting work, but also is presenting quite a few open issues; clearly, they are inviting you to join the party!
{"title":"SIGACT News Complexity Theory Column 103","authors":"L. Hemaspaandra","doi":"10.1145/3374857.3374869","DOIUrl":"https://doi.org/10.1145/3374857.3374869","url":null,"abstract":"SETH vs Approximation Warmest thanks to Aviad Rubinstein and Virginia Vassilevska Williams for their guest column. As you can see, it not only is excitingly covering a lot of exciting work, but also is presenting quite a few open issues; clearly, they are inviting you to join the party!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83834700","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}
What would you do if you proved P=NP? If you publish it you might be rich and famous: : : in a world destroyed by cyber terrorists. If you don't publish it someone might beat you to it. Can you make money off of it? Matt Ginsberg's fictional book, Factor Man, grapples intelligently with this question. The premise is that someone (alias Factor Man) has proven P=NP and has a pretty good plan for how to (1) cash in, and (2) not create economic havoc.
{"title":"Review of Factor Man by Matt Ginsberg","authors":"W. Gasarch","doi":"10.1145/3374857.3374860","DOIUrl":"https://doi.org/10.1145/3374857.3374860","url":null,"abstract":"What would you do if you proved P=NP? If you publish it you might be rich and famous: : : in a world destroyed by cyber terrorists. If you don't publish it someone might beat you to it. Can you make money off of it?\u0000 Matt Ginsberg's fictional book, Factor Man, grapples intelligently with this question. The premise is that someone (alias Factor Man) has proven P=NP and has a pretty good plan for how to (1) cash in, and (2) not create economic havoc.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74163647","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：