Full Text Available
Access Full Text at Repository
Search Results - Computer Engineering
-
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: “…Computer Science & IT…”
Get full text
Online Article RSS Article -
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
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: “…Computer Science & IT…”
Get full text
-
Exact and Approximate Algorithms for Polytree Learning
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
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: “…Computer Science & IT…”
Get full text
-
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Visibility Queries in Simple Polygons
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Dynamic Detours
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
A Poisson Process for Submodular Maximization
Published in ArXiv cs.DS Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Tree-independence number of $P_5$-free graphs with no large bicliques
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Packing chromatic critical graphs with radius at most 2
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Inferring Phylogenetic Networks from Allowed and Forbidden LCA-Constraints
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Small Matrices with Small Inverses: Unimodular Zerofree Cases
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Most ReLU Networks Admit Identifiable Parameters
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
An Identity for Catalan Numbers via Restricted Dyck Paths
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Closed form logical error rate approximations for surface codes
Published in ArXiv cs.DM Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
A Skill-Based AI Agentic Pipeline for Library of Congress Subject Indexing
Published in ArXiv cs.DL Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text
-
Implementing True MPI Sessions and Evaluating MPI Initialization Scalability
Published in ArXiv cs.DC Recent Papers (2026)Subjects: “…Computer Science & IT…”
Get full text