会议文集


会议名36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
中译名《第三十六届ACM-SIAM年度离散算法研讨会，卷7》
机构Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期12-15 January 2025
会议地点New Orleans, Louisiana, USA
出版年2025
馆藏号355121


题名作者出版年
Partial Synchrony for Free: New Upper Bounds for Byzantine AgreementPierre Civit; Muhammad Ayaz Dzulfikar; Seth Gilbert; Rachid Guerraoui; Jovan Komatovic; Manuel Vidigueira; Igor Zablotchi2025
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree CoversSujoy Bhore; Balazs Keszegh; Andrey Kupavskii; Hung Le; Alexandre Louvet; Domotor Palvolgyi; Csaba D. Toth2025
A Lower Bound for Light Spanners in General GraphsGreg Bodwin; Jeremy Flics2025
Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and moreAdam Karczmarz; Da Wei Zheng2025
Having Hope in Missing Spanners: New Distance Preservers and Light HopsetsShimon Kogan; Merav Parter2025
Improved Online Reachability PreserversGreg Bodwin; Tuong Le2025
New Separations and Reductions for Directed Hopsets and PreserversGary Hoppenworth; Yinzhan Xu; Zixuan Xu2025
Tree Independence Number IV. Even-hole-free graphsMaria Chudnovsky; Peter Gartland; Sepehr Hajebi; Daniel Lokshtanov; Sophie Spirkl2025
A Refutation of the Pach-Tardos Conjecture for 0-1 MatricesSeth Pettie; Gabor Tardos2025
Recognizing Sumsets is NP-CompleteAmir Abboud; Nick Fischer; Ron Safier; Nathan Wallheimer2025
A topological proof of the Hell-Nesetril dichotomySebastian Meyer; Jakub Oprsal2025
Sumsets, 3SUM, Subset Sum: Now for Real!Nick Fischer2025
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern MatchingNick Fischer; Ce Jin; Yinzhan Xu2025
Beating Bellman's Algorithm for Subset SumKarl Bringmann; Nick Fischer; Vasileios Nakos2025
Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and MoreMina Dalirrooyfard; Andrea Lincoln; Barna Saha; Virginia Vassilevska Williams2025
Exact Thresholds for Noisy Non-Adaptive Group TestingJunren Chen; Jonathan Scarlett2025
Inapproximability of Maximum Diameter Clustering for Few ClustersHenry Fleischmann; Kyrylo Karlov; Karthik C. S.; Ashwin Padaki; Stepan Zharkov2025
Coresets for Constrained Clustering: General Assignment Constraints and Improved Size BoundsLingxiao Huang; Jian Li; Pinyan Lu; Xuan Wu2025
A Tight VC-Dimension Analysis of Clustering Coresets with ApplicationsVincent Cohen-Addad; Andrew Draganov; Matteo Russo; David Saulpic; Chris Schwiegelshohn2025
Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean MetricPankaj K. Agarwal; Sharath Raghvendra; Pouyan Shirzadian; Keegan Yao2025
12



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024