Full Text Available
Access Full Text at Repository
Search Results - JDSA~
-
FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
Online Article RSS Article -
Mistake-Bounded Language Generation
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Handicap reduction for linear complementarity problems
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Dynamic Rank, Basis, and Matching
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Online Steiner Forest with Recourse
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Streaming Complexity Separations for Dense and Sparse Graphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Dynamic Edge Coloring of Forests
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
A Scalable and Unified Framework to Weighted Rank Aggregation
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Deterministically finding an element of large order in $mathbb{Z}_N^*$
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Computing Flows in Subquadratic Space
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Witness-Sensitive Detection of Induced Diamonds
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text