会议文集


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


题名作者出版年
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and ArboricityTijn de Vos; Aleksander B. G. Christiansen2025
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per OperationAntoine El-Hayek; Monika Henzinger; Jason Li2025
Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router DecompositionJulia Chuzhoy; Merav Parter2025
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time BarrierAnton Bukov; Shay Solomon; Tianyi Zhang2025
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph StreamsSepehr Assadi; Soheil Behnezhad; Christian Konrad; Kheeran K. Naidu; Janani Sundaresan2025
Quartic quantum speedups for planted inferenceAlexander Schmidhuber; Ryan O'Donnell; Robin Kothari; Ryan Babbush2025
Triply efficient shadow tomographyRobbie King; David Gosset; Robin Kothari; Ryan Babbush2025
On Estimating the Trace of Quantum State PowersYupan Liu; Qisheng Wang2025
A Quantum Speed-Up for Approximating the Top Eigenvectors of a MatrixYanlin Chen; Andras Gilyen; Ronald de Wolf2025
Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant DepthJoel Rajakumar; James D. Watson; Yi-Kai Liu2025
Lipschitz Continuous Algorithms for Covering ProblemsSoh Kumabe; Yuichi Yoshida2025
Approximately Counting Knapsack Solutions in Subquadratic TimeWeiming Feng; Ce Jin2025
Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable GuaranteesSwati Gupta; Jai Moondra; Mohit Singh2025
Approximating Traveling Salesman Problems Using a Bridge LemmaMartin Bohm; Zachary Friggstad; Tobias Momke; Joachim Spoerhase2025
Min-CSPs on Complete InstancesAditya Anand; Euiwoong Lee; Amatya Sharma2025
Constraint Satisfaction Problems with AdviceSuprovat Ghoshal; Konstantin Markarychev; Yury Markarychev2025
New Prophet Inequalities via Poissonization and ShardingElfarouk Harb2025
Prophet Inequalities: Competing with the Top l Items is EasyMathieu Molina; Nicolas Gast; Patrick Loiseau; Vianney Perchet2025
New Combinatorial Insights for Monotone ApportionmentJavier Cembrano; Jose Correa; Ulrike Schmidt-Kraepelin; Alexandros Tsigonias-Dimitriadis; Victor Verdugo2025
Designing Automated Market Makers for Combinatorial Securities: A Geometric ViewpointPrommy Sultana Hossain; Xintong Wang; Fang-Yi Yu2025
12