Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:2508.12627v3 Announce Type: replace-cross Abstract: Higher-order $U$-statistics abound in fields such as statistics, machine learning, and computer science, but are known to be highly time-consuming to compute in…
arXiv:2608.25197v1 Announce Type: new Abstract: The optimal discretization problem asks, given two disjoint sets of points $R$ and $B$ in the plane, for a minimal family of horizontal and vertical lines that separate…
arXiv:2608.22247v2 Announce Type: replace Abstract: Let $k_{1,\varepsilon}(n)$ be the smallest number of real linear measurements needed by a randomized oblivious sketch that estimates the nuclear norm of every fixed…
arXiv:2605.29916v2 Announce Type: replace-cross Abstract: The Random Gradient hyper-heuristic was recently shown to be able to learn the optimal neighbourhood size when optimizing the LeadingOnes benchmark via the…
arXiv:2608.25533v1 Announce Type: cross Abstract: Given a probability distribution $p = (p_1, \dots, p_n)$ and an integer $1\leq m \leq n$, a contiguous aggregation of $p$ is a probability distribution $q = (q_1, \dots,…
arXiv:2608.25273v1 Announce Type: new Abstract: We analyze exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together. Their leading uncentered terms cancel in…
arXiv:2608.25530v1 Announce Type: new Abstract: We study the computation of minimum spanning trees subject to local degree constraints. Recent work (ICALP 2026) established that three natural formalizations of this…
arXiv:2608.26037v1 Announce Type: new Abstract: We give a randomized data structure for undirected weighted graphs that are partially dynamic, i.e., that undergo either only edge insertions or only edge deletions. The…
arXiv:2608.25290v1 Announce Type: new Abstract: Classical paging couples every miss to an immediate replacement. We ask what remains of its algorithmic structure when a miss may wait. In our per-replacement…
arXiv:2608.25179v1 Announce Type: new Abstract: Suppose two parties, Alice and Bob, hold long character strings, $X$ and $Y$, respectively, and they are interested in determining how similar $X$ and $Y$ are. {Moreover,…
arXiv:2605.23319v2 Announce Type: replace Abstract: Background: Identifying a subset of taxa that maximizes phylogenetic diversity is a cornerstone of quantitative conservation planning. Traditionally, phylogenetic…
arXiv:2602.00272v2 Announce Type: replace-cross Abstract: Safra's distributed termination detection algorithm employs a logical token ring structure within a distributed network; only passive nodes forward the token,…
arXiv:2608.25032v1 Announce Type: new Abstract: The problem of pattern matching, that is, finding all occurrences of a given pattern in a string, is one of the fundamental problems in computer science that has…
arXiv:2608.26047v1 Announce Type: new Abstract: We study strong coresets for $\ell_p$ subspace approximation. Given $\A\in\R^{n\times d}$, the goal is to sample and rescale a small number of its rows to form $\Smat\A$…
arXiv:2604.15298v3 Announce Type: replace-cross Abstract: An $n$-qubit Dicke state of weight $k$, is the uniform superposition over all $n$-bit strings of Hamming weight $k$. Dicke states are central to quantum…
arXiv:2608.24971v1 Announce Type: new Abstract: We study the Lipschitz stability of attention retrieval in hyperbolic spaces. Existing methods lack deterministic guarantees on attention-weight preservation under…
arXiv:2608.25212v1 Announce Type: new Abstract: The notion of linear neighborhood complexity is a very general structural assumption on a graph class, covering most classes of sparse graphs such as planar graphs, graphs…
arXiv:2608.24537v1 Announce Type: cross Abstract: Maximizing Nash welfare over indivisible goods is a central problem in resource allocation. For additive valuations, the best-known approximation factor is roughly…
arXiv:2508.06216v2 Announce Type: replace-cross Abstract: Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is,…
arXiv:2608.25491v1 Announce Type: new Abstract: It is proved that, for every $\delta \in (0,1)$, the Glauber dynamics for the uniform distribution on proper $q$-colorings is rapidly mixing when $q \geq (1+\delta)\Delta$…
Showing 1 day · 35 items available
