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)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries. arxiv.org/abs/2510.16741


An Exact Algorithm for the Unanimous Vote Problem. arxiv.org/abs/2510.16678


Online computation of normalized substring complexity. arxiv.org/abs/2510.16454


Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance. arxiv.org/abs/2510.16351


A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates. arxiv.org/abs/2510.16336


Near-linear time subhypergraph counting in bounded degeneracy hypergraphs. arxiv.org/abs/2510.16330


Is Zadeh's Least-Entered Pivot Rule Exponential?. arxiv.org/abs/2510.16055


Deriving the Gradients of Some Popular Optimal Transport Algorithms. arxiv.org/abs/2504.08722


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


Non-unitary enhanced transfer efficiency in quantum walk search on complex networks. arxiv.org/abs/2503.01762


Vizing's Theorem in Deterministic Almost-Linear Time. arxiv.org/abs/2510.12619


A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses. arxiv.org/abs/2510.15790


PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization. arxiv.org/abs/2510.15712


Temporal Graph Reconfiguration for Always-Connected Graphs. arxiv.org/abs/2510.15593


Revoke vs. Restart in Unweighted Throughput Scheduling. arxiv.org/abs/2510.15318


Loading...

Something went wrong.


Something went wrong.