Data Structures and Algorithms Papers

New Data Structures and Algorithms papers from data structures and analysis of algor. Thank you to arXiv for use of its open access interoperability.

[Data Structures and Algorithms Papers @AlgorithmPapers]

The Grothendieck Constant is Less Than π/2 log (1+ √2) - 10⁻⁵

Alan Li, Rahul Saha, Anton Xue, Adam Klivans, Pravesh K Kothari, Raghu Meka, Swarat Chaudhury
https://t.co/OdhY6XyErb [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Ranked MSO-enumeration over compressed words

Markus Lohrey
https://t.co/zoUejXUh7B [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙱 𝚌𝚜.𝙻𝙾]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Revisiting O(n log log n) chaining for anchored edit distance

Nicola Rizzo, Ragnar Groot Koerkamp
https://t.co/DaxXg0ebB8 [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Deterministic Distance Approximation in MPC via Improved Hitting Sets

Kyungjin Cho, Michal Dory, Yannic Maus, Tijn de Vos
https://t.co/Wexj7k5ooq [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙲]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Parallel Metric Skiplists and Nearest Neighbor Search

Xiangyun Ding, Rohin Garg, Yan Gu, Yihan Sun
https://t.co/Dx0bkXrfpH [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Online K-d tree for approximate neighborhood search in data streams

Eduardo V. L. Barboza, Robert Sabourin, Rafael M. O. Cruz
https://t.co/PMp3m0PQkX [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Terminal Steiner tree problem: Complexity and Algorithms

Jyothish S, Sadagopan Narasimhan
https://t.co/BbgwTuD3Tw [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙼]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence

Peter Clifford, Raphaël Clifford
https://t.co/jQ0euTLIoK [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙲𝙾]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration

Karl Bringmann, Nick Fischer, Yanheng Wang
https://t.co/9I4T93Xl5l [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙱]

[Data Structures and Algorithms Papers @AlgorithmPapers]

The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines

Kao-Chuan Liang, Ya-Chun Liang
https://t.co/Ww1Bvf6b03 [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
https://t.co/DycHZSu4tY [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Towards Optimal Robustness in Learning-Augmented Paging

Peng Chen, Hailiang Zhao, Xueyan Tang, Yixuan Wang, Shuiguang Deng
https://t.co/S0pOAF6hPm [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙻𝙶]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Adversarial Configurations for the ReCom Transition Function

Micah Gold
https://t.co/nESkUNQRDO [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙼]

[Data Structures and Algorithms Papers @AlgorithmPapers]

On Thin Perfect Matchings up to Polylogarithmic Factors

Alireza Haqi, Shayan Oveis Gharan
https://t.co/NY8oKR7Fp2 [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Multiagent Matroid Upgrading: Greedy is Fair and Efficient

Qingwen Ma, Chao Peng, Changfeng Xu, Chenyang Xu, Ruilong Zhang
https://t.co/itCIqKESTc [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme

Groot Koerkamp, Ragnar
https://t.co/pvDxtiU2Va [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Dynamic Breadth First Search with Predictions

Shahbaz Khan, Shubham Kumar Verma, Utkarsh Lohiya
https://t.co/8nCEv6vWoN [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Constant-Stretch Rounding on the Hypersimplex

Nima Anari, Alireza Haqi, Eric Ma
https://t.co/4W0YL48md9 [𝚌𝚜.𝙳𝚂]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs

Qiming Fang, Sihong Shao, Yuxuan Wu
https://t.co/ndbGMp3uKg [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙲𝙾]

[Data Structures and Algorithms Papers @AlgorithmPapers]

Easy, robust approximate message passing for planted spike models

Misha Ivkov, Tselil Schramm
https://t.co/OUR0mF0Ohs [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙻𝙶 𝚖𝚊𝚝𝚑.𝚂𝚃 𝚜𝚝𝚊𝚝.𝙼𝙻 𝚜𝚝𝚊𝚝.𝚃𝙷]