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)

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


From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction. arxiv.org/abs/2510.19049


Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity. arxiv.org/abs/2510.03899


Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs. arxiv.org/abs/2503.12211


A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost. arxiv.org/abs/2508.11006


Does block size matter in randomized block Krylov low-rank approximation?. arxiv.org/abs/2508.06486


Optimal mass estimation in the conditional sampling model. arxiv.org/abs/2503.12518


Simple Sublinear Algorithms for $(\Delta+1)$ Vertex Coloring via Asymmetric Palette Sparsification. arxiv.org/abs/2502.17629


Static Retrieval Revisited: To Optimality and Beyond. arxiv.org/abs/2510.18237


Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams. arxiv.org/abs/2510.18180


Loading...

Something went wrong.


Something went wrong.