会议文集


会议名35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024)
中译名《第三十五届ACM-SIAM年度离散算法研讨会,卷2》
机构Society for Industrial and Applied Mathematics (SIAM); Association for Computing Machinery (ACM)
会议日期7-10 January 2024
会议地点Alexandria, Virginia, USA
出版年2024
馆藏号351693


题名作者出版年
Factoring Pattern-Free Permutations into Separable onesEdouard Bonnet; Romain Bourneuf; Colin Geniet; Stephan Thomasse2024
Representative set statements for delta-matroids and the Mader delta-matroidMagnus Wahlstrom2024
On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank ApproximationRaphael Meyer; Cameron Musco; Christopher Musco2024
Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral AlgorithmsChandra Sekhar Mukherjee; Jiapeng Zhang2024
Matrix Perturbation: Davis-Kahan in the Infinity NormAbhinav Bhardwaj; Van Vu2024
A PTAS for l_0-Low Rank Approximation: Solving Dense CSPs over RealsVincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnand de Mesmay; Alantha Newman; Tony Chang Wang2024
Strongly Polynomial Frame Scaling to High PrecisionDaniel Dadush; Akshay Ramachandran2024
Positivity Certificates for Linear RecurrencesAlaa Ibrahim; Bruno Salvy2024
A Unifying Framework for Differentially Private Sums under Continual ObservationMonika Henzinger; Jalaj Upadhyay; Sarvagya Upadhyay2024
Optimal Bounds on Private Graph ApproximationJingcheng Liu; Jalaj Upadhyay; Zongrui Zou2024
Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential PrivacyDavid Rasmussen Lolck; Rasmus Pagh2024
Adjacency Sketches in Adversarial EnvironmentsMoni Naor; Eugene Pekel2024
Sorting and Selection in Rounds with Adversarial ComparisonsChristopher Trevisan2024
Deterministic Byzantine Agreement with Adaptive O(n · f) CommunicationFatima Elsheimy; Giorgos Tsimos; Charalampos Papamanthou2024
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small ClassesEdouard Bonnet; Julien Duron; John Sylvester; Viktor Zamaraev; Maksim Zhukovskii2024
On the Extremal Functions of Acyclic Forbidden 0-1 MatricesSeth Pettie; Gabor Tardos2024
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is LogarithmicJesse Campion Loth; Kevin Halasz; Tomas Masarik; Bojan Mohar; Robert Samal2024
Triangulations Admit Dominating Sets of Size 2n/7Aleksander B. G. Christiansen; Eva Rotenberg; Daniel Rutschmann2024
The Grid-Minor Theorem RevisitedVida Dujmovic; Robert Hickingbotham; Jdrzej Hodor; Gwenael Joret; Hoang La; Piotr Micek; Pat Morin; Clement Rambaud; David R. Wood2024
Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with ConstraintsSharareh Alipour; Amir Jafari; Mohammad Hassan Mazidi; Seyed Abolfazl Najafian2024
12