ACM-SIAM离散算法研讨会（SODA）2020特刊简介

IF 0.9 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

ACM Transactions on Algorithms Pub Date : 2022-10-31 DOI:10.1145/3561912

Gautam Kamath, Sepehr Assadi, A. Driemel, Janardhan Kulkarni

{"title":"ACM-SIAM离散算法研讨会（SODA）2020特刊简介","authors":"Gautam Kamath, Sepehr Assadi, A. Driemel, Janardhan Kulkarni","doi":"10.1145/3561912","DOIUrl":null,"url":null,"abstract":"the role of interactivity in local differential a close connection between the communication complexity of a two-player problem and the sample complexity of its sequentially-interactive locally-private multi-player analogue. the authors to show the first exponential separation between the sample complexity of sequentially- and fully-interactive locally private protocols. Furthermore, construct an infinite hierarchy of sequentially-interactive protocols (parameterized by their number of rounds of interactivity), where each level of the hierarchy is exponentially separated from the one before.","PeriodicalId":50922,"journal":{"name":"ACM Transactions on Algorithms","volume":"18 1","pages":"1 - 2"},"PeriodicalIF":0.9000,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020\",\"authors\":\"Gautam Kamath, Sepehr Assadi, A. Driemel, Janardhan Kulkarni\",\"doi\":\"10.1145/3561912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"the role of interactivity in local differential a close connection between the communication complexity of a two-player problem and the sample complexity of its sequentially-interactive locally-private multi-player analogue. the authors to show the first exponential separation between the sample complexity of sequentially- and fully-interactive locally private protocols. Furthermore, construct an infinite hierarchy of sequentially-interactive protocols (parameterized by their number of rounds of interactivity), where each level of the hierarchy is exponentially separated from the one before.\",\"PeriodicalId\":50922,\"journal\":{\"name\":\"ACM Transactions on Algorithms\",\"volume\":\"18 1\",\"pages\":\"1 - 2\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Algorithms\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3561912\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Algorithms","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3561912","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

交互性在局部微分中的作用二人问题的通信复杂性与其顺序交互式局部私有多人模拟的样本复杂性之间的密切联系。作者展示了顺序和完全交互式本地私有协议的样本复杂性之间的第一个指数分离。此外，构建一个顺序交互协议的无限层次结构（通过其交互轮次进行参数化），其中层次结构的每个级别都与之前的级别呈指数级分离。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020

the role of interactivity in local differential a close connection between the communication complexity of a two-player problem and the sample complexity of its sequentially-interactive locally-private multi-player analogue. the authors to show the first exponential separation between the sample complexity of sequentially- and fully-interactive locally private protocols. Furthermore, construct an infinite hierarchy of sequentially-interactive protocols (parameterized by their number of rounds of interactivity), where each level of the hierarchy is exponentially separated from the one before.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Transactions on Algorithms COMPUTER SCIENCE, THEORY & METHODS-MATHEMATICS, APPLIED

CiteScore

3.30

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： ACM Transactions on Algorithms welcomes submissions of original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis. Most welcome are new algorithms and data structures, new and improved analyses, and complexity results. Specific areas of computation covered by the journal include combinatorial searches and objects; counting; discrete optimization and approximation; randomization and quantum computation; parallel and distributed computation; algorithms for graphs, geometry, arithmetic, number theory, strings; on-line analysis; cryptography; coding; data compression; learning algorithms; methods of algorithmic analysis; discrete algorithms for application areas such as biology, economics, game theory, communication, computer systems and architecture, hardware design, scientific computing