TILens turns technical updates into a focused daily brief: official releases,
trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:2607.07085v3 Announce Type: replace-cross Abstract: The Adaptive Data Analysis (ADA) problem formalizes the challenge of preventing false discovery and overfitting when a dataset is repeatedly reused. Formally,…
arXiv:2602.13861v4 Announce Type: replace Abstract: We introduce a variant of the multiway cut that we call the min-max connected multiway cut. Given a graph $G=(V,E)$ and a set $\Gamma\subseteq V$ of $t$ terminals,…
arXiv:2611.24386v1 Announce Type: new Abstract: We study integer programs $\min\{\mathbf{c}^{T}\mathbf{x}: A\mathbf{x}=\mathbf{b},\mathbf{l}\le\mathbf{x}\le\mathbf{u},\mathbf{x}\in\mathbb{Z}^n\}$ with a fixed number $d$…
arXiv:2611.17050v3 Announce Type: replace Abstract: We give algorithms for maintaining diameter in the dynamic model, and for answering farthest-neighbor queries on a fixed point set, in high-dimensional Euclidean…
arXiv:2611.24750v1 Announce Type: new Abstract: We present an algorithm that, given read-only access to the adjacency matrix of an $n$-vertex graph $G$, computes the number of $6$-cliques in $G$ using $O(n^{5.97})$ time…
arXiv:2611.23431v1 Announce Type: cross Abstract: We study the spectral distribution of the least squares solution to a random linear system whose unknown is a symmetric matrix. In the normalized and isotropic setting,…
arXiv:2611.24167v1 Announce Type: cross Abstract: The envy cycle elimination (ECE) algorithm is a fundamental algorithm for the fair allocation of indivisible goods, guaranteeing an allocation that is envy-free up to…
arXiv:2611.01028v2 Announce Type: replace-cross Abstract: Sampling a uniformly random permutation of $[n]$ in parallel is a coordination problem: $n$ processors, one per coordinate, must output distinct values. A single…
arXiv:2611.24211v1 Announce Type: new Abstract: We introduce expand-and-reduce, a framework that augments classical reduction rules with a new type of optimality-preserving operation, called an expansion rule. While a…
arXiv:2609.24804v2 Announce Type: replace Abstract: We show that isomorphism of $F$-free tournaments can be solved in FPT time $f(k) \cdot n^{O(1)}$, where $k$ denotes the size of $F$, and $n$ denotes the size of the…
arXiv:2611.23540v1 Announce Type: new Abstract: A walker, such as a packet carrying a secret share, must reach a known target in an unknown graph while avoiding a fixed set of fatal vertices (compromised relays in the…
arXiv:2611.24768v1 Announce Type: new Abstract: For a preprocessed pattern of length $m$ and a streaming text, we give two algorithms that estimate the Hamming distance at every alignment to relative error…
arXiv:2505.02977v4 Announce Type: replace-cross Abstract: Incomplete Cholesky (IC) preconditioners are the standard black-box, memory-efficient first resort for large graph Laplacian systems, but classical IC can break…
arXiv:2609.06318v3 Announce Type: replace-cross Abstract: Fixed shipment costs encourage large orders, while inventory and customer backlog costs favor frequent replenishment. In a serial system, the stages must also…
arXiv:2611.23653v1 Announce Type: new Abstract: We give a polynomial-space, deterministic, exact algorithm for counting linear extensions of partial orders over $n$ elements, with running time $O^*((2\sqrt{2})^{n})…
arXiv:2611.24385v1 Announce Type: new Abstract: In the open online traveling salesperson problem, requests appear over time at different positions of a metric space. A single agent traveling at unit speed must serve all…
arXiv:2611.23617v1 Announce Type: cross Abstract: Diffusion modeling is a popular method of sampling from a complex, high-dimensional distribution $p$ using learned approximations of its (noised) score functions.…
arXiv:2611.24786v1 Announce Type: new Abstract: SotSort is a stable comparison sort whose single code path runs with anything from a fixed 16 KB buffer to a full n-element buffer. Its core is a stable quicksort that…
arXiv:2611.21294v2 Announce Type: replace Abstract: We give a one-pass algorithm that estimates the maximum matching size of an arbitrary simple graph within a constant factor using $O(\log^2 n)$ bits of space. The…
arXiv:2611.24239v1 Announce Type: new Abstract: We study database query optimization for Cartesian products. This problem is equivalent to finding an optimal plan for multiplying non-negative integers. We call this…