{"title":"Invited Articles Foreword","authors":"É. Tardos","doi":"10.1145/3151720","DOIUrl":null,"url":null,"abstract":"The Invited Article section of this issue consists of two papers. The paper “Communication Steps for Parallel Query Processing,” by Paul Beame, Paraschos Koutris, and Dan Suciu, was invited from the 32nd and 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC’13–14). The paper “The matching polytope has exponential extension complexity,” by Thomas Rothvoss, won the best paper award at the 46th ACM Symposium on Theory of Computing (STOC’14). We want to thank the PODC’13 and PDOC’14 and STOC’14 Program Committees for their help in selecting these invited papers. We thank editor Phokion Kolaitis for handling the first of the two papers.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"2 1","pages":"1 - 1"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3151720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The Invited Article section of this issue consists of two papers. The paper “Communication Steps for Parallel Query Processing,” by Paul Beame, Paraschos Koutris, and Dan Suciu, was invited from the 32nd and 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC’13–14). The paper “The matching polytope has exponential extension complexity,” by Thomas Rothvoss, won the best paper award at the 46th ACM Symposium on Theory of Computing (STOC’14). We want to thank the PODC’13 and PDOC’14 and STOC’14 Program Committees for their help in selecting these invited papers. We thank editor Phokion Kolaitis for handling the first of the two papers.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
