发布求助
文献互助 智能选刊 最新文献

Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms最新文献

筛选
英文 中文
Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms 维无关稀疏傅里叶变换的遍历FFT计算树
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch177
K. Bringmann, Michael Kapralov, M. Makarov, Vasileios Nakos, Amir Yagudin, A. Zandieh
{"title":"Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms","authors":"K. Bringmann, Michael Kapralov, M. Makarov, Vasileios Nakos, Amir Yagudin, A. Zandieh","doi":"10.1137/1.9781611977554.ch177","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch177","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"34 1","pages":"4768-4845"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78099240","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}
引用次数: 0
A half-integral Erdős-Pósa theorem for directed odd cycles 有向奇环的半积分Erdős-Pósa定理
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch118
K. Kawarabayashi, S. Kreutzer, O-joung Kwon, Qiqin Xie
{"title":"A half-integral Erdős-Pósa theorem for directed odd cycles","authors":"K. Kawarabayashi, S. Kreutzer, O-joung Kwon, Qiqin Xie","doi":"10.1137/1.9781611977554.ch118","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch118","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"44 1","pages":"3043-3062"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90857764","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}
引用次数: 0
Learning Hierarchical Cluster Structure of Graphs in Sublinear Time 在亚线性时间内学习图的层次聚类结构
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch36
M. Kapralov, Akash Kumar, Silvio Lattanzi, A. Mousavifar
{"title":"Learning Hierarchical Cluster Structure of Graphs in Sublinear Time","authors":"M. Kapralov, Akash Kumar, Silvio Lattanzi, A. Mousavifar","doi":"10.1137/1.9781611977554.ch36","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch36","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"13 2 1","pages":"925-939"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75540186","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}
引用次数: 2
Conflict-free hypergraph matchings 无冲突超图匹配
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch115
Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev
{"title":"Conflict-free hypergraph matchings","authors":"Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev","doi":"10.1137/1.9781611977554.ch115","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch115","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"11 1","pages":"2991-3005"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81549532","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}
引用次数: 10
Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds 超过Gilbert-Varshamov和Tsfasman-Vlăduţ-Zink界的非线性码
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch157
Shu Liu, Tingyi Wu, C. Xing
{"title":"Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds","authors":"Shu Liu, Tingyi Wu, C. Xing","doi":"10.1137/1.9781611977554.ch157","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch157","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"15 1","pages":"4104-4114"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85290317","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}
引用次数: 1
Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity 任意常数维下的超分辨率和鲁棒稀疏连续傅里叶变换:近线性时间和样本复杂度
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch176
Yaonan Jin, Daogao Liu, Zhao Song
{"title":"Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity","authors":"Yaonan Jin, Daogao Liu, Zhao Song","doi":"10.1137/1.9781611977554.ch176","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch176","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"15 1","pages":"4667-4767"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83076859","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}
引用次数: 0
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete 具有确定性ε-跃迁的下推系统的弱双模拟有限性是2- exptime完备的
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch105
Stefan Göller, P. Parys
{"title":"Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete","authors":"Stefan Göller, P. Parys","doi":"10.1137/1.9781611977554.ch105","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch105","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"30 1","pages":"2777-2815"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81251622","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}
引用次数: 0
Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers 直径简化捷径和最小链覆盖的快速统一算法
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch9
Shimon Kogan, M. Parter
{"title":"Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers","authors":"Shimon Kogan, M. Parter","doi":"10.1137/1.9781611977554.ch9","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch9","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"25 1","pages":"212-239"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72523251","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}
引用次数: 3
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage 无自行车最大k权SAT和最大覆盖的参数化逼近方案
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch143
P. Jain, Lawqueen Kanesh, Fahad Panolan, S. Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
{"title":"Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage","authors":"P. Jain, Lawqueen Kanesh, Fahad Panolan, S. Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana","doi":"10.1137/1.9781611977554.ch143","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch143","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"57 1","pages":"3713-3733"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74186851","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}
引用次数: 0
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths 基于递减跳限最短路径的更快确定性最坏情况全动态全对最短路径
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch4
S. Chechik, Tianyi Zhang
{"title":"Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths","authors":"S. Chechik, Tianyi Zhang","doi":"10.1137/1.9781611977554.ch4","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch4","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"14 1","pages":"87-99"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85468831","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}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书