Full Text Available
Access Full Text at Repository
Search Results - JDSA~
-
A Unified Approach to Minimizing Symmetric Submodular Functions
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
Online Article RSS Article -
New Bounds for Kernel Sums via Fast Spherical Embeddings
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Exact and Approximate Algorithms for Polytree Learning
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Visibility Queries in Simple Polygons
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Dynamic Detours
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
A Poisson Process for Submodular Maximization
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Faster Algorithms for Shortest Unique or Absent Substrings
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Online Orthogonal Vectors Revisited
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Robust Inverse Quadratic Error Decay with Meshing and Beam Search for Random Subset Sum
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text
-
Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…ArXiv cs.DS Recent Papers…”
Get full text