长垣产业园区科技文献服务平台 | cy.gmachineinfo.com

会议文集

会议名	34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)
中译名	《第三十四届ACM-SIAM年度离散算法研讨会，卷7》
机构	Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期	22-25 January 2023
会议地点	Florence, Italy
出版年	2023
馆藏号	348053

题名	作者	出版年
Almost-Linear Planted Cliques Elude the Metropolis Process	Zongchen Chen; Elchanan Mossel; Ilias Zadik	2023
The Need for Seed (in the abstract Tile Assembly Model)	Andrew Alseth; Matthew J. Patitz	2023
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth	Krishnendu Chatterjee; Tobias Meggendorfer; Raimundo Saona; Jakub Svoboda	2023
Spatial mixing and the random-cluster dynamics on lattices	Reza Gheissari; Alistair Sinclair	2023
Online Lewis Weight Sampling	David P. Woodruff; Taisuke Yasuda	2023
Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity	Yaonan Jin; Daogao Liu; Zhao Song	2023
Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms	Karl Bringmann; Michael Kapralov; Mikhail Makarov; Vasileios Nakos; Amir Yagudin; Amir Zandieh	2023
Cubic Goldreich-Levin	Dain Kim; Anqi Li; Jonathan Tidor	2023
Query Complexity of the Metric Steiner Tree Problem	Yu Chen; Sanjeev Khanna; Zihan Tan	2023
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders	Pan Peng; Yuichi Yoshida	2023
Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential Privacy	Vitaly Feldman; Audra McMillan; Kunal Talwar	2023
Private Query Release via the Johnson-Lindenstrauss Transform	Aleksandar Nikolov	2023
Almost Tight Error Bounds on Differentially Private Continual Counting	Monika Henzinger; Jalaj Upadhyay; Sarvagya Upadhyay	2023
Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds	Justin Y. Chen; Badih Ghazi; Ravi Kumar; Pasin Manurangsi; Shyam Narayanan; Jelani Nelson; Yinzhan Xu	2023
Private Convex Optimization in General Norms	Sivakanth Gopi; Yin Tat Lee; Daogao Liu; Ruoqi Shen; Kevin Tian	2023
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mis match Matching	Ce Jin; Jakob Nogler	2023
Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees	Dominik Kempa; Tomasz Kociumaka	2023
Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance	Michal Koucky; Michael Saks	2023
Optimal Square Detection Over General Alphabets	Jonas Ellert; Pawel Gawrychowski; Garance Gourdel	2023
Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness	Xin Lyu; Weihao Zhu	2023