AlgorithmPapers's profile picture. Covers data structures and analysis of algorithms.
New submissions to http://arxiv.org (not affiliated with arXiv)

Data Structures and Algorithms Papers

@AlgorithmPapers

Covers data structures and analysis of algorithms. New submissions to http://arxiv.org (not affiliated with arXiv)

$\ell_2/\ell_2$ Sparse Recovery via Weighted Hypergraph Peeling. arxiv.org/abs/2510.20361


Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems. arxiv.org/abs/2510.20341


Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion. arxiv.org/abs/2510.20288


Optimal Rounding for Two-Stage Bipartite Matching. arxiv.org/abs/2510.20153


Parallel Joinable B-Trees in the Fork-Join I/O Model. arxiv.org/abs/2510.20053


On Hardness and Approximation of Broadcasting in Sparse Graphs. arxiv.org/abs/2510.20026


Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders. arxiv.org/abs/2508.18017


Nearly Optimal Bounds for Stochastic Online Sorting. arxiv.org/abs/2508.07823


Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor. arxiv.org/abs/2506.01162


Entrywise Approximation for Matrix Inversion and Linear Systems. arxiv.org/abs/2504.19054


Tight Lower Bounds for Central String Queries in Compressed Space. arxiv.org/abs/2510.19820


Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. arxiv.org/abs/2510.19815


A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space. arxiv.org/abs/2510.19793


Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. arxiv.org/abs/2510.19780


Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings. arxiv.org/abs/2510.19750


Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck. arxiv.org/abs/2510.19175


Loading...

Something went wrong.


Something went wrong.