The paper formally models structure-informed multiple sequence alignment (MSA-S) as an NP-complete optimization problem, establishing a strong computational complexity baseline for the field.

The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

The paper empirically and theoretically demonstrates that incorporating Lamarckian and Baldwinian mechanisms into evolutionary algorithms significantly outperforms standard Darwinian evolution, especi…

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

This paper settles the complexity of three sketching problems in graphs and distributions.

RootGuard introduces a dependency-aware privacy mechanism that sanitizes private data roots once, ensuring consistent privacy guarantees across multiple multi-turn agent interactions, significantly ou…

The paper refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

The paper introduces FormInv, a measurement protocol that reveals significant semantic inconsistencies in existing mathematical reasoning benchmarks, showing that standard accuracy metrics fail to cap…

The paper introduces CaDDTree, a cost-aware method that optimizes token throughput by jointly selecting the tree structure and node budget for speculative decoding, outperforming existing methods like…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

The paper presents the first general mechanism for counting arbitrary acyclic graph patterns under Local Differential Privacy (LDP), addressing challenges in pattern construction and node duplication.

The paper proposes a steganographic mechanism, analogous to genetic inheritance, to track the lineage of synthetic information within a cyber ecosystem.

The paper proposes a novel two-stage framework to differentially privatize tables of counts by focusing on preserving the accuracy of the underlying count distribution, introducing the specialized cyc…

The paper introduces CAT, a novel coverage-guided fuzzing tool that overcomes the limitations of existing fuzzers for complex, multi-object cryptographic repositories like RPKI, leading to the discove…