Invited Article Foreword

É. Tardos
{"title":"Invited Article Foreword","authors":"É. Tardos","doi":"10.1145/3186892","DOIUrl":null,"url":null,"abstract":"The Invited Article section of this issue consists of the article “Worst-Case Optimal Join Algorithms” by Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra, which won the best paper award at the 35th Annual ACM SIGMOD/PODS International Conference on Management of Data (PODS’12). We would like to thank the PODS’12 Program Committee for their help in selecting this invited work, and we also thank editor Phokion Kolaitis for handling the paper.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-03-15","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/3186892","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 the article “Worst-Case Optimal Join Algorithms” by Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra, which won the best paper award at the 35th Annual ACM SIGMOD/PODS International Conference on Management of Data (PODS’12). We would like to thank the PODS’12 Program Committee for their help in selecting this invited work, and we also thank editor Phokion Kolaitis for handling the paper.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
特邀文章前言
本期特邀文章部分由Hung Q. Ngo, Ely Porat, Christopher r和Atri Rudra的文章“最坏情况下最优连接算法”组成,该文章在第35届ACM SIGMOD/PODS国际数据管理会议(PODS ' 12)上获得最佳论文奖。我们要感谢PODS ' 12 Program Committee在选择这篇受邀作品时的帮助,我们也要感谢编辑Phokion Kolaitis对论文的处理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound The Reachability Problem for Two-Dimensional Vector Addition Systems with States Invited Articles Foreword On Nonconvex Optimization for Machine Learning Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1